joist-core 2.3.0 → 2.4.0

package/build/queries/find/QueryParser.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryParser.cjs","names":["ConditionBuilder","abbreviation","filterSoftDeletes","getBaseMeta","isScope","parseEntityFilter","isAlias","kq","kqDot","getAliasMgmt","resolveScope","newAlias","isScopeJoinFilter","fail","getConstructorFromTaggedId","groupBy","mapToDb","keyToNumber","maybeResolveReferenceToId","getMaybeCtiAlias","alias","lazyExcludedSelects","getMetadataForTable","isDeferredCondition","predicateBrand","isDeferredAliasCondition","deferredAliasSym","stiSubtypeFilter"],"sources":["../../../src/queries/find/QueryParser.ts"],"sourcesContent":["import { groupBy } from \"joist-utils\";\nimport { getConstructorFromTaggedId, getMetadataForTable } from \"src/configure.ts\";\nimport type { Entity } from \"src/Entity.ts\";\nimport { type EntityMetadata, type Field, getBaseMeta } from \"src/EntityMetadata.ts\";\nimport { keyToNumber, maybeResolveReferenceToId } from \"src/keys.ts\";\nimport { ConditionBuilder } from \"src/queries/ConditionBuilder.ts\";\nimport { type ConditionInput, predicateBrand } from \"src/queries/conditions.ts\";\nimport { filterSoftDeletes, lazyExcludedSelects, stiSubtypeFilter } from \"src/queries/entityQueryUtils.ts\";\nimport {\n  type AliasMgmt,\n  getAliasMgmt,\n  getMaybeCtiAlias,\n  isAlias,\n  alias as newAlias,\n} from \"src/queries/find/Aliases.ts\";\nimport { deferredAliasSym, isDeferredAliasCondition } from \"src/queries/find/DeferredAlias.ts\";\nimport type { ExpressionFilter, OrderBy } from \"src/queries/find/EntityFilter.ts\";\nimport { pruneUnusedJoins } from \"src/queries/find/QueryParser.pruning.ts\";\nimport { visitConditions } from \"src/queries/find/QueryVisitor.ts\";\nimport { type Scope, isScope, isScopeJoinFilter, resolveScope } from \"src/queries/find/scopes.ts\";\nimport type { ColumnCondition, ParsedExpressionFilter, RawCondition } from \"src/queries/parsedConditions.ts\";\nimport { isDeferredCondition } from \"src/queries/sql/Expr.ts\";\nimport { kq, kqDot } from \"src/queries/sql/keywords.ts\";\nimport { type ParsedEntityFilter, mapToDb, parseEntityFilter, parseValueFilter } from \"src/queries/valueFilters.ts\";\nimport { abbreviation, fail } from \"src/utils.ts\";\n\n// `skipCondition` lives in its own leaf module, shared by domain aliases and SQL expressions\n// without a load-order cycle; `index.ts` re-exports it directly.\n\nexport interface PrimaryTable {\n  join: \"primary\";\n  alias: string;\n  table: string;\n}\n\nexport interface JoinTable {\n  join: \"inner\" | \"outer\";\n  alias: string;\n  table: string;\n  col1: string;\n  col2: string;\n  distinct?: boolean;\n  /**\n   * Metadata used by `optimizeCollectionJoins` to rewrite collection joins into EXISTS.\n   *\n   * I.e. for `Author.books.reviews`:\n   * ```sql\n   * authors a\n   * LEFT JOIN books b ON a.id = b.author_id\n   * LEFT JOIN book_reviews br ON b.id = br.book_id\n   * ```\n   * `books b` has `parentAlias: \"a\"` and `rootAlias: \"b\"`, while `book_reviews br` has\n   * `parentAlias: \"b\"` and `rootAlias: \"br\"`.\n   *\n   * I.e. for `Author.tags`, the m2m join table is the collection root:\n   * ```sql\n   * authors a\n   * LEFT JOIN authors_to_tags att ON a.id = att.author_id\n   * LEFT JOIN tags t ON att.tag_id = t.id\n   * ```\n   * `authors_to_tags att` has `alias: \"att\"` and `rootAlias: \"att\"`, while `tags t` has `alias: \"t\"`\n   * but still has `rootAlias: \"att\"` because it belongs to the m2m subtree rooted at the join table.\n   */\n  collection?: {\n    /** The collection relation type, i.e. `o2m` for `Author.books`, or `m2m` for `Author.tags`. */\n    kind: \"o2m\" | \"m2m\";\n    /** The alias that owns this collection path, i.e. `a` for `Author.books`, or `att` for `Author.tags -> tags`. */\n    parentAlias: string;\n    /** The top-level alias in this collection subtree, i.e. `b` for `Author.books.reviews`, or `att` for `Author.tags`. */\n    rootAlias: string;\n  };\n}\n\n/**\n * Creates a `CROSS JOIN`, currently used for our `em.find` batching.\n *\n * I.e. queries like:\n *\n * ```sql\n * WITH _find (tag, arg1, arg2) AS (VALUES\n *   (0::int, 'a'::varchar, 'a'::varchar),\n *   (1, 'b', 'b'),\n *   (2, 'c', 'c')\n * )\n * SELECT a.*, array_agg(_find.tag) AS _tags\n * FROM authors a\n * CROSS JOIN _find AS _find\n * WHERE a.first_name = _find.arg0 OR a.last_name = _find.arg1\n * GROUP BY a.id\n * ```\n */\nexport interface CrossJoinTable {\n  join: \"cross\";\n  /** The new alias for the joined table. */\n  alias: string;\n  /** The table name to join into the query. */\n  table: string;\n}\n\n/**\n * Adds `WITH` CTE clauses to the query.\n *\n * I.e. queries like:\n *\n * ```sql\n * WITH _find (tag, arg0, arg1) AS (\n *   VALUES ($1::int, $2::character varying, $3::character varying), ($4, $5, $6)\n * )\n * ```\n */\nexport interface ParsedCteClause {\n  /** The new alias for the CTE, i.e. `_find` in the above query. */\n  alias: string;\n  /** The columns, i.e. `tag, arg0, arg1` in the above query. */\n  columns?: { columnName: string; dbType: string }[];\n  /** The subquery for the AS of the CTE clause. */\n  query: { kind: \"raw\"; sql: string; bindings: readonly any[] } | { kind: \"ast\"; query: ParsedFindQuery };\n  /** Whether to include a `RECURSIVE` keyword after the `WITH`. */\n  recursive?: boolean;\n}\n\n/**\n * Creates `LATERAL JOIN`s, currently used by `findCount` and JSON preloading.\n */\nexport interface LateralJoinTable {\n  join: \"lateral\";\n  alias: string;\n  /** Used for join dependency tracking. */\n  fromAlias: string;\n  /** Used more for bookkeeping/consistency with other join tables than the query itself. */\n  table: string;\n  /** The subquery that will look for/roll-up N children. */\n  query: ParsedFindQuery;\n  /** Optional settings for the subquery, i.e. per-parent pagination. */\n  settings?: { limit?: number; offset?: number };\n}\n\nexport type ParsedTable = PrimaryTable | JoinTable | CrossJoinTable | LateralJoinTable;\n\nexport interface ParsedOrderBy {\n  alias: string;\n  column: string;\n  order: OrderBy;\n}\n\nexport type ParsedGroupBy = { alias: string; column: string } | { expression: string };\n\nexport type ParsedSelect = string | ParsedSelectWithBindings;\ntype ParsedSelectWithBindings = { sql: string; bindings: any[]; aliases: string[] };\n\n/** The result of parsing an `em.find` filter. */\nexport interface ParsedFindQuery {\n  selects: ParsedSelect[];\n  /** The primary table plus any joins. */\n  tables: ParsedTable[];\n  /** The query's conditions. */\n  condition?: ParsedExpressionFilter;\n  /** Extremely optional group bys; we generally don't support adhoc/aggregate queries, but the auto-batching infra uses these. */\n  groupBys?: ParsedGroupBy[];\n  /** Any optional orders to add before the default 'order by id'. */\n  orderBys: ParsedOrderBy[];\n  /** Optional CTE to prefix to the query, i.e. for recursive relations. */\n  ctes?: ParsedCteClause[];\n}\n\n/**\n * Parses an `em.find` filter into a logical `ParsedFindQuery` AST, leaving optimization/pruning to callers.\n *\n * The main execution flow is:\n * parseFindQuery -> beforeFind plugins -> optimizeCollectionJoins -> pruneUnusedJoins -> execute SQL.\n */\nexport function parseFindQuery(\n  meta: EntityMetadata,\n  filter: any,\n  opts: {\n    conditions?: ExpressionFilter;\n    orderBy?: any;\n    pruneJoins?: boolean;\n    keepAliases?: string[];\n    softDeletes?: \"include\" | \"exclude\";\n    allowMultipleLeftJoins?: boolean;\n    optimizeJoinsToExists?: boolean;\n  } = {},\n): ParsedFindQuery {\n  const selects: string[] = [];\n  const tables: ParsedTable[] = [];\n  const orderBys: ParsedOrderBy[] = [];\n  const query: ParsedFindQuery = { selects, tables, orderBys };\n  const { orderBy, conditions: optsExpression, softDeletes = \"exclude\", pruneJoins = false, keepAliases = [] } = opts;\n  const cb = new ConditionBuilder();\n  // Where each user-created `alias(...)` is bound in this parse's join literal; alias-built conditions\n  // (`a.firstName.eq(...)`) are resolved against it once the whole tree is walked\n  const aliasBindings = new Map<AliasMgmt, { meta: EntityMetadata; alias: string }>();\n\n  const aliases: Record<string, number> = {};\n  function getAlias(tableName: string): string {\n    const abbrev = abbreviation(tableName);\n    const i = aliases[abbrev] || 0;\n    aliases[abbrev] = i + 1;\n    return i === 0 ? abbrev : `${abbrev}${i}`;\n  }\n\n  /** Adds a `deleted_at IS NULL` condition for `alias`, i.e. for the primary table or a collection join. */\n  function addSoftDeleteCondition(meta: EntityMetadata, alias: string, targetCb: ConditionBuilder): void {\n    if (filterSoftDeletes(meta, softDeletes)) {\n      const column = meta.allFields[getBaseMeta(meta).timestampFields!.deletedAt!].serde?.columns[0]!;\n      targetCb.addSimpleCondition({\n        kind: \"column\",\n        alias,\n        column: column.columnName,\n        dbType: column.dbType,\n        cond: { kind: \"is-null\" },\n        pruneable: true,\n      });\n    }\n  }\n\n  function addTable(\n    meta: EntityMetadata,\n    alias: string,\n    join: ParsedTable[\"join\"],\n    col1: string,\n    col2: string,\n    filter: any,\n    fieldName?: string,\n    targetCb: ConditionBuilder = cb,\n    /** Whether this table is the \"other side\" of a collection, i.e. `books` in `em.find(Author, { books: ... })`. */\n    isCollection: boolean = false,\n  ): void {\n    // look at filter, is it `{ book: \"b2\" }` or `{ book: { ... } }`\n    const scopeFilter = isScope(filter);\n    const ef = scopeFilter ? undefined : parseEntityFilter(meta, filter);\n    if (!scopeFilter && !ef && join !== \"primary\" && !isAlias(filter)) {\n      return;\n    }\n\n    if (join === \"primary\") {\n      tables.push({ alias, table: meta.tableName, join });\n      addTablePerClassJoinsAndClassTag({ selects, tables, orderBys }, meta, alias, true);\n    } else if (meta.inheritanceType === \"cti\" && fieldName && !(fieldName in meta.fields)) {\n      // For cti, our meta might be a subtype while the FK is actually on the base table.  This should only be the case\n      // when the fk is on another table (e.g. o2o/o2m).  In these cases, we'll be passed a field name and can verify if\n      // its directly in our meta, if not we should assume it's in the base type and join that in first.\n      meta.baseTypes.forEach((bt, i) => {\n        tables.push({\n          alias: `${alias}_b${i}`,\n          table: bt.tableName,\n          join: \"outer\",\n          col1,\n          col2: `${kq(`${alias}_b${i}`)}.${col2.split(\".\")[1]}`,\n          distinct: false,\n        });\n        // and we still need to join in our subtype as well in case its own fields are queried against\n        tables.push({\n          alias: `${alias}`,\n          table: meta.tableName,\n          join: \"outer\",\n          col1: kqDot(alias, \"id\"),\n          col2: kqDot(`${alias}_b${i}`, \"id\"),\n          distinct: false,\n        });\n      });\n    } else if (join === \"lateral\" || join === \"cross\") {\n      fail(\"Unexpected lateral join\");\n    } else {\n      tables.push({ alias, table: meta.tableName, join, col1, col2 });\n      // Maybe only do this if we're the primary, or have a field that needs it?\n      addTablePerClassJoinsAndClassTag({ selects, tables, orderBys }, meta, alias, false);\n    }\n\n    if (needsStiDiscriminator(meta)) {\n      addStiSubtypeFilter(targetCb, meta, alias);\n    }\n\n    // Only the primary table & collection joins filter soft-deletes, to match the in-memory relation\n    // semantics of \"o2m/m2m collections filter out soft-deletes, but m2o/o2o references still return\n    // them\". I.e. `book.author.get` returns a soft-deleted author, so `em.find(Book, { author: ... })`\n    // should still match the book, as long as the book itself is not soft-deleted.\n    if (join === \"primary\" || isCollection) {\n      addSoftDeleteCondition(meta, alias, targetCb);\n    }\n\n    // The user's locally declared aliases, i.e. `const [a, b] = aliases(Author, Book)`,\n    // aren't guaranteed to line up with the aliases we've assigned internally, like `a`\n    // might actually be `a1` if there are two `authors` tables in the query, so push the\n    // canonical alias value for the current clause into the Alias.\n    if (filter && typeof filter === \"object\" && \"as\" in filter && isAlias(filter.as)) {\n      aliasBindings.set(getAliasMgmt(filter.as), { meta, alias });\n    } else if (isAlias(filter)) {\n      aliasBindings.set(getAliasMgmt(filter), { meta, alias });\n    }\n\n    addFilterAt(meta, alias, filter, targetCb, ef, join);\n  }\n\n  function addFilterAt(\n    meta: EntityMetadata,\n    tableAlias: string,\n    filter: any,\n    targetCb: ConditionBuilder,\n    parsed: ParsedEntityFilter | undefined = parseEntityFilter(meta, filter),\n    parentJoin: ParsedTable[\"join\"] = \"primary\",\n  ): void {\n    if (isScope(filter)) {\n      addScopeFilterAt(meta, tableAlias, filter, targetCb, parentJoin);\n    } else if (parsed && parsed.kind === \"join\") {\n      addSubFilter(meta, tableAlias, parsed.subFilter, targetCb, parentJoin);\n    } else if (parsed) {\n      const column = meta.fields[\"id\"].serde!.columns[0];\n      targetCb.addValueFilter(tableAlias, column, parsed);\n    }\n  }\n\n  function addScopeFilterAt<T extends Entity>(\n    meta: EntityMetadata<T>,\n    tableAlias: string,\n    scope: Scope<T>,\n    targetCb: ConditionBuilder,\n    parentJoin: ParsedTable[\"join\"],\n  ): void {\n    for (const fragment of resolveScope(scope).fragments) {\n      if (fragment.kind === \"filter\") {\n        addFilterAt(meta, tableAlias, fragment.filter, targetCb, undefined, parentJoin);\n      } else {\n        const a = newAlias(meta.cstr);\n        const result = fragment.fn(a);\n        aliasBindings.set(getAliasMgmt(a), { meta, alias: tableAlias });\n        if (isScopeJoinFilter(result)) {\n          // Parse the join tree first so its `as:` bindings re-root the aliases that\n          // `conditions` reference, then add the conditions against the now-bound aliases.\n          addFilterAt(meta, tableAlias, result.where, targetCb, undefined, parentJoin);\n          checkDomainCondition(result.conditions);\n          targetCb.maybeAddExpression(result.conditions);\n        } else {\n          const conditions = Array.isArray(result) ? result : [result];\n          for (const condition of conditions) checkDomainCondition(condition);\n          if (conditions.length > 0) targetCb.maybeAddExpression({ and: conditions });\n        }\n      }\n    }\n  }\n\n  function addSubFilter(\n    meta: EntityMetadata,\n    tableAlias: string,\n    subFilter: object,\n    targetCb: ConditionBuilder,\n    parentJoin: ParsedTable[\"join\"],\n  ): void {\n    // subFilter really means we're matching against the entity columns/further joins\n    Object.keys(subFilter).forEach((key) => {\n      // Skip the `{ as: ... }` alias binding\n      if (key === \"as\") return;\n      if (key === \"and\" || key === \"or\") {\n        addLogicalFilter(meta, tableAlias, key, (subFilter as any)[key], targetCb, parentJoin);\n        return;\n      }\n      const field = findFilterField(meta, key) ?? fail(`Field '${key}' not found on ${meta.tableName}`);\n      const fa = `${tableAlias}${field.aliasSuffix}`;\n      if (field.kind === \"primitive\" || field.kind === \"primaryKey\" || field.kind === \"enum\") {\n        const column = field.serde.columns[0];\n        parseValueFilter((subFilter as any)[key]).forEach((filter) => {\n          targetCb.addValueFilter(fa, column, filter);\n        });\n      } else if (field.kind === \"m2o\") {\n        const column = field.serde.columns[0];\n        const sub = (subFilter as any)[key];\n        const joinKind = field.required && parentJoin !== \"outer\" ? \"inner\" : \"outer\";\n        if (isAlias(sub)) {\n          const a = getAlias(field.otherMetadata().tableName);\n          addTable(\n            field.otherMetadata(),\n            a,\n            joinKind,\n            kqDot(fa, column.columnName),\n            kqDot(a, \"id\"),\n            sub,\n            undefined,\n            targetCb,\n          );\n        }\n        const f = parseEntityFilter(field.otherMetadata(), sub);\n        // Probe the filter and see if it's just an id, if so we can avoid the join; m2os don't need\n        // a join for soft-delete filtering because references don't filter out soft-deletes.\n        if (!f) {\n          // skip\n        } else if (f.kind === \"join\") {\n          const a = getAlias(field.otherMetadata().tableName);\n          addTable(\n            field.otherMetadata(),\n            a,\n            joinKind,\n            kqDot(fa, column.columnName),\n            kqDot(a, \"id\"),\n            sub,\n            undefined,\n            targetCb,\n          );\n        } else {\n          targetCb.addValueFilter(fa, column, f);\n        }\n      } else if (field.kind === \"poly\") {\n        const f = parseEntityFilter(meta, (subFilter as any)[key]);\n        if (!f) {\n          // skip\n        } else if (f.kind === \"join\") {\n          throw new Error(\"Joins through polys are not supported\");\n        } else {\n          // We're left with basically a ValueFilter against the ids\n          // For now only support eq/ne/in/is-null\n          if (f.kind === \"eq\" || f.kind === \"ne\") {\n            const comp = field.components.find((p) => {\n              const otherMeta = p.otherMetadata();\n              const cstr = getConstructorFromTaggedId(f.value as string);\n              // tagged ids from subclasses always map to the base class, so we should compare to the base class if we don't directly match\n              return otherMeta.cstr === cstr || otherMeta.baseType === cstr.name;\n            });\n            if (!comp) fail(`Invalid tagged id passed to ${meta.type}.${key}: ${f.value}`);\n            const column = field.serde.columns.find((c) => c.columnName === comp.columnName)!;\n            targetCb.addValueFilter(fa, column, f);\n          } else if (f.kind === \"is-null\") {\n            // Add a condition for every component--these can be AND-d with the rest of the simple/inline conditions\n            field.components.forEach((comp) => {\n              const column = field.serde.columns.find((c) => c.columnName === comp.columnName)!;\n              targetCb.addSimpleCondition({\n                kind: \"column\",\n                alias: fa,\n                column: comp.columnName,\n                dbType: column.dbType,\n                cond: f,\n              });\n            });\n          } else if (f.kind === \"not-null\") {\n            const conditions = field.components.map((comp) => {\n              const column = field.serde.columns.find((c) => c.columnName === comp.columnName)!;\n              return {\n                kind: \"column\",\n                alias: fa,\n                column: comp.columnName,\n                dbType: column.dbType,\n                cond: { kind: \"not-null\" },\n              };\n            }) satisfies ColumnCondition[];\n            targetCb.addParsedExpression({ kind: \"exp\", op: \"or\", conditions });\n          } else if (f.kind === \"in\") {\n            // An empty `in` matches nothing, so emit a single always-false condition (consistent\n            // with a non-poly m2o `{ relation: [] }`); otherwise grouping by constructor would yield\n            // zero conditions and prune the filter entirely, incorrectly matching every row.\n            if (f.value.length === 0) {\n              targetCb.addValueFilter(fa, field.serde.columns[0], { kind: \"in\", value: [] });\n              return;\n            }\n            // Split up the ids by constructor\n            const idsByConstructor = groupBy(f.value, (id) => getConstructorFromTaggedId(id as string).name);\n            // Or together `parent_book_id in (1,2,3) OR parent_author_id IN (4,5,6)`\n            // ...if there is a `parent IN [b:1, b:2, a:1, null]` we'd need to pull the `null` out and do an `OR (all columns are null)`...\n            const conditions = Object.entries(idsByConstructor).map(([cstrName, ids]) => {\n              const column =\n                field.serde.columns.find(\n                  // tagged ids from subclasses always map to the base class, so we should compare to the base class if we don't directly match\n                  (c) => c.otherMetadata().cstr.name === cstrName || c.otherMetadata().baseType === cstrName,\n                ) ?? fail(`Invalid tagged ids passed to ${meta.type}.${key}: ${ids}`);\n              return {\n                kind: \"column\",\n                alias: fa,\n                column: column.columnName,\n                dbType: column.dbType,\n                cond: mapToDb(column, { kind: \"in\", value: ids }),\n              } satisfies ColumnCondition;\n            });\n            targetCb.addParsedExpression({ kind: \"exp\", op: \"or\", conditions });\n          } else {\n            throw new Error(`Filters on polys for ${f.kind} are not supported`);\n          }\n        }\n      } else if (field.kind === \"o2o\") {\n        // We have to always join into o2os, i.e. we can't probe the filter like we do for m2os\n        const otherMeta = field.otherMetadata();\n        const a = getAlias(otherMeta.tableName);\n        const otherField = otherMeta.allFields[field.otherFieldName];\n        const otherColumn =\n          // if our other is a poly, we need to find a matching column rather than just picking the first\n          otherField.kind === \"poly\"\n            ? otherField.components.find((c) => c.otherMetadata() === meta || c.otherMetadata() === getBaseMeta(meta))!\n                .columnName\n            : otherField.serde!.columns[0].columnName;\n        addTable(\n          field.otherMetadata(),\n          a,\n          \"outer\",\n          kqDot(tableAlias, \"id\"),\n          kqDot(a, otherColumn),\n          (subFilter as any)[key],\n          field.otherFieldName,\n          targetCb,\n        );\n      } else if (field.kind === \"o2m\") {\n        const otherMeta = field.otherMetadata();\n        const otherField = otherMeta.allFields[field.otherFieldName];\n        let otherColumn = otherField.serde!.columns[0].columnName;\n        if (otherField.kind === \"poly\") {\n          const otherComponent =\n            otherField.components.find((c) => c.otherMetadata() === meta) ??\n            fail(`No poly component found for ${otherField.fieldName}`);\n          otherColumn = otherComponent.columnName;\n        }\n        const isCtiBaseFk =\n          otherMeta.inheritanceType === \"cti\" && field.otherFieldName && !(field.otherFieldName in otherMeta.fields);\n        const a = getAlias(otherMeta.tableName);\n        addTable(\n          otherMeta,\n          a,\n          \"outer\",\n          kqDot(tableAlias, \"id\"),\n          kqDot(a, otherColumn),\n          (subFilter as any)[key],\n          field.otherFieldName,\n          targetCb,\n          true,\n        );\n        if (!isCtiBaseFk) {\n          const table = tables.find((t) => t.alias === a);\n          if (table && (table.join === \"inner\" || table.join === \"outer\")) {\n            table.collection = { parentAlias: tableAlias, rootAlias: a, kind: \"o2m\" };\n          }\n        }\n      } else if (field.kind === \"m2m\") {\n        const sub = (subFilter as any)[key];\n        const f = parseEntityFilter(field.otherMetadata(), sub);\n        if (!f && !isAlias(sub)) return;\n\n        const ja = getAlias(field.joinTableName);\n        tables.push({\n          join: \"outer\",\n          alias: ja,\n          table: field.joinTableName,\n          col1: kqDot(tableAlias, \"id\"),\n          col2: kqDot(ja, field.columnNames[0]),\n          collection: { parentAlias: tableAlias, rootAlias: ja, kind: \"m2m\" },\n        });\n\n        if (isAlias(sub) || f?.kind === \"join\" || filterSoftDeletes(field.otherMetadata(), softDeletes)) {\n          const a = getAlias(field.otherMetadata().tableName);\n          addTable(\n            field.otherMetadata(),\n            a,\n            \"outer\",\n            kqDot(ja, field.columnNames[1]),\n            kqDot(a, \"id\"),\n            sub,\n            undefined,\n            targetCb,\n            true,\n          );\n          const table = tables.find((t) => t.alias === a);\n          if (table && (table.join === \"inner\" || table.join === \"outer\")) {\n            table.collection = { parentAlias: ja, rootAlias: ja, kind: \"m2m\" };\n          }\n        } else if (f) {\n          const otherMeta = field.otherMetadata();\n          const column: any = {\n            columnName: field.columnNames[1],\n            dbType: otherMeta.idDbType,\n            mapToDb(value: any) {\n              return value === null ? value : keyToNumber(otherMeta, maybeResolveReferenceToId(value));\n            },\n          };\n          targetCb.addSimpleCondition({\n            kind: \"column\",\n            alias: ja,\n            column: field.columnNames[1],\n            dbType: otherMeta.idDbType,\n            cond: mapToDb(column, f),\n          });\n        }\n      } else if (field.kind === \"m2mEnum\") {\n        // Membership filter, e.g. `{ logoColors: Color.Red }` / `{ logoColors: [Red, Green] }`: join the\n        // join table and filter its enum-id column, mapping enum codes -> their numeric ids.\n        const ja = getAlias(field.joinTableName);\n        tables.push({\n          join: \"outer\",\n          alias: ja,\n          table: field.joinTableName,\n          col1: kqDot(tableAlias, \"id\"),\n          col2: kqDot(ja, field.columnNames[0]),\n          collection: { parentAlias: tableAlias, rootAlias: ja, kind: \"m2m\" },\n        });\n        const column: any = {\n          columnName: field.columnNames[1],\n          dbType: \"int\",\n          mapToDb(value: any) {\n            return value === null || value === undefined ? value : field.enumDetailType.getByCode(value).id;\n          },\n        };\n        parseValueFilter((subFilter as any)[key]).forEach((filter) => {\n          targetCb.addValueFilter(ja, column, filter);\n        });\n      } else {\n        throw new Error(`Unsupported field ${key}`);\n      }\n    });\n  }\n\n  function addLogicalFilter(\n    meta: EntityMetadata,\n    tableAlias: string,\n    op: \"and\" | \"or\",\n    value: unknown,\n    targetCb: ConditionBuilder,\n    parentJoin: ParsedTable[\"join\"],\n  ): void {\n    const filters = Array.isArray(value) ? value : [value];\n    const conditions = filters.flatMap((filter) => {\n      const branchCb = new ConditionBuilder();\n      addFilterAt(meta, tableAlias, filter, branchCb, undefined, parentJoin);\n      const condition = branchCb.toExpressionFilter();\n      return condition ? [condition] : [];\n    });\n    if (conditions.length > 0) targetCb.addParsedExpression({ kind: \"exp\", op, conditions });\n  }\n\n  function addOrderBy(meta: EntityMetadata, alias: string, orderBy: Record<string, any>): void {\n    const entries = Object.entries(orderBy);\n    if (entries.length === 0) return;\n    for (const [key, value] of entries) {\n      if (!value) continue; // prune undefined\n      const field = meta.allFields[key] ?? fail(`${key} not found on ${meta.tableName}`);\n      if (field.kind === \"primitive\" || field.kind === \"primaryKey\" || field.kind === \"enum\") {\n        const column = field.serde.columns[0];\n        orderBys.push({\n          alias: `${alias}${field.aliasSuffix ?? \"\"}`,\n          column: column.columnName,\n          order: value as OrderBy,\n        });\n      } else if (field.kind === \"m2o\") {\n        // Do we already this table joined in?\n        let table = tables.find((t) => t.table === field.otherMetadata().tableName);\n        if (table) {\n          addTablePerClassJoinsAndClassTag(query, field.otherMetadata(), table.alias, false);\n          addOrderBy(field.otherMetadata(), table.alias, value);\n        } else {\n          const table = field.otherMetadata().tableName;\n          const a = getAlias(table);\n          const column = field.serde.columns[0].columnName;\n          const fa = getMaybeCtiAlias(meta, field, meta, alias);\n          // If we don't have a join, don't force this to be an inner join\n          tables.push({\n            alias: a,\n            table,\n            join: \"outer\",\n            col1: kqDot(fa, column),\n            col2: kqDot(a, \"id\"),\n            distinct: false,\n          });\n          addTablePerClassJoinsAndClassTag(query, field.otherMetadata(), a, false);\n          addOrderBy(field.otherMetadata(), a, value);\n        }\n      } else {\n        throw new Error(`Unsupported field ${key}`);\n      }\n    }\n  }\n\n  // always add the main table\n  const alias = getAlias(meta.tableName);\n  if (meta.hasLazyColumns) {\n    selects.push(...lazyExcludedSelects(meta, alias));\n  } else {\n    selects.push(`${kq(alias)}.*`);\n  }\n  addTable(meta, alias, \"primary\", \"n/a\", \"n/a\", filter);\n\n  // If they passed extra `conditions: ...`, parse that\n  if (optsExpression) {\n    checkDomainCondition(optsExpression);\n    cb.maybeAddExpression(optsExpression);\n  }\n\n  Object.assign(query, {\n    condition: cb.toExpressionFilter(),\n  });\n\n  // Resolve alias-built conditions against this parse's bindings, before anything reads their\n  // aliases (the id-not-null injection just below, and join pruning)\n  resolveAliasConditions(query, aliasBindings);\n\n  if (query.tables.some((t) => t.join === \"outer\")) {\n    maybeAddIdNotNulls(query);\n  }\n\n  if (orderBy) {\n    if (Array.isArray(orderBy)) {\n      for (const ob of orderBy) addOrderBy(meta, alias, ob);\n    } else {\n      addOrderBy(meta, alias, orderBy);\n    }\n  }\n  maybeAddOrderBy(query, meta, alias);\n\n  if (pruneJoins) {\n    pruneUnusedJoins(query, keepAliases);\n  }\n  return query;\n}\n\n/**\n * Look for conditions doing `some_column IS NULL` in an outer join that\n * need an `id IS NOT NULL` to make sure they don't match inadvertently on\n * the child row simply not existing.\n *\n * Note: Instead of injecting an extra `id IS NOT NULL` condition, I had tried\n * using all INNER JOINs and flipping joins to OUTER only if the user explicit\n * had `id IS NULL` in their filter, but that didn't work for queries that wanted\n * to do an `OR` across two different children (which queries both children being\n * OUTER JOINs, and detecting that case seemed complicated).\n */\nexport function maybeAddIdNotNulls(query: ParsedFindQuery): void {\n  visitConditions(query, {\n    visitCond(c: ColumnCondition) {\n      // Check `c.prunable` to make sure we don't catch our injected `deleted_at is null` conditions\n      if (c.cond.kind !== \"is-null\" || c.column === \"id\" || c.pruneable) {\n        return c;\n      }\n      // This is an `some_column IS NULL`, is it in an outer join?\n      const table = query.tables.find((t) => t.alias === c.alias);\n      if (table && table.join === \"outer\") {\n        const meta = getMetadataForTable(table.table);\n        return {\n          kind: \"exp\",\n          op: \"and\",\n          conditions: [\n            c,\n            {\n              kind: \"column\",\n              alias: c.alias,\n              column: \"id\",\n              dbType: meta.idDbType,\n              cond: { kind: \"not-null\" },\n            },\n          ],\n        } satisfies ParsedExpressionFilter;\n      }\n      return c;\n    },\n  });\n}\n\n/** Returns the `a` from `\"a\".*`. */\nexport function parseAlias(alias: string): string {\n  return alias.split(\".\")[0].replaceAll(`\"`, \"\");\n}\n\n/** Finds a filter field by fieldName or generated fieldIdName. */\nexport function findFilterField(meta: EntityMetadata, key: string): (Field & { aliasSuffix: string }) | undefined {\n  return (\n    meta.allFields[key] ??\n    meta.polyComponentFields?.[key] ??\n    Object.values(meta.allFields).find((field) => field.fieldIdName === key) ??\n    Object.values(meta.polyComponentFields ?? {}).find((field) => field.fieldIdName === key)\n  );\n}\n\n/** Adds any user-configured default order, plus an \"always order by id\" for determinism. */\nexport function maybeAddOrderBy(query: ParsedFindQuery, meta: EntityMetadata, alias: string): void {\n  const { orderBys } = query;\n  if (meta.orderBy) {\n    const field = meta.allFields[meta.orderBy] ?? fail(`${meta.orderBy} not found on ${meta.tableName}`);\n    const column = field.serde!.columns[0].columnName;\n    const hasAlready = orderBys.find((o) => o.alias === alias && o.column === column);\n    if (!hasAlready) {\n      orderBys.push({ alias, column, order: \"ASC\" });\n    }\n  }\n  // Even if they already added orders, add id as the last one to get deterministic output\n  const hasIdOrder = orderBys.find((o) => o.alias === alias && o.column === \"id\");\n  if (!hasIdOrder) {\n    orderBys.push({ alias, column: \"id\", order: \"ASC\" });\n  }\n}\n\nexport function addTablePerClassJoinsAndClassTag(\n  query: ParsedFindQuery,\n  meta: EntityMetadata,\n  alias: string,\n  isPrimary: boolean,\n): void {\n  if (!needsClassPerTableJoins(meta)) return;\n  const { selects, tables } = query;\n  // When `.load(SmallPublisher)` is called, join in base tables like `Publisher`\n  meta.baseTypes.forEach((bt, i) => {\n    if (isPrimary) {\n      selects.push(`${alias}_b${i}.*`);\n    }\n    tables.push({\n      alias: `${alias}_b${i}`,\n      table: bt.tableName,\n      join: \"outer\",\n      col1: kqDot(alias, \"id\"),\n      col2: `${alias}_b${i}.id`,\n      distinct: false,\n    });\n  });\n\n  // We always join in the base table in case a query happens to use\n  // it as a filter, but we only need to do the subtype joins + selects\n  // if this is the primary table\n  if (isPrimary) {\n    // Watch for subTypes that share column names. It'd be great to do\n    // this statically at codegen time, like a meta.sharedSubtypeColumns.\n    const stColumns: { stAlias: string; columnName: string }[] = [];\n\n    // When `.load(Publisher)` is called, join in sub tables like `SmallPublisher` and `LargePublisher`\n    meta.subTypes.forEach((st, i) => {\n      const stAlias = `${alias}_s${i}`;\n      selects.push(`${stAlias}.*`);\n      tables.push({\n        alias: stAlias,\n        table: st.tableName,\n        join: \"outer\",\n        col1: kqDot(alias, \"id\"),\n        col2: `${alias}_s${i}.id`,\n        distinct: false,\n      });\n      for (const field of Object.values(st.fields)) {\n        if (field.fieldName !== \"id\" && field.serde) {\n          for (const c of field.serde?.columns) {\n            stColumns.push({ stAlias, columnName: c.columnName });\n          }\n        }\n      }\n    });\n\n    // Nominate a specific `id` column to avoid ambiguity\n    selects.push(`${kq(alias)}.id as id`);\n\n    // Add an explicit coalesce for shared columns\n    Object.values(groupBy(stColumns, (c) => c.columnName))\n      .filter((columns) => columns.length > 1)\n      .forEach((columns) => {\n        const { columnName } = columns[0];\n        selects.push(`COALESCE(${columns.map((c) => `${c.stAlias}.${columnName}`).join(\", \")}) as ${columnName}`);\n      });\n\n    // If our meta has no subtypes, we're a left type and don't need a __class\n    const cases = meta.subTypes.map((st, i) => `WHEN ${alias}_s${i}.id IS NOT NULL THEN '${st.type}'`);\n    if (cases.length > 0) {\n      selects.push(`CASE ${cases.join(\" \")} ELSE '_' END as __class`);\n    }\n  }\n}\n\n/** Rejects SQL predicates throughout a domain condition tree before optional-filter pruning. */\nfunction checkDomainCondition(condition: ConditionInput | undefined): void {\n  if (!condition) return;\n  if (isDeferredCondition(condition) || (predicateBrand in condition && condition[predicateBrand] === \"sql\")) {\n    fail(\"SQL predicates are only supported by em.query/em.execute; use alias(...) predicates in em.find and scopes.\");\n  }\n  if (\"and\" in condition && condition.and) {\n    for (const child of condition.and) checkDomainCondition(child);\n  } else if (\"or\" in condition && condition.or) {\n    for (const child of condition.or) checkDomainCondition(child);\n  }\n}\n\n/** Resolves every `DeferredAliasCondition` in `query` against the parse's alias bindings. */\nfunction resolveAliasConditions(\n  query: ParsedFindQuery,\n  bindings: Map<AliasMgmt, { meta: EntityMetadata; alias: string }>,\n): void {\n  function resolve(handle: AliasMgmt): { meta: EntityMetadata; alias: string } {\n    return bindings.get(handle) ?? fail(`Alias for ${handle.tableName} is not bound to this query's join literal`);\n  }\n  function maybeResolve<C extends ColumnCondition | RawCondition>(c: C): C | undefined {\n    return isDeferredAliasCondition(c) ? c[deferredAliasSym](resolve) : undefined;\n  }\n  visitConditions(query, { visitCond: maybeResolve, visitRaw: maybeResolve });\n}\n\nexport function getTables(query: ParsedFindQuery): [PrimaryTable, JoinTable[], LateralJoinTable[], CrossJoinTable[]] {\n  let primary: PrimaryTable;\n  const joins: JoinTable[] = [];\n  const laterals: LateralJoinTable[] = [];\n  const crosses: CrossJoinTable[] = [];\n  for (const table of query.tables) {\n    if (table.join === \"primary\") {\n      primary = table;\n    } else if (table.join === \"lateral\") {\n      laterals.push(table);\n    } else if (table.join === \"cross\") {\n      crosses.push(table);\n    } else {\n      joins.push(table);\n    }\n  }\n  return [primary!, joins, laterals, crosses];\n}\n\nfunction needsClassPerTableJoins(meta: EntityMetadata): boolean {\n  return meta.inheritanceType === \"cti\" && (meta.subTypes.length > 0 || meta.baseTypes.length > 0);\n}\n\nfunction needsStiDiscriminator(meta: EntityMetadata): boolean {\n  return meta.inheritanceType === \"sti\" && !meta.stiDiscriminatorField;\n}\n\nfunction addStiSubtypeFilter(cb: ConditionBuilder, subtypeMeta: EntityMetadata, alias: string): void {\n  const cond = stiSubtypeFilter(subtypeMeta, alias);\n  if (cond) cb.addSimpleCondition(cond);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA2KA,SAAgB,eACd,MACA,QACA,OAQI,CAAC,GACY;CACjB,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAwB,CAAC;CAC/B,MAAM,WAA4B,CAAC;CACnC,MAAM,QAAyB;EAAE;EAAS;EAAQ;CAAS;CAC3D,MAAM,EAAE,SAAS,YAAY,gBAAgB,cAAc,WAAW,aAAa,OAAO,cAAc,CAAC,MAAM;CAC/G,MAAM,KAAK,IAAIA,iCAAAA,iBAAiB;CAGhC,MAAM,gCAAgB,IAAI,IAAwD;CAElF,MAAM,UAAkC,CAAC;CACzC,SAAS,SAAS,WAA2B;EAC3C,MAAM,SAASC,cAAAA,aAAa,SAAS;EACrC,MAAM,IAAI,QAAQ,WAAW;EAC7B,QAAQ,UAAU,IAAI;EACtB,OAAO,MAAM,IAAI,SAAS,GAAG,SAAS;CACxC;;CAGA,SAAS,uBAAuB,MAAsB,OAAe,UAAkC;EACrG,IAAIC,iCAAAA,kBAAkB,MAAM,WAAW,GAAG;GACxC,MAAM,SAAS,KAAK,UAAUC,uBAAAA,YAAY,IAAI,CAAC,CAAC,gBAAiB,UAAW,CAAC,OAAO,QAAQ;GAC5F,SAAS,mBAAmB;IAC1B,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM,EAAE,MAAM,UAAU;IACxB,WAAW;GACb,CAAC;EACH;CACF;CAEA,SAAS,SACP,MACA,OACA,MACA,MACA,MACA,QACA,WACA,WAA6B,IAE7B,eAAwB,OAClB;EAEN,MAAM,cAAcC,4BAAAA,QAAQ,MAAM;EAClC,MAAM,KAAK,cAAc,KAAA,IAAYC,6BAAAA,kBAAkB,MAAM,MAAM;EACnE,IAAI,CAAC,eAAe,CAAC,MAAM,SAAS,aAAa,CAACC,6BAAAA,QAAQ,MAAM,GAC9D;EAGF,IAAI,SAAS,WAAW;GACtB,OAAO,KAAK;IAAE;IAAO,OAAO,KAAK;IAAW;GAAK,CAAC;GAClD,iCAAiC;IAAE;IAAS;IAAQ;GAAS,GAAG,MAAM,OAAO,IAAI;EACnF,OAAO,IAAI,KAAK,oBAAoB,SAAS,aAAa,EAAE,aAAa,KAAK,SAI5E,KAAK,UAAU,SAAS,IAAI,MAAM;GAChC,OAAO,KAAK;IACV,OAAO,GAAG,MAAM,IAAI;IACpB,OAAO,GAAG;IACV,MAAM;IACN;IACA,MAAM,GAAGC,6BAAAA,GAAG,GAAG,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,MAAM,GAAG,CAAC,CAAC;IACjD,UAAU;GACZ,CAAC;GAED,OAAO,KAAK;IACV,OAAO,GAAG;IACV,OAAO,KAAK;IACZ,MAAM;IACN,MAAMC,6BAAAA,MAAM,OAAO,IAAI;IACvB,MAAMA,6BAAAA,MAAM,GAAG,MAAM,IAAI,KAAK,IAAI;IAClC,UAAU;GACZ,CAAC;EACH,CAAC;OACI,IAAI,SAAS,aAAa,SAAS,SACxC,cAAA,KAAK,yBAAyB;OACzB;GACL,OAAO,KAAK;IAAE;IAAO,OAAO,KAAK;IAAW;IAAM;IAAM;GAAK,CAAC;GAE9D,iCAAiC;IAAE;IAAS;IAAQ;GAAS,GAAG,MAAM,OAAO,KAAK;EACpF;EAEA,IAAI,sBAAsB,IAAI,GAC5B,oBAAoB,UAAU,MAAM,KAAK;EAO3C,IAAI,SAAS,aAAa,cACxB,uBAAuB,MAAM,OAAO,QAAQ;EAO9C,IAAI,UAAU,OAAO,WAAW,YAAY,QAAQ,UAAUF,6BAAAA,QAAQ,OAAO,EAAE,GAC7E,cAAc,IAAIG,6BAAAA,aAAa,OAAO,EAAE,GAAG;GAAE;GAAM;EAAM,CAAC;OACrD,IAAIH,6BAAAA,QAAQ,MAAM,GACvB,cAAc,IAAIG,6BAAAA,aAAa,MAAM,GAAG;GAAE;GAAM;EAAM,CAAC;EAGzD,YAAY,MAAM,OAAO,QAAQ,UAAU,IAAI,IAAI;CACrD;CAEA,SAAS,YACP,MACA,YACA,QACA,UACA,SAAyCJ,6BAAAA,kBAAkB,MAAM,MAAM,GACvE,aAAkC,WAC5B;EACN,IAAID,4BAAAA,QAAQ,MAAM,GAChB,iBAAiB,MAAM,YAAY,QAAQ,UAAU,UAAU;OAC1D,IAAI,UAAU,OAAO,SAAS,QACnC,aAAa,MAAM,YAAY,OAAO,WAAW,UAAU,UAAU;OAChE,IAAI,QAAQ;GACjB,MAAM,SAAS,KAAK,OAAO,KAAK,CAAC,MAAO,QAAQ;GAChD,SAAS,eAAe,YAAY,QAAQ,MAAM;EACpD;CACF;CAEA,SAAS,iBACP,MACA,YACA,OACA,UACA,YACM;EACN,KAAK,MAAM,YAAYM,4BAAAA,aAAa,KAAK,CAAC,CAAC,WACzC,IAAI,SAAS,SAAS,UACpB,YAAY,MAAM,YAAY,SAAS,QAAQ,UAAU,KAAA,GAAW,UAAU;OACzE;GACL,MAAM,IAAIC,6BAAAA,MAAS,KAAK,IAAI;GAC5B,MAAM,SAAS,SAAS,GAAG,CAAC;GAC5B,cAAc,IAAIF,6BAAAA,aAAa,CAAC,GAAG;IAAE;IAAM,OAAO;GAAW,CAAC;GAC9D,IAAIG,4BAAAA,kBAAkB,MAAM,GAAG;IAG7B,YAAY,MAAM,YAAY,OAAO,OAAO,UAAU,KAAA,GAAW,UAAU;IAC3E,qBAAqB,OAAO,UAAU;IACtC,SAAS,mBAAmB,OAAO,UAAU;GAC/C,OAAO;IACL,MAAM,aAAa,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;IAC3D,KAAK,MAAM,aAAa,YAAY,qBAAqB,SAAS;IAClE,IAAI,WAAW,SAAS,GAAG,SAAS,mBAAmB,EAAE,KAAK,WAAW,CAAC;GAC5E;EACF;CAEJ;CAEA,SAAS,aACP,MACA,YACA,WACA,UACA,YACM;EAEN,OAAO,KAAK,SAAS,CAAC,CAAC,SAAS,QAAQ;GAEtC,IAAI,QAAQ,MAAM;GAClB,IAAI,QAAQ,SAAS,QAAQ,MAAM;IACjC,iBAAiB,MAAM,YAAY,KAAM,UAAkB,MAAM,UAAU,UAAU;IACrF;GACF;GACA,MAAM,QAAQ,gBAAgB,MAAM,GAAG,KAAKC,cAAAA,KAAK,UAAU,IAAI,iBAAiB,KAAK,WAAW;GAChG,MAAM,KAAK,GAAG,aAAa,MAAM;GACjC,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,gBAAgB,MAAM,SAAS,QAAQ;IACtF,MAAM,SAAS,MAAM,MAAM,QAAQ;IACnC,6BAAA,iBAAkB,UAAkB,IAAI,CAAC,CAAC,SAAS,WAAW;KAC5D,SAAS,eAAe,IAAI,QAAQ,MAAM;IAC5C,CAAC;GACH,OAAO,IAAI,MAAM,SAAS,OAAO;IAC/B,MAAM,SAAS,MAAM,MAAM,QAAQ;IACnC,MAAM,MAAO,UAAkB;IAC/B,MAAM,WAAW,MAAM,YAAY,eAAe,UAAU,UAAU;IACtE,IAAIP,6BAAAA,QAAQ,GAAG,GAAG;KAChB,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,UACAE,6BAAAA,MAAM,IAAI,OAAO,UAAU,GAC3BA,6BAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF;IACA,MAAM,IAAIH,6BAAAA,kBAAkB,MAAM,cAAc,GAAG,GAAG;IAGtD,IAAI,CAAC,GAAG,CAER,OAAO,IAAI,EAAE,SAAS,QAAQ;KAC5B,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,UACAG,6BAAAA,MAAM,IAAI,OAAO,UAAU,GAC3BA,6BAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF,OACE,SAAS,eAAe,IAAI,QAAQ,CAAC;GAEzC,OAAO,IAAI,MAAM,SAAS,QAAQ;IAChC,MAAM,IAAIH,6BAAAA,kBAAkB,MAAO,UAAkB,IAAI;IACzD,IAAI,CAAC,GAAG,CAER,OAAO,IAAI,EAAE,SAAS,QACpB,MAAM,IAAI,MAAM,uCAAuC;SAIvD,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;KACtC,MAAM,OAAO,MAAM,WAAW,MAAM,MAAM;MACxC,MAAM,YAAY,EAAE,cAAc;MAClC,MAAM,OAAOS,kBAAAA,2BAA2B,EAAE,KAAe;MAEzD,OAAO,UAAU,SAAS,QAAQ,UAAU,aAAa,KAAK;KAChE,CAAC;KACD,IAAI,CAAC,MAAM,cAAA,KAAK,+BAA+B,KAAK,KAAK,GAAG,IAAI,IAAI,EAAE,OAAO;KAC7E,MAAM,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,EAAE,eAAe,KAAK,UAAU;KAC/E,SAAS,eAAe,IAAI,QAAQ,CAAC;IACvC,OAAO,IAAI,EAAE,SAAS,WAEpB,MAAM,WAAW,SAAS,SAAS;KACjC,MAAM,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,EAAE,eAAe,KAAK,UAAU;KAC/E,SAAS,mBAAmB;MAC1B,MAAM;MACN,OAAO;MACP,QAAQ,KAAK;MACb,QAAQ,OAAO;MACf,MAAM;KACR,CAAC;IACH,CAAC;SACI,IAAI,EAAE,SAAS,YAAY;KAChC,MAAM,aAAa,MAAM,WAAW,KAAK,SAAS;MAChD,MAAM,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,EAAE,eAAe,KAAK,UAAU;MAC/E,OAAO;OACL,MAAM;OACN,OAAO;OACP,QAAQ,KAAK;OACb,QAAQ,OAAO;OACf,MAAM,EAAE,MAAM,WAAW;MAC3B;KACF,CAAC;KACD,SAAS,oBAAoB;MAAE,MAAM;MAAO,IAAI;MAAM;KAAW,CAAC;IACpE,OAAO,IAAI,EAAE,SAAS,MAAM;KAI1B,IAAI,EAAE,MAAM,WAAW,GAAG;MACxB,SAAS,eAAe,IAAI,MAAM,MAAM,QAAQ,IAAI;OAAE,MAAM;OAAM,OAAO,CAAC;MAAE,CAAC;MAC7E;KACF;KAEA,MAAM,oBAAA,GAAmBC,YAAAA,QAAAA,CAAQ,EAAE,QAAQ,OAAOD,kBAAAA,2BAA2B,EAAY,CAAC,CAAC,IAAI;KAG/F,MAAM,aAAa,OAAO,QAAQ,gBAAgB,CAAC,CAAC,KAAK,CAAC,UAAU,SAAS;MAC3E,MAAM,SACJ,MAAM,MAAM,QAAQ,MAEjB,MAAM,EAAE,cAAc,CAAC,CAAC,KAAK,SAAS,YAAY,EAAE,cAAc,CAAC,CAAC,aAAa,QACpF,KAAKD,cAAAA,KAAK,gCAAgC,KAAK,KAAK,GAAG,IAAI,IAAI,KAAK;MACtE,OAAO;OACL,MAAM;OACN,OAAO;OACP,QAAQ,OAAO;OACf,QAAQ,OAAO;OACf,MAAMG,6BAAAA,QAAQ,QAAQ;QAAE,MAAM;QAAM,OAAO;OAAI,CAAC;MAClD;KACF,CAAC;KACD,SAAS,oBAAoB;MAAE,MAAM;MAAO,IAAI;MAAM;KAAW,CAAC;IACpE,OACE,MAAM,IAAI,MAAM,wBAAwB,EAAE,KAAK,mBAAmB;GAGxE,OAAO,IAAI,MAAM,SAAS,OAAO;IAE/B,MAAM,YAAY,MAAM,cAAc;IACtC,MAAM,IAAI,SAAS,UAAU,SAAS;IACtC,MAAM,aAAa,UAAU,UAAU,MAAM;IAC7C,MAAM,cAEJ,WAAW,SAAS,SAChB,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,QAAQ,EAAE,cAAc,MAAMb,uBAAAA,YAAY,IAAI,CAAC,CAAC,CACrG,aACH,WAAW,MAAO,QAAQ,EAAE,CAAC;IACnC,SACE,MAAM,cAAc,GACpB,GACA,SACAK,6BAAAA,MAAM,YAAY,IAAI,GACtBA,6BAAAA,MAAM,GAAG,WAAW,GACnB,UAAkB,MACnB,MAAM,gBACN,QACF;GACF,OAAO,IAAI,MAAM,SAAS,OAAO;IAC/B,MAAM,YAAY,MAAM,cAAc;IACtC,MAAM,aAAa,UAAU,UAAU,MAAM;IAC7C,IAAI,cAAc,WAAW,MAAO,QAAQ,EAAE,CAAC;IAC/C,IAAI,WAAW,SAAS,QAItB,eAFE,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,IAAI,KAC5DK,cAAAA,KAAK,+BAA+B,WAAW,WAAW,EAAA,CAC/B;IAE/B,MAAM,cACJ,UAAU,oBAAoB,SAAS,MAAM,kBAAkB,EAAE,MAAM,kBAAkB,UAAU;IACrG,MAAM,IAAI,SAAS,UAAU,SAAS;IACtC,SACE,WACA,GACA,SACAL,6BAAAA,MAAM,YAAY,IAAI,GACtBA,6BAAAA,MAAM,GAAG,WAAW,GACnB,UAAkB,MACnB,MAAM,gBACN,UACA,IACF;IACA,IAAI,CAAC,aAAa;KAChB,MAAM,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,CAAC;KAC9C,IAAI,UAAU,MAAM,SAAS,WAAW,MAAM,SAAS,UACrD,MAAM,aAAa;MAAE,aAAa;MAAY,WAAW;MAAG,MAAM;KAAM;IAE5E;GACF,OAAO,IAAI,MAAM,SAAS,OAAO;IAC/B,MAAM,MAAO,UAAkB;IAC/B,MAAM,IAAIH,6BAAAA,kBAAkB,MAAM,cAAc,GAAG,GAAG;IACtD,IAAI,CAAC,KAAK,CAACC,6BAAAA,QAAQ,GAAG,GAAG;IAEzB,MAAM,KAAK,SAAS,MAAM,aAAa;IACvC,OAAO,KAAK;KACV,MAAM;KACN,OAAO;KACP,OAAO,MAAM;KACb,MAAME,6BAAAA,MAAM,YAAY,IAAI;KAC5B,MAAMA,6BAAAA,MAAM,IAAI,MAAM,YAAY,EAAE;KACpC,YAAY;MAAE,aAAa;MAAY,WAAW;MAAI,MAAM;KAAM;IACpE,CAAC;IAED,IAAIF,6BAAAA,QAAQ,GAAG,KAAK,GAAG,SAAS,UAAUJ,iCAAAA,kBAAkB,MAAM,cAAc,GAAG,WAAW,GAAG;KAC/F,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,SACAM,6BAAAA,MAAM,IAAI,MAAM,YAAY,EAAE,GAC9BA,6BAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,UACA,IACF;KACA,MAAM,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,CAAC;KAC9C,IAAI,UAAU,MAAM,SAAS,WAAW,MAAM,SAAS,UACrD,MAAM,aAAa;MAAE,aAAa;MAAI,WAAW;MAAI,MAAM;KAAM;IAErE,OAAO,IAAI,GAAG;KACZ,MAAM,YAAY,MAAM,cAAc;KACtC,MAAM,SAAc;MAClB,YAAY,MAAM,YAAY;MAC9B,QAAQ,UAAU;MAClB,QAAQ,OAAY;OAClB,OAAO,UAAU,OAAO,QAAQS,aAAAA,YAAY,WAAWC,aAAAA,0BAA0B,KAAK,CAAC;MACzF;KACF;KACA,SAAS,mBAAmB;MAC1B,MAAM;MACN,OAAO;MACP,QAAQ,MAAM,YAAY;MAC1B,QAAQ,UAAU;MAClB,MAAMF,6BAAAA,QAAQ,QAAQ,CAAC;KACzB,CAAC;IACH;GACF,OAAO,IAAI,MAAM,SAAS,WAAW;IAGnC,MAAM,KAAK,SAAS,MAAM,aAAa;IACvC,OAAO,KAAK;KACV,MAAM;KACN,OAAO;KACP,OAAO,MAAM;KACb,MAAMR,6BAAAA,MAAM,YAAY,IAAI;KAC5B,MAAMA,6BAAAA,MAAM,IAAI,MAAM,YAAY,EAAE;KACpC,YAAY;MAAE,aAAa;MAAY,WAAW;MAAI,MAAM;KAAM;IACpE,CAAC;IACD,MAAM,SAAc;KAClB,YAAY,MAAM,YAAY;KAC9B,QAAQ;KACR,QAAQ,OAAY;MAClB,OAAO,UAAU,QAAQ,UAAU,KAAA,IAAY,QAAQ,MAAM,eAAe,UAAU,KAAK,CAAC,CAAC;KAC/F;IACF;IACA,6BAAA,iBAAkB,UAAkB,IAAI,CAAC,CAAC,SAAS,WAAW;KAC5D,SAAS,eAAe,IAAI,QAAQ,MAAM;IAC5C,CAAC;GACH,OACE,MAAM,IAAI,MAAM,qBAAqB,KAAK;EAE9C,CAAC;CACH;CAEA,SAAS,iBACP,MACA,YACA,IACA,OACA,UACA,YACM;EAEN,MAAM,cADU,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK,EAAA,CAC1B,SAAS,WAAW;GAC7C,MAAM,WAAW,IAAIR,iCAAAA,iBAAiB;GACtC,YAAY,MAAM,YAAY,QAAQ,UAAU,KAAA,GAAW,UAAU;GACrE,MAAM,YAAY,SAAS,mBAAmB;GAC9C,OAAO,YAAY,CAAC,SAAS,IAAI,CAAC;EACpC,CAAC;EACD,IAAI,WAAW,SAAS,GAAG,SAAS,oBAAoB;GAAE,MAAM;GAAO;GAAI;EAAW,CAAC;CACzF;CAEA,SAAS,WAAW,MAAsB,OAAe,SAAoC;EAC3F,MAAM,UAAU,OAAO,QAAQ,OAAO;EACtC,IAAI,QAAQ,WAAW,GAAG;EAC1B,KAAK,MAAM,CAAC,KAAK,UAAU,SAAS;GAClC,IAAI,CAAC,OAAO;GACZ,MAAM,QAAQ,KAAK,UAAU,QAAQa,cAAAA,KAAK,GAAG,IAAI,gBAAgB,KAAK,WAAW;GACjF,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,gBAAgB,MAAM,SAAS,QAAQ;IACtF,MAAM,SAAS,MAAM,MAAM,QAAQ;IACnC,SAAS,KAAK;KACZ,OAAO,GAAG,QAAQ,MAAM,eAAe;KACvC,QAAQ,OAAO;KACf,OAAO;IACT,CAAC;GACH,OAAO,IAAI,MAAM,SAAS,OAAO;IAE/B,IAAI,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,MAAM,cAAc,CAAC,CAAC,SAAS;IAC1E,IAAI,OAAO;KACT,iCAAiC,OAAO,MAAM,cAAc,GAAG,MAAM,OAAO,KAAK;KACjF,WAAW,MAAM,cAAc,GAAG,MAAM,OAAO,KAAK;IACtD,OAAO;KACL,MAAM,QAAQ,MAAM,cAAc,CAAC,CAAC;KACpC,MAAM,IAAI,SAAS,KAAK;KACxB,MAAM,SAAS,MAAM,MAAM,QAAQ,EAAE,CAAC;KACtC,MAAM,KAAKM,6BAAAA,iBAAiB,MAAM,OAAO,MAAM,KAAK;KAEpD,OAAO,KAAK;MACV,OAAO;MACP;MACA,MAAM;MACN,MAAMX,6BAAAA,MAAM,IAAI,MAAM;MACtB,MAAMA,6BAAAA,MAAM,GAAG,IAAI;MACnB,UAAU;KACZ,CAAC;KACD,iCAAiC,OAAO,MAAM,cAAc,GAAG,GAAG,KAAK;KACvE,WAAW,MAAM,cAAc,GAAG,GAAG,KAAK;IAC5C;GACF,OACE,MAAM,IAAI,MAAM,qBAAqB,KAAK;EAE9C;CACF;CAGA,MAAMY,UAAQ,SAAS,KAAK,SAAS;CACrC,IAAI,KAAK,gBACP,QAAQ,KAAK,GAAGC,iCAAAA,oBAAoB,MAAMD,OAAK,CAAC;MAEhD,QAAQ,KAAK,GAAGb,6BAAAA,GAAGa,OAAK,EAAE,GAAG;CAE/B,SAAS,MAAMA,SAAO,WAAW,OAAO,OAAO,MAAM;CAGrD,IAAI,gBAAgB;EAClB,qBAAqB,cAAc;EACnC,GAAG,mBAAmB,cAAc;CACtC;CAEA,OAAO,OAAO,OAAO,EACnB,WAAW,GAAG,mBAAmB,EACnC,CAAC;CAID,uBAAuB,OAAO,aAAa;CAE3C,IAAI,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,OAAO,GAC7C,mBAAmB,KAAK;CAG1B,IAAI,SAAS;EACX,IAAI,MAAM,QAAQ,OAAO,GACvB,KAAK,MAAM,MAAM,SAAS,WAAW,MAAMA,SAAO,EAAE;OAEpD,WAAW,MAAMA,SAAO,OAAO;CAEnC;CACA,gBAAgB,OAAO,MAAMA,OAAK;CAElC,IAAI,YACF,yCAAA,iBAAiB,OAAO,WAAW;CAErC,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,mBAAmB,OAA8B;CAC/D,kCAAA,gBAAgB,OAAO,EACrB,UAAU,GAAoB;EAE5B,IAAI,EAAE,KAAK,SAAS,aAAa,EAAE,WAAW,QAAQ,EAAE,WACtD,OAAO;EAGT,MAAM,QAAQ,MAAM,OAAO,MAAM,MAAM,EAAE,UAAU,EAAE,KAAK;EAC1D,IAAI,SAAS,MAAM,SAAS,SAAS;GACnC,MAAM,OAAOE,kBAAAA,oBAAoB,MAAM,KAAK;GAC5C,OAAO;IACL,MAAM;IACN,IAAI;IACJ,YAAY,CACV,GACA;KACE,MAAM;KACN,OAAO,EAAE;KACT,QAAQ;KACR,QAAQ,KAAK;KACb,MAAM,EAAE,MAAM,WAAW;IAC3B,CACF;GACF;EACF;EACA,OAAO;CACT,EACF,CAAC;AACH;;AAGA,SAAgB,WAAW,OAAuB;CAChD,OAAO,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,WAAW,KAAK,EAAE;AAC/C;;AAGA,SAAgB,gBAAgB,MAAsB,KAA4D;CAChH,OACE,KAAK,UAAU,QACf,KAAK,sBAAsB,QAC3B,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,UAAU,MAAM,gBAAgB,GAAG,KACvE,OAAO,OAAO,KAAK,uBAAuB,CAAC,CAAC,CAAC,CAAC,MAAM,UAAU,MAAM,gBAAgB,GAAG;AAE3F;;AAGA,SAAgB,gBAAgB,OAAwB,MAAsB,OAAqB;CACjG,MAAM,EAAE,aAAa;CACrB,IAAI,KAAK,SAAS;EAEhB,MAAM,UADQ,KAAK,UAAU,KAAK,YAAYT,cAAAA,KAAK,GAAG,KAAK,QAAQ,gBAAgB,KAAK,WAAW,EAAA,CAC9E,MAAO,QAAQ,EAAE,CAAC;EAEvC,IAAI,CADe,SAAS,MAAM,MAAM,EAAE,UAAU,SAAS,EAAE,WAAW,MAC5D,GACZ,SAAS,KAAK;GAAE;GAAO;GAAQ,OAAO;EAAM,CAAC;CAEjD;CAGA,IAAI,CADe,SAAS,MAAM,MAAM,EAAE,UAAU,SAAS,EAAE,WAAW,IAC5D,GACZ,SAAS,KAAK;EAAE;EAAO,QAAQ;EAAM,OAAO;CAAM,CAAC;AAEvD;AAEA,SAAgB,iCACd,OACA,MACA,OACA,WACM;CACN,IAAI,CAAC,wBAAwB,IAAI,GAAG;CACpC,MAAM,EAAE,SAAS,WAAW;CAE5B,KAAK,UAAU,SAAS,IAAI,MAAM;EAChC,IAAI,WACF,QAAQ,KAAK,GAAG,MAAM,IAAI,EAAE,GAAG;EAEjC,OAAO,KAAK;GACV,OAAO,GAAG,MAAM,IAAI;GACpB,OAAO,GAAG;GACV,MAAM;GACN,MAAML,6BAAAA,MAAM,OAAO,IAAI;GACvB,MAAM,GAAG,MAAM,IAAI,EAAE;GACrB,UAAU;EACZ,CAAC;CACH,CAAC;CAKD,IAAI,WAAW;EAGb,MAAM,YAAuD,CAAC;EAG9D,KAAK,SAAS,SAAS,IAAI,MAAM;GAC/B,MAAM,UAAU,GAAG,MAAM,IAAI;GAC7B,QAAQ,KAAK,GAAG,QAAQ,GAAG;GAC3B,OAAO,KAAK;IACV,OAAO;IACP,OAAO,GAAG;IACV,MAAM;IACN,MAAMA,6BAAAA,MAAM,OAAO,IAAI;IACvB,MAAM,GAAG,MAAM,IAAI,EAAE;IACrB,UAAU;GACZ,CAAC;GACD,KAAK,MAAM,SAAS,OAAO,OAAO,GAAG,MAAM,GACzC,IAAI,MAAM,cAAc,QAAQ,MAAM,OACpC,KAAK,MAAM,KAAK,MAAM,OAAO,SAC3B,UAAU,KAAK;IAAE;IAAS,YAAY,EAAE;GAAW,CAAC;EAI5D,CAAC;EAGD,QAAQ,KAAK,GAAGD,6BAAAA,GAAG,KAAK,EAAE,UAAU;EAGpC,OAAO,QAAA,GAAOQ,YAAAA,QAAAA,CAAQ,YAAY,MAAM,EAAE,UAAU,CAAC,CAAC,CACnD,QAAQ,YAAY,QAAQ,SAAS,CAAC,CAAC,CACvC,SAAS,YAAY;GACpB,MAAM,EAAE,eAAe,QAAQ;GAC/B,QAAQ,KAAK,YAAY,QAAQ,KAAK,MAAM,GAAG,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,YAAY;EAC1G,CAAC;EAGH,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,MAAM,QAAQ,MAAM,IAAI,EAAE,wBAAwB,GAAG,KAAK,EAAE;EACjG,IAAI,MAAM,SAAS,GACjB,QAAQ,KAAK,QAAQ,MAAM,KAAK,GAAG,EAAE,yBAAyB;CAElE;AACF;;AAGA,SAAS,qBAAqB,WAA6C;CACzE,IAAI,CAAC,WAAW;CAChB,IAAIQ,yBAAAA,oBAAoB,SAAS,KAAMC,2BAAAA,kBAAkB,aAAa,UAAUA,2BAAAA,oBAAoB,OAClG,cAAA,KAAK,4GAA4G;CAEnH,IAAI,SAAS,aAAa,UAAU,KAClC,KAAK,MAAM,SAAS,UAAU,KAAK,qBAAqB,KAAK;MACxD,IAAI,QAAQ,aAAa,UAAU,IACxC,KAAK,MAAM,SAAS,UAAU,IAAI,qBAAqB,KAAK;AAEhE;;AAGA,SAAS,uBACP,OACA,UACM;CACN,SAAS,QAAQ,QAA4D;EAC3E,OAAO,SAAS,IAAI,MAAM,KAAKX,cAAAA,KAAK,aAAa,OAAO,UAAU,2CAA2C;CAC/G;CACA,SAAS,aAAuD,GAAqB;EACnF,OAAOY,mCAAAA,yBAAyB,CAAC,IAAI,EAAEC,mCAAAA,iBAAiB,CAAC,OAAO,IAAI,KAAA;CACtE;CACA,kCAAA,gBAAgB,OAAO;EAAE,WAAW;EAAc,UAAU;CAAa,CAAC;AAC5E;AAEA,SAAgB,UAAU,OAA2F;CACnH,IAAI;CACJ,MAAM,QAAqB,CAAC;CAC5B,MAAM,WAA+B,CAAC;CACtC,MAAM,UAA4B,CAAC;CACnC,KAAK,MAAM,SAAS,MAAM,QACxB,IAAI,MAAM,SAAS,WACjB,UAAU;MACL,IAAI,MAAM,SAAS,WACxB,SAAS,KAAK,KAAK;MACd,IAAI,MAAM,SAAS,SACxB,QAAQ,KAAK,KAAK;MAElB,MAAM,KAAK,KAAK;CAGpB,OAAO;EAAC;EAAU;EAAO;EAAU;CAAO;AAC5C;AAEA,SAAS,wBAAwB,MAA+B;CAC9D,OAAO,KAAK,oBAAoB,UAAU,KAAK,SAAS,SAAS,KAAK,KAAK,UAAU,SAAS;AAChG;AAEA,SAAS,sBAAsB,MAA+B;CAC5D,OAAO,KAAK,oBAAoB,SAAS,CAAC,KAAK;AACjD;AAEA,SAAS,oBAAoB,IAAsB,aAA6B,OAAqB;CACnG,MAAM,OAAOC,iCAAAA,iBAAiB,aAAa,KAAK;CAChD,IAAI,MAAM,GAAG,mBAAmB,IAAI;AACtC"}

package/build/queries/find/QueryParser.collectionJoins.cjs

@@ -0,0 +1,353 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_queries_find_QueryParser_pruning = require("./QueryParser.pruning.cjs");
+const require_queries_find_QueryParser = require("./QueryParser.cjs");
+const require_utils = require("../../utils.cjs");
+//#region src/queries/find/QueryParser.collectionJoins.ts
+/**
+* Rewrites eligible logical collection LEFT JOINs into EXISTS after plugins have mutated the AST.
+*
+* QueryParser intentionally leaves collection filters as ordinary joins so `beforeFind` plugins see
+* stabler/simpler input than "sometimes JOINs / sometimes EXISTS".
+*
+* This pass runs after plugins and before SQL rendering:
+*
+* 1. `rewriteCollectionJoins` finds top-level collection joins and moves conditions that reference only
+*    that subtree into a correlated EXISTS subquery. I.e. `{ books: { title: "b1" } }` becomes
+*    `EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id AND b.title = 'b1')`.
+* 2. The same helper recurses into the generated subquery, so nested collections become nested EXISTS clauses.
+*    I.e. `{ books: { reviews: { rating: 5 } } }` becomes EXISTS(books WHERE EXISTS(reviews)).
+* 3. Conditions that cannot be safely moved stay as LEFT JOINs. I.e. `OR(b.title = 'x', a.first_name = 'x')`
+*    needs both aliases in one SQL scope, so `b` remains a join instead of becoming an EXISTS.
+* 4. Remaining fanout LEFT JOIN roots are rejected unless `allowMultipleLeftJoins` is set,
+*    because they can produce cross-product row explosions.
+* 5. Finally, `maybeAddIdNotNulls` and `pruneUnusedJoins` clean up the joins that remain.
+*/
+function optimizeCollectionJoins(query, opts = {}) {
+	const { allowMultipleLeftJoins = false, optimizeJoinsToExists = true, pruneJoins = true, keepAliases = [] } = opts;
+	for (const table of query.tables) if (table.join === "lateral") optimizeCollectionJoins(table.query, {
+		...opts,
+		pruneJoins: false
+	});
+	if (optimizeJoinsToExists) rewriteCollectionJoins(query, keepAliases);
+	const fanoutLeftJoinAliases = getCollectionRoots(query).filter((root) => conditionBlocksExistsRewrite(query.condition, root.aliases)).map((root) => root.table.alias);
+	if (optimizeJoinsToExists && !allowMultipleLeftJoins && fanoutLeftJoinAliases.length > 1) throw new Error(`em.find would issue multiple LEFT JOINs across collection relations (${fanoutLeftJoinAliases.join(", ")}); pass allowMultipleLeftJoins: true if this fanout is intentional`);
+	if (query.tables.some((t) => t.join === "outer")) require_queries_find_QueryParser.maybeAddIdNotNulls(query);
+	if (pruneJoins) require_queries_find_QueryParser_pruning.pruneUnusedJoins(query, keepAliases);
+}
+/**
+* Rewrites root-level collection join subtrees into EXISTS when their conditions are locally scoped.
+*
+* I.e. for `authors a -> books b -> book_reviews br`, `b` is the collection root and `br` is part of its subtree.
+*/
+function rewriteCollectionJoins(query, keepAliases = []) {
+	const roots = getCollectionRoots(query);
+	if (query.condition) rewriteSiblingOrExpression(query, query.condition, roots, keepAliases);
+	for (const root of roots) {
+		if (queryReferencesAliasesOutsideConditions(query, root.aliases, keepAliases)) continue;
+		if (conditionHasCrossScopeReference(query.condition, root.aliases)) continue;
+		const moved = query.condition ? removeLocallyScopedConditions(query.condition, root.aliases) : [];
+		if (moved.length === 0) continue;
+		const exists = createExistsCondition(query, root, moved);
+		if (!exists) {
+			addConditions(query, moved);
+			continue;
+		}
+		addConditions(query, [exists]);
+		query.tables = query.tables.filter((t) => !root.aliases.has(t.alias));
+	}
+	removeEmptyExpressions(query.condition);
+}
+/** Rewrites eligible sibling collection ORs while preserving outer/mixed-scope ORs as joins. */
+function rewriteSiblingOrExpression(query, condition, roots, keepAliases) {
+	if (condition.kind !== "exp") return;
+	if (condition.op === "or" && rewriteSiblingOrExpressionChildren(query, condition, roots, keepAliases)) return;
+	if (condition.op === "and") for (const child of condition.conditions) rewriteSiblingOrExpression(query, child, roots, keepAliases);
+}
+/** Returns true when OR branches that are scoped to collection subtrees became EXISTS conditions. */
+function rewriteSiblingOrExpressionChildren(query, exp, roots, keepAliases) {
+	const matches = [];
+	const usedAliases = /* @__PURE__ */ new Set();
+	const usedRoots = /* @__PURE__ */ new Set();
+	let hasAntiJoinBranch = false;
+	for (const condition of exp.conditions) {
+		if (!isRealCondition(condition)) return false;
+		const match = roots.find((root) => conditionReferencesOnlyAliases(condition, root.aliases));
+		if (!match) {
+			const found = conditionAliases(condition);
+			if (roots.some((root) => hasAnyAlias(found, root.aliases))) return false;
+			continue;
+		}
+		matches.push({
+			collectionRoot: match,
+			condition
+		});
+		usedRoots.add(match.table.alias);
+		hasAntiJoinBranch ||= isCollectionAntiJoin(condition, match);
+		for (const alias of match.aliases) usedAliases.add(alias);
+	}
+	if (matches.length === 0) return false;
+	if (matches.length === exp.conditions.length && usedRoots.size < 2 && !hasAntiJoinBranch || conditionReferencesAliasesOutside(query.condition, exp, usedAliases) || queryReferencesAliasesOutsideConditions(query, usedAliases, keepAliases)) return false;
+	const existsConditions = /* @__PURE__ */ new Map();
+	for (const match of matches) {
+		const exists = createExistsCondition(query, match.collectionRoot, [match.condition]);
+		if (!exists) return false;
+		existsConditions.set(match.condition, exists);
+	}
+	exp.conditions = exp.conditions.map((condition) => existsConditions.get(condition) ?? condition);
+	return true;
+}
+/** Creates an EXISTS/NOT EXISTS condition for moved collection filters, or undefined when a LEFT JOIN must stay. */
+function createExistsCondition(query, collectionRoot, moved) {
+	const root = collectionRoot.table;
+	const hasOnlyAntiJoin = moved.length === 1 && isCollectionAntiJoin(moved[0], collectionRoot);
+	if (!hasOnlyAntiJoin && !moved.some(isRealCondition)) return;
+	if (!hasOnlyAntiJoin && moved.some((c) => conditionContainsCollectionAntiJoin(c, collectionRoot))) return;
+	const correlationAliases = joinDependencies(root);
+	const correlation = {
+		kind: "raw",
+		aliases: [root.alias, ...correlationAliases],
+		condition: `${root.col1} = ${root.col2}`,
+		bindings: [],
+		pruneable: false
+	};
+	const conditions = hasOnlyAntiJoin ? [correlation] : [correlation, ...moved];
+	const subquery = {
+		selects: ["1"],
+		tables: query.tables.filter((t) => hasOnlyAntiJoin ? t.alias === root.alias : collectionRoot.aliases.has(t.alias)).map((t) => {
+			if (t.alias === root.alias) return {
+				join: "primary",
+				alias: t.alias,
+				table: t.table
+			};
+			if (t.join === "outer") return {
+				...t,
+				distinct: false
+			};
+			return t;
+		}),
+		condition: {
+			kind: "exp",
+			op: "and",
+			conditions
+		},
+		orderBys: []
+	};
+	rewriteCollectionJoins(subquery);
+	return {
+		kind: "exists",
+		negate: hasOnlyAntiJoin,
+		subquery,
+		outerAliases: correlationAliases
+	};
+}
+/** Appends conditions to the top-level expression, creating an AND wrapper when needed. */
+function addConditions(query, conditions) {
+	query.condition ??= {
+		kind: "exp",
+		op: "and",
+		conditions: []
+	};
+	query.condition.conditions.push(...conditions);
+}
+/** Returns top-level collection roots with their full join subtrees. */
+function getCollectionRoots(query) {
+	return getTopLevelCollectionRoots(query).map((table) => {
+		const aliases = collectJoinSubtreeAliases(query, table.alias);
+		return {
+			table,
+			aliases,
+			joinTables: query.tables.filter((t) => isJoinTable(t) && aliases.has(t.alias))
+		};
+	});
+}
+/** Returns top-level collection roots, i.e. `books b` but not nested `book_reviews br`. */
+function getTopLevelCollectionRoots(query) {
+	const joinTables = query.tables.filter(isJoinTable);
+	const collectionAliases = new Set(joinTables.flatMap((t) => t.collection ? [t.alias] : []));
+	return joinTables.filter((t) => t.collection?.rootAlias === t.alias && !collectionAliases.has(t.collection.parentAlias));
+}
+/** Returns true if a remaining real condition prevents this subtree from becoming EXISTS, i.e. a cross-scope OR. */
+function conditionBlocksExistsRewrite(condition, aliases) {
+	if (!condition || !isRealCondition(condition)) return false;
+	if (condition.kind === "exp" && condition.op === "and") return condition.conditions.some((c) => conditionBlocksExistsRewrite(c, aliases));
+	return conditionReferencesAnyAlias(condition, aliases);
+}
+/** Collects a collection root and all joins that depend on it, i.e. `b -> br -> c`. */
+function collectJoinSubtreeAliases(query, rootAlias) {
+	const aliases = /* @__PURE__ */ new Set([rootAlias]);
+	let changed = true;
+	while (changed) {
+		changed = false;
+		for (const table of query.tables) {
+			if (!isJoinTable(table)) continue;
+			if (!aliases.has(table.alias) && joinReferencesAnyAlias(table, aliases)) {
+				aliases.add(table.alias);
+				changed = true;
+			}
+		}
+	}
+	return aliases;
+}
+/**
+* Removes AND-safe conditions whose aliases all live inside one collection subtree.
+*
+* I.e. in `a.age = 1 AND b.title = 'x'`, only `b.title = 'x'` moves. In `b.title = 'x' OR br.rating = 5`,
+* the whole OR moves only if every alias is inside the same subtree.
+*/
+function removeLocallyScopedConditions(exp, aliases) {
+	if (exp.op === "or") {
+		if (!conditionReferencesOnlyAliases(exp, aliases)) return [];
+		const moved = {
+			...exp,
+			conditions: [...exp.conditions]
+		};
+		exp.conditions = [];
+		return [moved];
+	}
+	const moved = [];
+	for (let i = exp.conditions.length - 1; i >= 0; i--) {
+		const condition = exp.conditions[i];
+		if (condition.kind === "exp" && condition.op === "and") {
+			moved.push(...removeLocallyScopedConditions(condition, aliases));
+			if (condition.conditions.length === 0) exp.conditions.splice(i, 1);
+		} else if (conditionReferencesOnlyAliases(condition, aliases)) {
+			moved.unshift(condition);
+			exp.conditions.splice(i, 1);
+		}
+	}
+	return moved;
+}
+/** Returns true when a condition references at least one alias and all aliases are in `aliases`, i.e. only `b`/`br`. */
+function conditionReferencesOnlyAliases(condition, aliases) {
+	const found = conditionAliases(condition);
+	return found.size > 0 && [...found].every((alias) => aliases.has(alias));
+}
+/** Returns true when `aliases` are referenced by a real condition other than the targeted OR expression. */
+function conditionReferencesAliasesOutside(condition, target, aliases) {
+	if (!condition || condition === target || !isRealCondition(condition)) return false;
+	if (condition.kind === "exp") return condition.conditions.some((child) => conditionReferencesAliasesOutside(child, target, aliases));
+	return conditionReferencesAnyAlias(condition, aliases);
+}
+/** Returns true when selected/ordered aliases would force these joins to remain in the outer query. */
+function queryReferencesAliasesOutsideConditions(query, aliases, keepAliases) {
+	return hasAnyAlias(queryRequiredAliasesOutsideConditions(query, keepAliases), aliases);
+}
+/**
+* Returns aliases needed by SELECT/GROUP/ORDER plus their join dependencies.
+*
+* I.e. `array_agg(br.rating)` requires `br`, and then `br` requires `b` because it joins through `b`.
+*/
+function queryRequiredAliasesOutsideConditions(query, keepAliases) {
+	const required = /* @__PURE__ */ new Set();
+	for (const alias of keepAliases) required.add(alias);
+	for (const orderBy of query.orderBys) required.add(orderBy.alias);
+	for (const groupBy of query.groupBys ?? []) if ("expression" in groupBy) addSelectAliases(query, required, groupBy.expression);
+	else required.add(groupBy.alias);
+	for (const select of query.selects) if (typeof select === "string") addSelectAliases(query, required, select);
+	else if ("aliases" in select) {
+		for (const alias of select.aliases) required.add(alias);
+		addSelectAliases(query, required, select.sql);
+	}
+	const todo = [...required];
+	while (todo.length > 0) {
+		const alias = todo.pop();
+		const table = query.tables.find((t) => t.alias === alias);
+		if (!table || !isJoinTable(table)) continue;
+		for (const dependency of joinDependencies(table)) if (!required.has(dependency)) {
+			required.add(dependency);
+			todo.push(dependency);
+		}
+	}
+	return required;
+}
+/** Adds aliases referenced by raw select SQL, i.e. `array_agg(br.rating)` requires `br`. */
+function addSelectAliases(query, required, select) {
+	for (const table of query.tables) if (require_queries_find_QueryParser_pruning.selectReferencesAlias(select, table.alias)) required.add(table.alias);
+}
+/** Returns the aliases needed to evaluate a join's ON clause, excluding the joined alias itself. */
+function joinDependencies(table) {
+	return [require_queries_find_QueryParser.parseAlias(table.col1), require_queries_find_QueryParser.parseAlias(table.col2)].filter((alias) => alias !== table.alias);
+}
+/** Returns true when a condition references this subtree and another scope, i.e. `b.title = 'x' OR c.text = 'x'`. */
+function conditionHasCrossScopeReference(condition, aliases) {
+	if (!condition || !isRealCondition(condition)) return false;
+	if (condition.kind === "exp" && condition.op === "and") return condition.conditions.some((child) => conditionHasCrossScopeReference(child, aliases));
+	const found = conditionAliases(condition);
+	return hasAnyAlias(found, aliases) && ![...found].every((alias) => aliases.has(alias));
+}
+/** Returns true when a condition references any alias in `aliases`, i.e. `b` in `b.title = c.text`. */
+function conditionReferencesAnyAlias(condition, aliases) {
+	return hasAnyAlias(conditionAliases(condition), aliases);
+}
+/** Returns true when `table` is an ordinary SQL join. */
+function isJoinTable(table) {
+	return table.join === "inner" || table.join === "outer";
+}
+/** Returns true when a join's ON clause references any alias in `aliases`. */
+function joinReferencesAnyAlias(table, aliases) {
+	return joinDependencies(table).some((alias) => aliases.has(alias));
+}
+/** Returns true when two alias sets overlap. */
+function hasAnyAlias(found, aliases) {
+	return [...found].some((alias) => aliases.has(alias));
+}
+/** Returns true for collection anti-joins, i.e. `b.id IS NULL` or m2m target `t.id IS NULL` for root `att`. */
+function isCollectionAntiJoin(condition, root) {
+	return collectionAntiJoinAliases(root).some((alias) => isAliasIdNull(condition, alias));
+}
+/** Returns aliases whose `id IS NULL` means the collection root has no matching row. */
+function collectionAntiJoinAliases(root) {
+	return [...root.aliases].filter((alias) => {
+		if (alias === root.table.alias) return true;
+		return rootTable(root, alias)?.collection?.rootAlias === root.table.alias;
+	});
+}
+/** Returns a join table from a collection subtree by alias. */
+function rootTable(root, alias) {
+	return root.joinTables.find((table) => table.alias === alias);
+}
+/** Returns true for `alias.id IS NULL`, i.e. the parse shape for `{ books: { id: null } }`. */
+function isAliasIdNull(condition, alias) {
+	return condition.kind === "column" && condition.alias === alias && condition.column === "id" && condition.cond.kind === "is-null";
+}
+/** Returns true when a condition tree contains a collection anti-join branch inside an OR. */
+function conditionContainsCollectionAntiJoin(condition, root) {
+	if (isCollectionAntiJoin(condition, root)) return true;
+	if (condition.kind === "exp") return condition.conditions.some((c) => conditionContainsCollectionAntiJoin(c, root));
+	return false;
+}
+/** Removes empty expression wrappers left behind by condition movement, i.e. `AND []` after all children moved. */
+function removeEmptyExpressions(exp) {
+	if (!exp) return;
+	for (let i = exp.conditions.length - 1; i >= 0; i--) {
+		const condition = exp.conditions[i];
+		if (condition.kind === "exp") {
+			removeEmptyExpressions(condition);
+			if (condition.conditions.length === 0) exp.conditions.splice(i, 1);
+		}
+	}
+}
+/** Returns true if a condition must be preserved to maintain query semantics, i.e. user filters vs soft-delete filters. */
+function isRealCondition(condition) {
+	if (condition.kind === "column" || condition.kind === "raw") return !condition.pruneable;
+	else if (condition.kind === "exists") return true;
+	else if (condition.kind === "exp") return condition.conditions.some(isRealCondition);
+	else require_utils.assertNever(condition);
+}
+/** Returns all aliases referenced by a condition, i.e. `b` and `a` in an OR. */
+function conditionAliases(condition) {
+	const aliases = /* @__PURE__ */ new Set();
+	collectAllAliases(condition, aliases);
+	return aliases;
+}
+/** Collects all aliases referenced by a condition, including inside nested expressions, i.e. `b` and `a` in an OR. */
+function collectAllAliases(cond, out) {
+	if (cond.kind === "column") out.add(cond.alias);
+	else if (cond.kind === "raw") for (const a of cond.aliases) out.add(a);
+	else if (cond.kind === "exp") for (const c of cond.conditions) collectAllAliases(c, out);
+	else if (cond.kind === "exists") {} else require_utils.assertNever(cond);
+}
+//#endregion
+exports.optimizeCollectionJoins = optimizeCollectionJoins;
+
+//# sourceMappingURL=QueryParser.collectionJoins.cjs.map

package/build/queries/find/QueryParser.collectionJoins.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryParser.collectionJoins.cjs","names":["selectReferencesAlias","parseAlias"],"sources":["../../../src/queries/find/QueryParser.collectionJoins.ts"],"sourcesContent":["import { pruneUnusedJoins, selectReferencesAlias } from \"src/queries/find/QueryParser.pruning.ts\";\nimport {\n  type JoinTable,\n  type ParsedFindQuery,\n  type PrimaryTable,\n  maybeAddIdNotNulls,\n  parseAlias,\n} from \"src/queries/find/QueryParser.ts\";\nimport type {\n  ExistsCondition,\n  ParsedExpressionCondition,\n  ParsedExpressionFilter,\n  RawCondition,\n} from \"src/queries/parsedConditions.ts\";\nimport { assertNever } from \"src/utils.ts\";\n\n/** A collection root plus every join nested under it, i.e. `books b` with `book_reviews br`. */\ninterface CollectionRoot {\n  /** The top-level collection join that becomes the EXISTS FROM table, i.e. `books b`. */\n  table: JoinTable;\n  /** Every alias in this collection subtree, i.e. `b` and `br` for `authors -> books -> reviews`. */\n  aliases: Set<string>;\n  /** Every join table in this collection subtree, i.e. `att` and `t` for an m2m tag filter. */\n  joinTables: JoinTable[];\n}\n\n/**\n * Rewrites eligible logical collection LEFT JOINs into EXISTS after plugins have mutated the AST.\n *\n * QueryParser intentionally leaves collection filters as ordinary joins so `beforeFind` plugins see\n * stabler/simpler input than \"sometimes JOINs / sometimes EXISTS\".\n *\n * This pass runs after plugins and before SQL rendering:\n *\n * 1. `rewriteCollectionJoins` finds top-level collection joins and moves conditions that reference only\n *    that subtree into a correlated EXISTS subquery. I.e. `{ books: { title: \"b1\" } }` becomes\n *    `EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id AND b.title = 'b1')`.\n * 2. The same helper recurses into the generated subquery, so nested collections become nested EXISTS clauses.\n *    I.e. `{ books: { reviews: { rating: 5 } } }` becomes EXISTS(books WHERE EXISTS(reviews)).\n * 3. Conditions that cannot be safely moved stay as LEFT JOINs. I.e. `OR(b.title = 'x', a.first_name = 'x')`\n *    needs both aliases in one SQL scope, so `b` remains a join instead of becoming an EXISTS.\n * 4. Remaining fanout LEFT JOIN roots are rejected unless `allowMultipleLeftJoins` is set,\n *    because they can produce cross-product row explosions.\n * 5. Finally, `maybeAddIdNotNulls` and `pruneUnusedJoins` clean up the joins that remain.\n */\nexport function optimizeCollectionJoins(\n  query: ParsedFindQuery,\n  opts: {\n    allowMultipleLeftJoins?: boolean;\n    optimizeJoinsToExists?: boolean;\n    pruneJoins?: boolean;\n    keepAliases?: string[];\n  } = {},\n): void {\n  const { allowMultipleLeftJoins = false, optimizeJoinsToExists = true, pruneJoins = true, keepAliases = [] } = opts;\n  for (const table of query.tables) {\n    // I.e. batched find/count queries wrap the real query in a LATERAL subquery; optimize that inner query too,\n    // but let the outer query decide final pruning so it can keep the lateral alias itself.\n    if (table.join === \"lateral\") optimizeCollectionJoins(table.query, { ...opts, pruneJoins: false });\n  }\n  if (optimizeJoinsToExists) rewriteCollectionJoins(query, keepAliases);\n\n  // I.e. collection LEFT JOINs now fall into three buckets:\n  // 1. local real filters, like `{ books: { title: \"b1\" } }`, were rewritten to EXISTS above;\n  // 2. no local real filters, like `{ books: {}, comments: {} }`, are safe because pruning will remove them;\n  // 3. blocked real filters, like cross-scope ORs, must stay as LEFT JOINs and can multiply rows.\n  // Only the third bucket should trip the fanout guard.\n  const fanoutLeftJoinAliases = getCollectionRoots(query)\n    .filter((root) => conditionBlocksExistsRewrite(query.condition, root.aliases))\n    .map((root) => root.table.alias);\n  if (optimizeJoinsToExists && !allowMultipleLeftJoins && fanoutLeftJoinAliases.length > 1) {\n    throw new Error(\n      `em.find would issue multiple LEFT JOINs across collection relations (${fanoutLeftJoinAliases.join(\n        \", \",\n      )}); pass allowMultipleLeftJoins: true if this fanout is intentional`,\n    );\n  }\n\n  if (query.tables.some((t) => t.join === \"outer\")) {\n    // I.e. preserve legacy LEFT JOIN null semantics for any joins that could not become EXISTS.\n    maybeAddIdNotNulls(query);\n  }\n  if (pruneJoins) {\n    // I.e. remove logical collection joins that were replaced by EXISTS and any joins only needed before plugin edits.\n    pruneUnusedJoins(query, keepAliases);\n  }\n}\n\n/**\n * Rewrites root-level collection join subtrees into EXISTS when their conditions are locally scoped.\n *\n * I.e. for `authors a -> books b -> book_reviews br`, `b` is the collection root and `br` is part of its subtree.\n */\nfunction rewriteCollectionJoins(query: ParsedFindQuery, keepAliases: string[] = []): void {\n  const roots = getCollectionRoots(query);\n  if (query.condition) rewriteSiblingOrExpression(query, query.condition, roots, keepAliases);\n  for (const root of roots) {\n    if (queryReferencesAliasesOutsideConditions(query, root.aliases, keepAliases)) continue;\n    if (conditionHasCrossScopeReference(query.condition, root.aliases)) continue;\n    // I.e. move `b.title = 'x'` and `(br.rating = 5 OR br.rating = 4)`, but not `b.title = 'x' OR a.first_name = 'x'`.\n    const moved = query.condition ? removeLocallyScopedConditions(query.condition, root.aliases) : [];\n    if (moved.length === 0) continue;\n    const exists = createExistsCondition(query, root, moved);\n    if (!exists) {\n      addConditions(query, moved);\n      continue;\n    }\n    addConditions(query, [exists]);\n    // I.e. after adding EXISTS, remove `books b` and its children from the outer FROM list.\n    query.tables = query.tables.filter((t) => !root.aliases.has(t.alias));\n  }\n  removeEmptyExpressions(query.condition);\n}\n\n/** Rewrites eligible sibling collection ORs while preserving outer/mixed-scope ORs as joins. */\nfunction rewriteSiblingOrExpression(\n  query: ParsedFindQuery,\n  condition: ParsedExpressionCondition,\n  roots: CollectionRoot[],\n  keepAliases: string[],\n): void {\n  if (condition.kind !== \"exp\") return;\n  if (condition.op === \"or\" && rewriteSiblingOrExpressionChildren(query, condition, roots, keepAliases)) return;\n  if (condition.op === \"and\") {\n    for (const child of condition.conditions) rewriteSiblingOrExpression(query, child, roots, keepAliases);\n  }\n}\n\n/** Returns true when OR branches that are scoped to collection subtrees became EXISTS conditions. */\nfunction rewriteSiblingOrExpressionChildren(\n  query: ParsedFindQuery,\n  exp: ParsedExpressionFilter,\n  roots: CollectionRoot[],\n  keepAliases: string[],\n): boolean {\n  const matches: { collectionRoot: CollectionRoot; condition: ParsedExpressionCondition }[] = [];\n  const usedAliases = new Set<string>();\n  const usedRoots = new Set<string>();\n  let hasAntiJoinBranch = false;\n  for (const condition of exp.conditions) {\n    if (!isRealCondition(condition)) return false;\n    const match = roots.find((root) => conditionReferencesOnlyAliases(condition, root.aliases));\n    if (!match) {\n      const found = conditionAliases(condition);\n      // I.e. `a.first_name = 'x'` can stay in the OR while `b.title = 'x'` becomes EXISTS, but\n      // `a.first_name = 'x' AND b.title = 'x'` must stay joined because one branch spans both scopes.\n      if (roots.some((root) => hasAnyAlias(found, root.aliases))) return false;\n      continue;\n    }\n    matches.push({ collectionRoot: match, condition });\n    usedRoots.add(match.table.alias);\n    hasAntiJoinBranch ||= isCollectionAntiJoin(condition, match);\n    for (const alias of match.aliases) usedAliases.add(alias);\n  }\n  if (matches.length === 0) return false;\n  // I.e. rewrite true sibling collection ORs like `b.id IS NOT NULL OR c.id IS NOT NULL`, and same-root\n  // anti-join ORs like `b.id IS NULL OR br.rating = 5` that need `b.id IS NULL` to become `NOT EXISTS`.\n  // skip positive-only single-root ORs, i.e. ORs with no `b.id IS NULL` anti-join branch like\n  // `b.title = 'x' OR br.rating = 5`; mixed ordinary/collection ORs like `a.first_name = 'x' OR b.title = 'x'`\n  // are safe because only the collection branch is replaced. Aliases are also filtered elsewhere like\n  // `b.order = 1 AND (b.title = 'x' OR c.text = 'x')`, and aliases that must stay projected/sorted like\n  // `SELECT b.title` or `ORDER BY b.title`.\n  if (\n    (matches.length === exp.conditions.length && usedRoots.size < 2 && !hasAntiJoinBranch) ||\n    conditionReferencesAliasesOutside(query.condition, exp, usedAliases) ||\n    queryReferencesAliasesOutsideConditions(query, usedAliases, keepAliases)\n  ) {\n    return false;\n  }\n\n  const existsConditions = new Map<ParsedExpressionCondition, ExistsCondition>();\n  for (const match of matches) {\n    const exists = createExistsCondition(query, match.collectionRoot, [match.condition]);\n    if (!exists) return false;\n    existsConditions.set(match.condition, exists);\n  }\n  exp.conditions = exp.conditions.map((condition) => existsConditions.get(condition) ?? condition);\n  // I.e. leave the collection joins in place for now; pruning removes them after all rewrites.\n  return true;\n}\n\n/** Creates an EXISTS/NOT EXISTS condition for moved collection filters, or undefined when a LEFT JOIN must stay. */\nfunction createExistsCondition(\n  query: ParsedFindQuery,\n  collectionRoot: CollectionRoot,\n  moved: ParsedExpressionCondition[],\n): ExistsCondition | undefined {\n  const root = collectionRoot.table;\n  const hasOnlyAntiJoin = moved.length === 1 && isCollectionAntiJoin(moved[0], collectionRoot);\n  if (!hasOnlyAntiJoin && !moved.some(isRealCondition)) {\n    // I.e. only soft-delete/STI conditions moved; don't create an EXISTS that changes nothing.\n    return undefined;\n  }\n  if (!hasOnlyAntiJoin && moved.some((c) => conditionContainsCollectionAntiJoin(c, collectionRoot))) {\n    // I.e. `b.id IS NULL OR br.rating = 5` is not a pure anti-join; leave it as a LEFT JOIN for SQL semantics.\n    return undefined;\n  }\n\n  // I.e. `rpm` may correlate through `_pp_version.id = rpm.ready_plan_version_id`, so pruning must keep\n  // `_pp_version` even when the collection metadata's parent alias is only `pp`.\n  const correlationAliases = joinDependencies(root);\n  const correlation: RawCondition = {\n    kind: \"raw\",\n    aliases: [root.alias, ...correlationAliases],\n    condition: `${root.col1} = ${root.col2}`,\n    bindings: [],\n    pruneable: false,\n  };\n  // I.e. a pure `b.id IS NULL` anti-join becomes `NOT EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id)`.\n  const conditions = hasOnlyAntiJoin ? [correlation] : [correlation, ...moved];\n  const subquery: ParsedFindQuery = {\n    selects: [\"1\"],\n    tables: query.tables\n      .filter((t) => (hasOnlyAntiJoin ? t.alias === root.alias : collectionRoot.aliases.has(t.alias)))\n      .map((t) => {\n        // I.e. the collection root becomes the subquery's FROM table; children remain joins off that root.\n        if (t.alias === root.alias) return { join: \"primary\", alias: t.alias, table: t.table } satisfies PrimaryTable;\n        // I.e. preserve nullable paths like `LEFT JOIN p ... LEFT JOIN sp ... WHERE p.id = 1 OR sp.id = 1`; forcing\n        // children to INNER JOIN would require every optional branch to exist before the OR can match any branch.\n        if (t.join === \"outer\") return { ...t, distinct: false };\n        return t;\n      }),\n    condition: { kind: \"exp\", op: \"and\", conditions },\n    orderBys: [],\n  };\n  // I.e. nested `books.reviews` first creates an EXISTS for books, then this recursive call creates EXISTS for reviews.\n  rewriteCollectionJoins(subquery);\n  return {\n    kind: \"exists\",\n    negate: hasOnlyAntiJoin,\n    subquery,\n    outerAliases: correlationAliases,\n  };\n}\n\n/** Appends conditions to the top-level expression, creating an AND wrapper when needed. */\nfunction addConditions(query: ParsedFindQuery, conditions: ParsedExpressionCondition[]): void {\n  query.condition ??= { kind: \"exp\", op: \"and\", conditions: [] };\n  query.condition.conditions.push(...conditions);\n}\n\n/** Returns top-level collection roots with their full join subtrees. */\nfunction getCollectionRoots(query: ParsedFindQuery): CollectionRoot[] {\n  return getTopLevelCollectionRoots(query).map((table) => {\n    const aliases = collectJoinSubtreeAliases(query, table.alias);\n    return {\n      table,\n      aliases,\n      joinTables: query.tables.filter((t): t is JoinTable => isJoinTable(t) && aliases.has(t.alias)),\n    };\n  });\n}\n\n/** Returns top-level collection roots, i.e. `books b` but not nested `book_reviews br`. */\nfunction getTopLevelCollectionRoots(query: ParsedFindQuery): JoinTable[] {\n  // I.e. if `books b` is nested under another collection root, the parent pass should absorb it; don't rewrite it here.\n  const joinTables = query.tables.filter(isJoinTable);\n  const collectionAliases = new Set(joinTables.flatMap((t) => (t.collection ? [t.alias] : [])));\n  return joinTables.filter(\n    (t) => t.collection?.rootAlias === t.alias && !collectionAliases.has(t.collection.parentAlias),\n  );\n}\n\n/** Returns true if a remaining real condition prevents this subtree from becoming EXISTS, i.e. a cross-scope OR. */\nfunction conditionBlocksExistsRewrite(condition: ParsedExpressionCondition | undefined, aliases: Set<string>): boolean {\n  if (!condition || !isRealCondition(condition)) return false;\n  if (condition.kind === \"exp\" && condition.op === \"and\") {\n    return condition.conditions.some((c) => conditionBlocksExistsRewrite(c, aliases));\n  }\n  return conditionReferencesAnyAlias(condition, aliases);\n}\n\n/** Collects a collection root and all joins that depend on it, i.e. `b -> br -> c`. */\nfunction collectJoinSubtreeAliases(query: ParsedFindQuery, rootAlias: string): Set<string> {\n  const aliases = new Set([rootAlias]);\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const table of query.tables) {\n      if (!isJoinTable(table)) continue;\n      // I.e. `book_reviews br ON b.id = br.book_id` depends on `b`, so `br` belongs in the `b` subtree.\n      if (!aliases.has(table.alias) && joinReferencesAnyAlias(table, aliases)) {\n        aliases.add(table.alias);\n        changed = true;\n      }\n    }\n  }\n  return aliases;\n}\n\n/**\n * Removes AND-safe conditions whose aliases all live inside one collection subtree.\n *\n * I.e. in `a.age = 1 AND b.title = 'x'`, only `b.title = 'x'` moves. In `b.title = 'x' OR br.rating = 5`,\n * the whole OR moves only if every alias is inside the same subtree.\n */\nfunction removeLocallyScopedConditions(exp: ParsedExpressionFilter, aliases: Set<string>): ParsedExpressionCondition[] {\n  if (exp.op === \"or\") {\n    // I.e. OR cannot be split across scopes; either move the whole OR into the EXISTS, or leave it outside.\n    if (!conditionReferencesOnlyAliases(exp, aliases)) return [];\n    const moved = { ...exp, conditions: [...exp.conditions] } satisfies ParsedExpressionFilter;\n    exp.conditions = [];\n    return [moved];\n  }\n  const moved: ParsedExpressionCondition[] = [];\n  for (let i = exp.conditions.length - 1; i >= 0; i--) {\n    const condition = exp.conditions[i];\n    if (condition.kind === \"exp\" && condition.op === \"and\") {\n      // I.e. flatten nested AND movement so `a AND (b AND br)` can still move `b` and `br` into the EXISTS.\n      moved.push(...removeLocallyScopedConditions(condition, aliases));\n      if (condition.conditions.length === 0) exp.conditions.splice(i, 1);\n    } else if (conditionReferencesOnlyAliases(condition, aliases)) {\n      // I.e. move `b.title = 'x'` out of the parent AND and into the collection EXISTS.\n      moved.unshift(condition);\n      exp.conditions.splice(i, 1);\n    }\n  }\n  return moved;\n}\n\n/** Returns true when a condition references at least one alias and all aliases are in `aliases`, i.e. only `b`/`br`. */\nfunction conditionReferencesOnlyAliases(condition: ParsedExpressionCondition, aliases: Set<string>): boolean {\n  const found = conditionAliases(condition);\n  return found.size > 0 && [...found].every((alias) => aliases.has(alias));\n}\n\n/** Returns true when `aliases` are referenced by a real condition other than the targeted OR expression. */\nfunction conditionReferencesAliasesOutside(\n  condition: ParsedExpressionCondition | undefined,\n  target: ParsedExpressionCondition,\n  aliases: Set<string>,\n): boolean {\n  if (!condition || condition === target || !isRealCondition(condition)) return false;\n  if (condition.kind === \"exp\") {\n    return condition.conditions.some((child) => conditionReferencesAliasesOutside(child, target, aliases));\n  }\n  return conditionReferencesAnyAlias(condition, aliases);\n}\n\n/** Returns true when selected/ordered aliases would force these joins to remain in the outer query. */\nfunction queryReferencesAliasesOutsideConditions(\n  query: ParsedFindQuery,\n  aliases: Set<string>,\n  keepAliases: string[],\n): boolean {\n  const requiredAliases = queryRequiredAliasesOutsideConditions(query, keepAliases);\n  // I.e. if `array_agg(br.rating)` requires `br`, then `b` is required too because `br` joins through `b`; don't\n  // move `b` under EXISTS just because the select references only its child alias directly.\n  return hasAnyAlias(requiredAliases, aliases);\n}\n\n/**\n * Returns aliases needed by SELECT/GROUP/ORDER plus their join dependencies.\n *\n * I.e. `array_agg(br.rating)` requires `br`, and then `br` requires `b` because it joins through `b`.\n */\nfunction queryRequiredAliasesOutsideConditions(query: ParsedFindQuery, keepAliases: string[]): Set<string> {\n  const required = new Set<string>();\n  for (const alias of keepAliases) required.add(alias);\n  for (const orderBy of query.orderBys) required.add(orderBy.alias);\n  for (const groupBy of query.groupBys ?? []) {\n    if (\"expression\" in groupBy) {\n      addSelectAliases(query, required, groupBy.expression);\n    } else {\n      required.add(groupBy.alias);\n    }\n  }\n  for (const select of query.selects) {\n    if (typeof select === \"string\") {\n      addSelectAliases(query, required, select);\n    } else if (\"aliases\" in select) {\n      for (const alias of select.aliases) required.add(alias);\n      addSelectAliases(query, required, select.sql);\n    }\n  }\n\n  const todo = [...required];\n  while (todo.length > 0) {\n    const alias = todo.pop()!;\n    const table = query.tables.find((t) => t.alias === alias);\n    if (!table || !isJoinTable(table)) continue;\n    for (const dependency of joinDependencies(table)) {\n      if (!required.has(dependency)) {\n        required.add(dependency);\n        todo.push(dependency);\n      }\n    }\n  }\n  return required;\n}\n\n/** Adds aliases referenced by raw select SQL, i.e. `array_agg(br.rating)` requires `br`. */\nfunction addSelectAliases(query: ParsedFindQuery, required: Set<string>, select: string): void {\n  for (const table of query.tables) {\n    if (selectReferencesAlias(select, table.alias)) required.add(table.alias);\n  }\n}\n\n/** Returns the aliases needed to evaluate a join's ON clause, excluding the joined alias itself. */\nfunction joinDependencies(table: JoinTable): string[] {\n  return [parseAlias(table.col1), parseAlias(table.col2)].filter((alias) => alias !== table.alias);\n}\n\n/** Returns true when a condition references this subtree and another scope, i.e. `b.title = 'x' OR c.text = 'x'`. */\nfunction conditionHasCrossScopeReference(\n  condition: ParsedExpressionCondition | undefined,\n  aliases: Set<string>,\n): boolean {\n  if (!condition || !isRealCondition(condition)) return false;\n  if (condition.kind === \"exp\" && condition.op === \"and\") {\n    return condition.conditions.some((child) => conditionHasCrossScopeReference(child, aliases));\n  }\n  const found = conditionAliases(condition);\n  return hasAnyAlias(found, aliases) && ![...found].every((alias) => aliases.has(alias));\n}\n\n/** Returns true when a condition references any alias in `aliases`, i.e. `b` in `b.title = c.text`. */\nfunction conditionReferencesAnyAlias(condition: ParsedExpressionCondition, aliases: Set<string>): boolean {\n  return hasAnyAlias(conditionAliases(condition), aliases);\n}\n\n/** Returns true when `table` is an ordinary SQL join. */\nfunction isJoinTable(table: ParsedFindQuery[\"tables\"][number]): table is JoinTable {\n  return table.join === \"inner\" || table.join === \"outer\";\n}\n\n/** Returns true when a join's ON clause references any alias in `aliases`. */\nfunction joinReferencesAnyAlias(table: JoinTable, aliases: Set<string>): boolean {\n  return joinDependencies(table).some((alias) => aliases.has(alias));\n}\n\n/** Returns true when two alias sets overlap. */\nfunction hasAnyAlias(found: Set<string>, aliases: Set<string>): boolean {\n  return [...found].some((alias) => aliases.has(alias));\n}\n\n/** Returns true for collection anti-joins, i.e. `b.id IS NULL` or m2m target `t.id IS NULL` for root `att`. */\nfunction isCollectionAntiJoin(condition: ParsedExpressionCondition, root: CollectionRoot): boolean {\n  return collectionAntiJoinAliases(root).some((alias) => isAliasIdNull(condition, alias));\n}\n\n/** Returns aliases whose `id IS NULL` means the collection root has no matching row. */\nfunction collectionAntiJoinAliases(root: CollectionRoot): string[] {\n  return [...root.aliases].filter((alias) => {\n    if (alias === root.table.alias) return true;\n    const table = rootTable(root, alias);\n    // I.e. for m2m `authors -> authors_to_tags att -> tags t`, `t.id IS NULL` means no tag membership.\n    return table?.collection?.rootAlias === root.table.alias;\n  });\n}\n\n/** Returns a join table from a collection subtree by alias. */\nfunction rootTable(root: CollectionRoot, alias: string): JoinTable | undefined {\n  return root.joinTables.find((table) => table.alias === alias);\n}\n\n/** Returns true for `alias.id IS NULL`, i.e. the parse shape for `{ books: { id: null } }`. */\nfunction isAliasIdNull(condition: ParsedExpressionCondition, alias: string): boolean {\n  return (\n    condition.kind === \"column\" &&\n    condition.alias === alias &&\n    condition.column === \"id\" &&\n    condition.cond.kind === \"is-null\"\n  );\n}\n\n/** Returns true when a condition tree contains a collection anti-join branch inside an OR. */\nfunction conditionContainsCollectionAntiJoin(condition: ParsedExpressionCondition, root: CollectionRoot): boolean {\n  if (isCollectionAntiJoin(condition, root)) return true;\n  if (condition.kind === \"exp\") return condition.conditions.some((c) => conditionContainsCollectionAntiJoin(c, root));\n  return false;\n}\n\n/** Removes empty expression wrappers left behind by condition movement, i.e. `AND []` after all children moved. */\nfunction removeEmptyExpressions(exp: ParsedExpressionFilter | undefined): void {\n  if (!exp) return;\n  for (let i = exp.conditions.length - 1; i >= 0; i--) {\n    const condition = exp.conditions[i];\n    if (condition.kind === \"exp\") {\n      removeEmptyExpressions(condition);\n      if (condition.conditions.length === 0) exp.conditions.splice(i, 1);\n    }\n  }\n}\n\n/** Returns true if a condition must be preserved to maintain query semantics, i.e. user filters vs soft-delete filters. */\nfunction isRealCondition(condition: ParsedExpressionCondition): boolean {\n  if (condition.kind === \"column\" || condition.kind === \"raw\") {\n    return !condition.pruneable;\n  } else if (condition.kind === \"exists\") {\n    return true;\n  } else if (condition.kind === \"exp\") {\n    return condition.conditions.some(isRealCondition);\n  } else {\n    assertNever(condition);\n  }\n}\n\n/** Returns all aliases referenced by a condition, i.e. `b` and `a` in an OR. */\nfunction conditionAliases(condition: ParsedExpressionCondition): Set<string> {\n  const aliases = new Set<string>();\n  collectAllAliases(condition, aliases);\n  return aliases;\n}\n\n/** Collects all aliases referenced by a condition, including inside nested expressions, i.e. `b` and `a` in an OR. */\nfunction collectAllAliases(cond: ParsedExpressionCondition, out: Set<string>): void {\n  if (cond.kind === \"column\") {\n    out.add(cond.alias);\n  } else if (cond.kind === \"raw\") {\n    for (const a of cond.aliases) out.add(a);\n  } else if (cond.kind === \"exp\") {\n    for (const c of cond.conditions) collectAllAliases(c, out);\n  } else if (cond.kind === \"exists\") {\n    // I.e. an EXISTS subquery is already a scoped unit; outer movement decisions should not inspect its internals.\n  } else {\n    assertNever(cond);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA6CA,SAAgB,wBACd,OACA,OAKI,CAAC,GACC;CACN,MAAM,EAAE,yBAAyB,OAAO,wBAAwB,MAAM,aAAa,MAAM,cAAc,CAAC,MAAM;CAC9G,KAAK,MAAM,SAAS,MAAM,QAGxB,IAAI,MAAM,SAAS,WAAW,wBAAwB,MAAM,OAAO;EAAE,GAAG;EAAM,YAAY;CAAM,CAAC;CAEnG,IAAI,uBAAuB,uBAAuB,OAAO,WAAW;CAOpE,MAAM,wBAAwB,mBAAmB,KAAK,CAAC,CACpD,QAAQ,SAAS,6BAA6B,MAAM,WAAW,KAAK,OAAO,CAAC,CAAC,CAC7E,KAAK,SAAS,KAAK,MAAM,KAAK;CACjC,IAAI,yBAAyB,CAAC,0BAA0B,sBAAsB,SAAS,GACrF,MAAM,IAAI,MACR,wEAAwE,sBAAsB,KAC5F,IACF,EAAE,mEACJ;CAGF,IAAI,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,OAAO,GAE7C,iCAAA,mBAAmB,KAAK;CAE1B,IAAI,YAEF,yCAAA,iBAAiB,OAAO,WAAW;AAEvC;;;;;;AAOA,SAAS,uBAAuB,OAAwB,cAAwB,CAAC,GAAS;CACxF,MAAM,QAAQ,mBAAmB,KAAK;CACtC,IAAI,MAAM,WAAW,2BAA2B,OAAO,MAAM,WAAW,OAAO,WAAW;CAC1F,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,wCAAwC,OAAO,KAAK,SAAS,WAAW,GAAG;EAC/E,IAAI,gCAAgC,MAAM,WAAW,KAAK,OAAO,GAAG;EAEpE,MAAM,QAAQ,MAAM,YAAY,8BAA8B,MAAM,WAAW,KAAK,OAAO,IAAI,CAAC;EAChG,IAAI,MAAM,WAAW,GAAG;EACxB,MAAM,SAAS,sBAAsB,OAAO,MAAM,KAAK;EACvD,IAAI,CAAC,QAAQ;GACX,cAAc,OAAO,KAAK;GAC1B;EACF;EACA,cAAc,OAAO,CAAC,MAAM,CAAC;EAE7B,MAAM,SAAS,MAAM,OAAO,QAAQ,MAAM,CAAC,KAAK,QAAQ,IAAI,EAAE,KAAK,CAAC;CACtE;CACA,uBAAuB,MAAM,SAAS;AACxC;;AAGA,SAAS,2BACP,OACA,WACA,OACA,aACM;CACN,IAAI,UAAU,SAAS,OAAO;CAC9B,IAAI,UAAU,OAAO,QAAQ,mCAAmC,OAAO,WAAW,OAAO,WAAW,GAAG;CACvG,IAAI,UAAU,OAAO,OACnB,KAAK,MAAM,SAAS,UAAU,YAAY,2BAA2B,OAAO,OAAO,OAAO,WAAW;AAEzG;;AAGA,SAAS,mCACP,OACA,KACA,OACA,aACS;CACT,MAAM,UAAsF,CAAC;CAC7F,MAAM,8BAAc,IAAI,IAAY;CACpC,MAAM,4BAAY,IAAI,IAAY;CAClC,IAAI,oBAAoB;CACxB,KAAK,MAAM,aAAa,IAAI,YAAY;EACtC,IAAI,CAAC,gBAAgB,SAAS,GAAG,OAAO;EACxC,MAAM,QAAQ,MAAM,MAAM,SAAS,+BAA+B,WAAW,KAAK,OAAO,CAAC;EAC1F,IAAI,CAAC,OAAO;GACV,MAAM,QAAQ,iBAAiB,SAAS;GAGxC,IAAI,MAAM,MAAM,SAAS,YAAY,OAAO,KAAK,OAAO,CAAC,GAAG,OAAO;GACnE;EACF;EACA,QAAQ,KAAK;GAAE,gBAAgB;GAAO;EAAU,CAAC;EACjD,UAAU,IAAI,MAAM,MAAM,KAAK;EAC/B,sBAAsB,qBAAqB,WAAW,KAAK;EAC3D,KAAK,MAAM,SAAS,MAAM,SAAS,YAAY,IAAI,KAAK;CAC1D;CACA,IAAI,QAAQ,WAAW,GAAG,OAAO;CAQjC,IACG,QAAQ,WAAW,IAAI,WAAW,UAAU,UAAU,OAAO,KAAK,CAAC,qBACpE,kCAAkC,MAAM,WAAW,KAAK,WAAW,KACnE,wCAAwC,OAAO,aAAa,WAAW,GAEvE,OAAO;CAGT,MAAM,mCAAmB,IAAI,IAAgD;CAC7E,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,SAAS,sBAAsB,OAAO,MAAM,gBAAgB,CAAC,MAAM,SAAS,CAAC;EACnF,IAAI,CAAC,QAAQ,OAAO;EACpB,iBAAiB,IAAI,MAAM,WAAW,MAAM;CAC9C;CACA,IAAI,aAAa,IAAI,WAAW,KAAK,cAAc,iBAAiB,IAAI,SAAS,KAAK,SAAS;CAE/F,OAAO;AACT;;AAGA,SAAS,sBACP,OACA,gBACA,OAC6B;CAC7B,MAAM,OAAO,eAAe;CAC5B,MAAM,kBAAkB,MAAM,WAAW,KAAK,qBAAqB,MAAM,IAAI,cAAc;CAC3F,IAAI,CAAC,mBAAmB,CAAC,MAAM,KAAK,eAAe,GAEjD;CAEF,IAAI,CAAC,mBAAmB,MAAM,MAAM,MAAM,oCAAoC,GAAG,cAAc,CAAC,GAE9F;CAKF,MAAM,qBAAqB,iBAAiB,IAAI;CAChD,MAAM,cAA4B;EAChC,MAAM;EACN,SAAS,CAAC,KAAK,OAAO,GAAG,kBAAkB;EAC3C,WAAW,GAAG,KAAK,KAAK,KAAK,KAAK;EAClC,UAAU,CAAC;EACX,WAAW;CACb;CAEA,MAAM,aAAa,kBAAkB,CAAC,WAAW,IAAI,CAAC,aAAa,GAAG,KAAK;CAC3E,MAAM,WAA4B;EAChC,SAAS,CAAC,GAAG;EACb,QAAQ,MAAM,OACX,QAAQ,MAAO,kBAAkB,EAAE,UAAU,KAAK,QAAQ,eAAe,QAAQ,IAAI,EAAE,KAAK,CAAE,CAAC,CAC/F,KAAK,MAAM;GAEV,IAAI,EAAE,UAAU,KAAK,OAAO,OAAO;IAAE,MAAM;IAAW,OAAO,EAAE;IAAO,OAAO,EAAE;GAAM;GAGrF,IAAI,EAAE,SAAS,SAAS,OAAO;IAAE,GAAG;IAAG,UAAU;GAAM;GACvD,OAAO;EACT,CAAC;EACH,WAAW;GAAE,MAAM;GAAO,IAAI;GAAO;EAAW;EAChD,UAAU,CAAC;CACb;CAEA,uBAAuB,QAAQ;CAC/B,OAAO;EACL,MAAM;EACN,QAAQ;EACR;EACA,cAAc;CAChB;AACF;;AAGA,SAAS,cAAc,OAAwB,YAA+C;CAC5F,MAAM,cAAc;EAAE,MAAM;EAAO,IAAI;EAAO,YAAY,CAAC;CAAE;CAC7D,MAAM,UAAU,WAAW,KAAK,GAAG,UAAU;AAC/C;;AAGA,SAAS,mBAAmB,OAA0C;CACpE,OAAO,2BAA2B,KAAK,CAAC,CAAC,KAAK,UAAU;EACtD,MAAM,UAAU,0BAA0B,OAAO,MAAM,KAAK;EAC5D,OAAO;GACL;GACA;GACA,YAAY,MAAM,OAAO,QAAQ,MAAsB,YAAY,CAAC,KAAK,QAAQ,IAAI,EAAE,KAAK,CAAC;EAC/F;CACF,CAAC;AACH;;AAGA,SAAS,2BAA2B,OAAqC;CAEvE,MAAM,aAAa,MAAM,OAAO,OAAO,WAAW;CAClD,MAAM,oBAAoB,IAAI,IAAI,WAAW,SAAS,MAAO,EAAE,aAAa,CAAC,EAAE,KAAK,IAAI,CAAC,CAAE,CAAC;CAC5F,OAAO,WAAW,QACf,MAAM,EAAE,YAAY,cAAc,EAAE,SAAS,CAAC,kBAAkB,IAAI,EAAE,WAAW,WAAW,CAC/F;AACF;;AAGA,SAAS,6BAA6B,WAAkD,SAA+B;CACrH,IAAI,CAAC,aAAa,CAAC,gBAAgB,SAAS,GAAG,OAAO;CACtD,IAAI,UAAU,SAAS,SAAS,UAAU,OAAO,OAC/C,OAAO,UAAU,WAAW,MAAM,MAAM,6BAA6B,GAAG,OAAO,CAAC;CAElF,OAAO,4BAA4B,WAAW,OAAO;AACvD;;AAGA,SAAS,0BAA0B,OAAwB,WAAgC;CACzF,MAAM,0BAAU,IAAI,IAAI,CAAC,SAAS,CAAC;CACnC,IAAI,UAAU;CACd,OAAO,SAAS;EACd,UAAU;EACV,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,IAAI,CAAC,YAAY,KAAK,GAAG;GAEzB,IAAI,CAAC,QAAQ,IAAI,MAAM,KAAK,KAAK,uBAAuB,OAAO,OAAO,GAAG;IACvE,QAAQ,IAAI,MAAM,KAAK;IACvB,UAAU;GACZ;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,8BAA8B,KAA6B,SAAmD;CACrH,IAAI,IAAI,OAAO,MAAM;EAEnB,IAAI,CAAC,+BAA+B,KAAK,OAAO,GAAG,OAAO,CAAC;EAC3D,MAAM,QAAQ;GAAE,GAAG;GAAK,YAAY,CAAC,GAAG,IAAI,UAAU;EAAE;EACxD,IAAI,aAAa,CAAC;EAClB,OAAO,CAAC,KAAK;CACf;CACA,MAAM,QAAqC,CAAC;CAC5C,KAAK,IAAI,IAAI,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;EACnD,MAAM,YAAY,IAAI,WAAW;EACjC,IAAI,UAAU,SAAS,SAAS,UAAU,OAAO,OAAO;GAEtD,MAAM,KAAK,GAAG,8BAA8B,WAAW,OAAO,CAAC;GAC/D,IAAI,UAAU,WAAW,WAAW,GAAG,IAAI,WAAW,OAAO,GAAG,CAAC;EACnE,OAAO,IAAI,+BAA+B,WAAW,OAAO,GAAG;GAE7D,MAAM,QAAQ,SAAS;GACvB,IAAI,WAAW,OAAO,GAAG,CAAC;EAC5B;CACF;CACA,OAAO;AACT;;AAGA,SAAS,+BAA+B,WAAsC,SAA+B;CAC3G,MAAM,QAAQ,iBAAiB,SAAS;CACxC,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,UAAU,QAAQ,IAAI,KAAK,CAAC;AACzE;;AAGA,SAAS,kCACP,WACA,QACA,SACS;CACT,IAAI,CAAC,aAAa,cAAc,UAAU,CAAC,gBAAgB,SAAS,GAAG,OAAO;CAC9E,IAAI,UAAU,SAAS,OACrB,OAAO,UAAU,WAAW,MAAM,UAAU,kCAAkC,OAAO,QAAQ,OAAO,CAAC;CAEvG,OAAO,4BAA4B,WAAW,OAAO;AACvD;;AAGA,SAAS,wCACP,OACA,SACA,aACS;CAIT,OAAO,YAHiB,sCAAsC,OAAO,WAGpC,GAAG,OAAO;AAC7C;;;;;;AAOA,SAAS,sCAAsC,OAAwB,aAAoC;CACzG,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,aAAa,SAAS,IAAI,KAAK;CACnD,KAAK,MAAM,WAAW,MAAM,UAAU,SAAS,IAAI,QAAQ,KAAK;CAChE,KAAK,MAAM,WAAW,MAAM,YAAY,CAAC,GACvC,IAAI,gBAAgB,SAClB,iBAAiB,OAAO,UAAU,QAAQ,UAAU;MAEpD,SAAS,IAAI,QAAQ,KAAK;CAG9B,KAAK,MAAM,UAAU,MAAM,SACzB,IAAI,OAAO,WAAW,UACpB,iBAAiB,OAAO,UAAU,MAAM;MACnC,IAAI,aAAa,QAAQ;EAC9B,KAAK,MAAM,SAAS,OAAO,SAAS,SAAS,IAAI,KAAK;EACtD,iBAAiB,OAAO,UAAU,OAAO,GAAG;CAC9C;CAGF,MAAM,OAAO,CAAC,GAAG,QAAQ;CACzB,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,QAAQ,KAAK,IAAI;EACvB,MAAM,QAAQ,MAAM,OAAO,MAAM,MAAM,EAAE,UAAU,KAAK;EACxD,IAAI,CAAC,SAAS,CAAC,YAAY,KAAK,GAAG;EACnC,KAAK,MAAM,cAAc,iBAAiB,KAAK,GAC7C,IAAI,CAAC,SAAS,IAAI,UAAU,GAAG;GAC7B,SAAS,IAAI,UAAU;GACvB,KAAK,KAAK,UAAU;EACtB;CAEJ;CACA,OAAO;AACT;;AAGA,SAAS,iBAAiB,OAAwB,UAAuB,QAAsB;CAC7F,KAAK,MAAM,SAAS,MAAM,QACxB,IAAIA,yCAAAA,sBAAsB,QAAQ,MAAM,KAAK,GAAG,SAAS,IAAI,MAAM,KAAK;AAE5E;;AAGA,SAAS,iBAAiB,OAA4B;CACpD,OAAO,CAACC,iCAAAA,WAAW,MAAM,IAAI,GAAGA,iCAAAA,WAAW,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,UAAU,UAAU,MAAM,KAAK;AACjG;;AAGA,SAAS,gCACP,WACA,SACS;CACT,IAAI,CAAC,aAAa,CAAC,gBAAgB,SAAS,GAAG,OAAO;CACtD,IAAI,UAAU,SAAS,SAAS,UAAU,OAAO,OAC/C,OAAO,UAAU,WAAW,MAAM,UAAU,gCAAgC,OAAO,OAAO,CAAC;CAE7F,MAAM,QAAQ,iBAAiB,SAAS;CACxC,OAAO,YAAY,OAAO,OAAO,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,UAAU,QAAQ,IAAI,KAAK,CAAC;AACvF;;AAGA,SAAS,4BAA4B,WAAsC,SAA+B;CACxG,OAAO,YAAY,iBAAiB,SAAS,GAAG,OAAO;AACzD;;AAGA,SAAS,YAAY,OAA8D;CACjF,OAAO,MAAM,SAAS,WAAW,MAAM,SAAS;AAClD;;AAGA,SAAS,uBAAuB,OAAkB,SAA+B;CAC/E,OAAO,iBAAiB,KAAK,CAAC,CAAC,MAAM,UAAU,QAAQ,IAAI,KAAK,CAAC;AACnE;;AAGA,SAAS,YAAY,OAAoB,SAA+B;CACtE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,UAAU,QAAQ,IAAI,KAAK,CAAC;AACtD;;AAGA,SAAS,qBAAqB,WAAsC,MAA+B;CACjG,OAAO,0BAA0B,IAAI,CAAC,CAAC,MAAM,UAAU,cAAc,WAAW,KAAK,CAAC;AACxF;;AAGA,SAAS,0BAA0B,MAAgC;CACjE,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,QAAQ,UAAU;EACzC,IAAI,UAAU,KAAK,MAAM,OAAO,OAAO;EAGvC,OAFc,UAAU,MAAM,KAEnB,CAAC,EAAE,YAAY,cAAc,KAAK,MAAM;CACrD,CAAC;AACH;;AAGA,SAAS,UAAU,MAAsB,OAAsC;CAC7E,OAAO,KAAK,WAAW,MAAM,UAAU,MAAM,UAAU,KAAK;AAC9D;;AAGA,SAAS,cAAc,WAAsC,OAAwB;CACnF,OACE,UAAU,SAAS,YACnB,UAAU,UAAU,SACpB,UAAU,WAAW,QACrB,UAAU,KAAK,SAAS;AAE5B;;AAGA,SAAS,oCAAoC,WAAsC,MAA+B;CAChH,IAAI,qBAAqB,WAAW,IAAI,GAAG,OAAO;CAClD,IAAI,UAAU,SAAS,OAAO,OAAO,UAAU,WAAW,MAAM,MAAM,oCAAoC,GAAG,IAAI,CAAC;CAClH,OAAO;AACT;;AAGA,SAAS,uBAAuB,KAA+C;CAC7E,IAAI,CAAC,KAAK;CACV,KAAK,IAAI,IAAI,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;EACnD,MAAM,YAAY,IAAI,WAAW;EACjC,IAAI,UAAU,SAAS,OAAO;GAC5B,uBAAuB,SAAS;GAChC,IAAI,UAAU,WAAW,WAAW,GAAG,IAAI,WAAW,OAAO,GAAG,CAAC;EACnE;CACF;AACF;;AAGA,SAAS,gBAAgB,WAA+C;CACtE,IAAI,UAAU,SAAS,YAAY,UAAU,SAAS,OACpD,OAAO,CAAC,UAAU;MACb,IAAI,UAAU,SAAS,UAC5B,OAAO;MACF,IAAI,UAAU,SAAS,OAC5B,OAAO,UAAU,WAAW,KAAK,eAAe;MAEhD,cAAA,YAAY,SAAS;AAEzB;;AAGA,SAAS,iBAAiB,WAAmD;CAC3E,MAAM,0BAAU,IAAI,IAAY;CAChC,kBAAkB,WAAW,OAAO;CACpC,OAAO;AACT;;AAGA,SAAS,kBAAkB,MAAiC,KAAwB;CAClF,IAAI,KAAK,SAAS,UAChB,IAAI,IAAI,KAAK,KAAK;MACb,IAAI,KAAK,SAAS,OACvB,KAAK,MAAM,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC;MAClC,IAAI,KAAK,SAAS,OACvB,KAAK,MAAM,KAAK,KAAK,YAAY,kBAAkB,GAAG,GAAG;MACpD,IAAI,KAAK,SAAS,UAAU,CAEnC,OACE,cAAA,YAAY,IAAI;AAEpB"}

package/build/queries/find/QueryParser.collectionJoins.d.cts

@@ -0,0 +1,30 @@
+import { ParsedFindQuery } from "./QueryParser.cjs";
+//#region src/queries/find/QueryParser.collectionJoins.d.ts
+/**
+ * Rewrites eligible logical collection LEFT JOINs into EXISTS after plugins have mutated the AST.
+ *
+ * QueryParser intentionally leaves collection filters as ordinary joins so `beforeFind` plugins see
+ * stabler/simpler input than "sometimes JOINs / sometimes EXISTS".
+ *
+ * This pass runs after plugins and before SQL rendering:
+ *
+ * 1. `rewriteCollectionJoins` finds top-level collection joins and moves conditions that reference only
+ *    that subtree into a correlated EXISTS subquery. I.e. `{ books: { title: "b1" } }` becomes
+ *    `EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id AND b.title = 'b1')`.
+ * 2. The same helper recurses into the generated subquery, so nested collections become nested EXISTS clauses.
+ *    I.e. `{ books: { reviews: { rating: 5 } } }` becomes EXISTS(books WHERE EXISTS(reviews)).
+ * 3. Conditions that cannot be safely moved stay as LEFT JOINs. I.e. `OR(b.title = 'x', a.first_name = 'x')`
+ *    needs both aliases in one SQL scope, so `b` remains a join instead of becoming an EXISTS.
+ * 4. Remaining fanout LEFT JOIN roots are rejected unless `allowMultipleLeftJoins` is set,
+ *    because they can produce cross-product row explosions.
+ * 5. Finally, `maybeAddIdNotNulls` and `pruneUnusedJoins` clean up the joins that remain.
+ */
+declare function optimizeCollectionJoins(query: ParsedFindQuery, opts?: {
+  allowMultipleLeftJoins?: boolean;
+  optimizeJoinsToExists?: boolean;
+  pruneJoins?: boolean;
+  keepAliases?: string[];
+}): void;
+//#endregion
+export { optimizeCollectionJoins };
+//# sourceMappingURL=QueryParser.collectionJoins.d.cts.map

package/build/queries/find/QueryParser.collectionJoins.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryParser.collectionJoins.d.cts","names":[],"sources":["../../../src/queries/find/QueryParser.collectionJoins.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;iBA6CgB,wBACd,OAAO,iBACP;EACE;EACA;EACA;EACA"}

package/build/queries/find/QueryParser.collectionJoins.d.mts

@@ -0,0 +1,30 @@
+import { ParsedFindQuery } from "./QueryParser.mjs";
+//#region src/queries/find/QueryParser.collectionJoins.d.ts
+/**
+ * Rewrites eligible logical collection LEFT JOINs into EXISTS after plugins have mutated the AST.
+ *
+ * QueryParser intentionally leaves collection filters as ordinary joins so `beforeFind` plugins see
+ * stabler/simpler input than "sometimes JOINs / sometimes EXISTS".
+ *
+ * This pass runs after plugins and before SQL rendering:
+ *
+ * 1. `rewriteCollectionJoins` finds top-level collection joins and moves conditions that reference only
+ *    that subtree into a correlated EXISTS subquery. I.e. `{ books: { title: "b1" } }` becomes
+ *    `EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id AND b.title = 'b1')`.
+ * 2. The same helper recurses into the generated subquery, so nested collections become nested EXISTS clauses.
+ *    I.e. `{ books: { reviews: { rating: 5 } } }` becomes EXISTS(books WHERE EXISTS(reviews)).
+ * 3. Conditions that cannot be safely moved stay as LEFT JOINs. I.e. `OR(b.title = 'x', a.first_name = 'x')`
+ *    needs both aliases in one SQL scope, so `b` remains a join instead of becoming an EXISTS.
+ * 4. Remaining fanout LEFT JOIN roots are rejected unless `allowMultipleLeftJoins` is set,
+ *    because they can produce cross-product row explosions.
+ * 5. Finally, `maybeAddIdNotNulls` and `pruneUnusedJoins` clean up the joins that remain.
+ */
+declare function optimizeCollectionJoins(query: ParsedFindQuery, opts?: {
+  allowMultipleLeftJoins?: boolean;
+  optimizeJoinsToExists?: boolean;
+  pruneJoins?: boolean;
+  keepAliases?: string[];
+}): void;
+//#endregion
+export { optimizeCollectionJoins };
+//# sourceMappingURL=QueryParser.collectionJoins.d.mts.map

package/build/queries/find/QueryParser.collectionJoins.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryParser.collectionJoins.d.mts","names":[],"sources":["../../../src/queries/find/QueryParser.collectionJoins.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;iBA6CgB,wBACd,OAAO,iBACP;EACE;EACA;EACA;EACA"}