joist-core 2.3.0-next.74 → 2.3.0-next.76

package/build/QueryParser.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"QueryParser.cjs","names":["ConditionBuilder","abbreviation","getBaseMeta","isScope","isAlias","kq","kqDot","getAliasMgmt","resolveScope","newAlias","isScopeJoinFilter","fail","getConstructorFromTaggedId","groupBy","keyToNumber","maybeResolveReferenceToId","getMaybeCtiAlias","alias","getMetadataForTable","isEntity","isPlainObject","assertNever","isDefined","isDeferredAliasCondition","deferredAliasSym"],"sources":["../src/QueryParser.ts"],"sourcesContent":["import { groupBy, isPlainObject } from \"joist-utils\";\n\nimport { type AliasMgmt, getAliasMgmt, getMaybeCtiAlias, isAlias, alias as newAlias } from \"./Aliases.ts\";\nimport { getMetadataForTable } from \"./configure.ts\";\nimport { deferredAliasSym, isDeferredAliasCondition } from \"./DeferredAlias.ts\";\nimport { type Entity, isEntity } from \"./Entity.ts\";\nimport { type ExpressionFilter, type OrderBy, type ValueFilter } from \"./EntityFilter.ts\";\nimport { type EntityMetadata, type Field, getBaseMeta } from \"./EntityMetadata.ts\";\nimport {\n  type Column,\n  ConditionBuilder,\n  getConstructorFromTaggedId,\n  isDefined,\n  keyToNumber,\n  maybeResolveReferenceToId,\n} from \"./index.ts\";\nimport { kq, kqDot } from \"./keywords.ts\";\nimport { pruneUnusedJoins } from \"./QueryParser.pruning.ts\";\nimport { visitConditions } from \"./QueryVisitor.ts\";\nimport { type Scope, isScope, isScopeJoinFilter, resolveScope } from \"./scopes.ts\";\nimport { abbreviation, assertNever, fail } from \"./utils.ts\";\n\n/** A tree of ANDs/ORs with conditions or nested conditions. */\nexport interface ParsedExpressionFilter {\n  kind: \"exp\";\n  op: \"and\" | \"or\";\n  conditions: ParsedExpressionCondition[];\n}\n\n/** A condition or nested condition in a `ParsedExpressionFilter`. */\nexport type ParsedExpressionCondition = ParsedExpressionFilter | ColumnCondition | RawCondition | ExistsCondition;\n\nexport interface ColumnCondition {\n  kind: \"column\";\n  alias: string;\n  column: string;\n  dbType: string;\n  cond: ParsedValueFilter<any>;\n  /**\n   * A pruneable condition is one that was auto-added by something like soft-delete, and shouldn't\n   * be something that marks a join as actually used by the user's query.\n   */\n  pruneable?: boolean;\n}\n\n/** A user-provided condition like `SUM(${alias}.amount) > 1000` or `a1.last_name = b1.title`. */\nexport interface RawCondition {\n  kind: \"raw\";\n  /** The aliases, i.e. `[a, b]`, used within the condition, to ensure we don't prune them. */\n  aliases: string[];\n  /** The condition itself, i.e. `SUM(a.age) DESC`. */\n  condition: string;\n  /** The bindings within `condition`, i.e. `SUM(${alias}.amount) > ?`. */\n  bindings: readonly any[];\n  /** Used to mark system-added conditions (like `LATERAL JOIN` conditions), which can be ignored when pruning unused joins. */\n  pruneable: boolean;\n}\n\n/** An EXISTS or NOT EXISTS subquery condition. */\nexport interface ExistsCondition {\n  kind: \"exists\";\n  /** When true, renders as NOT EXISTS. */\n  negate: boolean;\n  /** The subquery: SELECT 1 FROM child WHERE correlation AND filter. */\n  subquery: ParsedFindQuery;\n  /** Outer aliases referenced by the correlation predicate, for join pruning. */\n  outerAliases: string[];\n}\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          targetCb.maybeAddExpression(result.conditions);\n        } else {\n          const conditions = Array.isArray(result) ? result : [result];\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            if (isNilIdValue(f.value)) return;\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 || isNilIdValue(value)\n                ? value\n                : 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    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/** An ADT version of `EntityFilter`. */\nexport type ParsedEntityFilter =\n  // ParsedValueFilter is any simple match on `id`\n  | ParsedValueFilter<string | number>\n  // Otherwise we return the join/complex\n  | { kind: \"join\"; subFilter: object };\n\n/** Parses an entity filter, which could be \"just an id\", an array of ids, or a nested filter. */\nexport function parseEntityFilter(meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined {\n  if (filter === undefined) {\n    // This matches legacy `em.find(Book, { author: undefined })` behavior\n    return undefined;\n  } else if (isAlias(filter)) {\n    // We're just binding an alias to this position in the join tree\n    return undefined;\n  } else if (isScope(filter)) {\n    // A scope on a relation (e.g. `{ author: Author.adult }`) always implies conditions on the\n    // related entity, so signal \"needs a join\" via the existing `join` discriminant rather than\n    // adding a dedicated `kind: \"scope\"` that every relation branch would have to learn. The empty\n    // `subFilter` is intentionally never read: the m2o/m2m branches only check `kind === \"join\"` to\n    // decide whether to join, then re-dispatch the original scope value back through `addTable`,\n    // where `isScope(...)` routes it to `addScopeFilterAt` to apply the scope's actual fragments.\n    return { kind: \"join\", subFilter: {} };\n  } else if (filter === null) {\n    return { kind: \"is-null\" };\n  } else if (typeof filter === \"string\" || typeof filter === \"number\") {\n    return { kind: \"eq\", value: filter };\n  } else if (typeof filter === \"boolean\") {\n    return filter ? { kind: \"not-null\" } : { kind: \"is-null\" };\n  } else if (Array.isArray(filter)) {\n    return {\n      kind: \"in\",\n      value: filter.map((v: string | number | Entity) => {\n        return isEntity(v) ? (v.idTaggedMaybe ?? nilIdValue(meta)) : v;\n      }),\n    };\n  } else if (isEntity(filter)) {\n    return { kind: \"eq\", value: filter.idTaggedMaybe || nilIdValue(meta) };\n  } else if (typeof filter === \"object\") {\n    // Looking for `{ firstName: \"f1\" }` or `{ ne: \"f1\" }`\n    const keys = Object.keys(filter);\n    // Special case only looking at `ne`\n    if (keys.length === 1 && keys[0] === \"ne\") {\n      const value = filter[\"ne\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"not-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"ne\", value };\n      } else if (isEntity(value)) {\n        return { kind: \"ne\", value: value.idTaggedMaybe || nilIdValue(meta) };\n      } else {\n        throw new Error(`Unsupported \"ne\" value ${value}`);\n      }\n    }\n    // Special case only looking at `id`\n    if (keys.length === 1 && keys[0] === \"id\") {\n      const value = filter[\"id\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"is-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"eq\", value };\n      } else if (isEntity(value)) {\n        return { kind: \"eq\", value: value.idTaggedMaybe || nilIdValue(meta) };\n      } else {\n        return parseValueFilter(value)[0] as any;\n      }\n    }\n    // Look for subFilter values being EntityFilter-ish instances like ManyToOneReference\n    // that have an id, and so structurally match the entity filter without really being filters,\n    // and convert them over here before getting into parseValueFilter.\n    const subFilter = {} as any;\n    for (const [key, value] of Object.entries(filter)) {\n      if (value && typeof value === \"object\" && !isPlainObject(value) && \"idTaggedMaybe\" in value) {\n        subFilter[key] = value.idTaggedMaybe || nilIdValue(meta);\n      } else {\n        subFilter[key] = value;\n      }\n    }\n    return { kind: \"join\", subFilter };\n  } else {\n    throw new Error(`Unrecognized filter ${filter}`);\n  }\n}\n\n/**\n * We use this value if users include new (id-less) entities as em.find conditions.\n *\n * The idea is that this condition would never be met, but we still want to do the em.find\n * query in case it's in an `OR` clause that would match false, but some other part of the\n * clause would match. I.e. instead of just skipping the DB query all together, which is\n * also something we could consider doing.\n *\n * For int IDs we use -1, and for uuid IDs, we use the nil UUID value:\n *\n * https://en.wikipedia.org/wiki/Universally_unique_identifier#Nil_UUID\n */\nfunction nilIdValue(meta: EntityMetadata): any {\n  switch (meta.idDbType) {\n    case \"int\":\n    case \"bigint\":\n      return -1;\n    case \"uuid\":\n      return \"00000000-0000-0000-0000-000000000000\";\n    case \"text\":\n      return \"0\";\n    default:\n      return assertNever(meta.idDbType);\n  }\n}\n\nfunction isNilIdValue(value: any): boolean {\n  return value === -1 || value === \"00000000-0000-0000-0000-000000000000\";\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/**\n * An ADT version of `ValueFilter`.\n *\n * The ValueFilter is a\n */\nexport type ParsedValueFilter<V> =\n  | { kind: \"eq\"; value: V }\n  | { kind: \"in\"; value: readonly V[] }\n  | { kind: \"nin\"; value: readonly V[] }\n  | { kind: \"gt\"; value: V }\n  | { kind: \"gte\"; value: V }\n  | { kind: \"ne\"; value: V }\n  | { kind: \"is-null\" }\n  | { kind: \"not-null\" }\n  | { kind: \"lt\"; value: V }\n  | { kind: \"lte\"; value: V }\n  | { kind: \"like\"; value: V }\n  | { kind: \"nlike\"; value: V }\n  | { kind: \"ilike\"; value: V }\n  | { kind: \"nilike\"; value: V }\n  | { kind: \"regex\"; value: V }\n  | { kind: \"nregex\"; value: V }\n  | { kind: \"iregex\"; value: V }\n  | { kind: \"niregex\"; value: V }\n  | { kind: \"contains\"; value: readonly V[] }\n  | { kind: \"ncontains\"; value: readonly V[] }\n  | { kind: \"overlaps\"; value: readonly V[] }\n  | { kind: \"noverlaps\"; value: readonly V[] }\n  | { kind: \"containedBy\"; value: readonly V[] }\n  | { kind: \"between\"; value: [V, V] }\n  | { kind: \"jsonPathExists\"; value: string }\n  | { kind: \"jsonPathPredicate\"; value: string };\n\n/**\n * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.\n *\n * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have\n * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.\n */\nexport function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[] {\n  if (filter === null) {\n    return [{ kind: \"is-null\" }];\n  } else if (filter === undefined) {\n    // This is legacy behavior where `em.find(Book, { author: undefined })` would match all books\n    return [];\n  } else if (Array.isArray(filter)) {\n    return [{ kind: \"in\", value: filter }];\n  } else if (isPlainObject(filter)) {\n    const keys = Object.keys(filter);\n    if (keys.length === 0) {\n      // Should this be an error?\n      return [];\n    } else if (keys.length === 2 && \"op\" in filter && \"value\" in filter) {\n      // Probe for `findGql` op & value\n      const { op, value } = filter;\n      if (shouldPruneValueFilter(op, value)) {\n        return [];\n      } else if (value === null) {\n        return [{ kind: \"is-null\" }];\n      } else {\n        return [{ kind: op, value: value ?? null }];\n      }\n    } else if (keys.length === 2 && \"gte\" in filter && \"lte\" in filter) {\n      const { gte, lte } = filter;\n      return [{ kind: \"between\", value: [gte, lte] }];\n    } else {\n      return Object.entries(filter)\n        .map(([key, value]) => {\n          // Always do condition pruning on the value\n          if (shouldPruneValueFilter(key, value)) {\n            return undefined;\n          }\n          switch (key) {\n            case \"eq\":\n              if (value === null) {\n                return { kind: \"is-null\" as const };\n              } else {\n                return { kind: \"eq\" as const, value: filter[key] };\n              }\n            case \"ne\":\n              if (value === null) {\n                return { kind: \"not-null\" as const };\n              } else {\n                return { kind: \"ne\" as const, value: filter[key] ?? null };\n              }\n            case \"in\":\n            case \"nin\":\n            case \"gt\":\n            case \"gte\":\n            case \"lt\":\n            case \"lte\":\n            case \"like\":\n            case \"nlike\":\n            case \"ilike\":\n            case \"nilike\":\n            case \"regex\":\n            case \"nregex\":\n            case \"iregex\":\n            case \"niregex\":\n            case \"contains\":\n            case \"overlaps\":\n            case \"containedBy\":\n              return { kind: key, value: filter[key] };\n            case \"pathExists\":\n              return { kind: \"jsonPathExists\" as const, value: filter[key] };\n            case \"pathIsTrue\":\n              return { kind: \"jsonPathPredicate\" as const, value: filter[key] };\n            case \"search\":\n              return { kind: \"ilike\" as const, value: makeLike(filter[key]) };\n            case \"between\":\n              return { kind: key, value: filter[key] };\n            default:\n              throw new Error(`Unsupported value filter key ${key}`);\n          }\n        })\n        .filter(isDefined);\n    }\n  } else {\n    // This is a primitive like a string, number\n    return [{ kind: \"eq\", value: filter }];\n  }\n}\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any> {\n  // ...to teach this `mapToDb` function to handle/rewrite `in: [1, null]` handling, we'd need to:\n  // 1. return a maybe-simple/maybe-nested condition, so basically a `ParsedExpressionCondition`, because\n  // this would let `in` return an `{ or: ... }` to all the callers.\n  // 2. also return `{ parsed: ParsedExpressionCondition, simples: SimpleCondition[] }` tuple, for the\n  // alias `addCondition` processing to track the `simples` and rewrite their alias when later bound.\n  switch (filter.kind) {\n    case \"eq\":\n    case \"gt\":\n    case \"gte\":\n    case \"ne\":\n    case \"lt\":\n    case \"lte\":\n    case \"like\":\n    case \"nlike\":\n    case \"ilike\":\n    case \"nilike\":\n    case \"regex\":\n    case \"nregex\":\n    case \"iregex\":\n    case \"niregex\":\n      filter.value = column.mapToDb(filter.value);\n      return filter;\n    case \"in\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        return { kind: \"contains\", value: column.mapToDb(filter.value) };\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"nin\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        throw new Error(\"The nin operator is not supported on array columns yet\");\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"contains\":\n    case \"ncontains\":\n    case \"overlaps\":\n    case \"noverlaps\":\n    case \"containedBy\":\n      const supportsContains = column.isArray || column.dbType === \"jsonb\";\n      if (!supportsContains) {\n        throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);\n      }\n      if (column.isArray) {\n        filter.value = column.mapToDb(filter.value);\n      } else {\n        // leave jsonb values alone\n      }\n      return filter;\n    case \"between\":\n      filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];\n      return filter;\n    case \"is-null\":\n    case \"not-null\":\n    case \"jsonPathExists\":\n    case \"jsonPathPredicate\":\n      return filter;\n    default:\n      throw assertNever(filter);\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/**\n * Builds the primary table's SELECT columns explicitly, i.e. excluding any `lazy` columns.\n *\n * Only used when `meta.hasLazyColumns` is true; otherwise callers keep their plain `alias.*`, so\n * that entities without lazy columns emit byte-identical SQL to before this feature existed.\n */\nexport function lazyExcludedSelects(meta: EntityMetadata, alias: string): string[] {\n  const selects: string[] = [];\n  for (const field of Object.values(meta.fields)) {\n    if (!field.serde) continue;\n    if (field.kind === \"primitive\" && field.lazy) continue;\n    for (const column of field.serde.columns) selects.push(kqDot(alias, column.columnName));\n  }\n  return selects;\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 maybeAddNotSoftDeleted(\n  conditions: ColumnCondition[],\n  meta: EntityMetadata,\n  alias: string,\n  softDeletes: \"include\" | \"exclude\",\n): void {\n  if (filterSoftDeletes(meta, softDeletes)) {\n    const column = meta.allFields[getBaseMeta(meta).timestampFields!.deletedAt!].serde?.columns[0]!;\n    conditions.push({\n      kind: \"column\",\n      alias,\n      column: column.columnName,\n      dbType: column.dbType,\n      cond: { kind: \"is-null\" },\n    });\n  }\n}\n\nexport function filterSoftDeletes(meta: EntityMetadata, softDeletes: \"include\" | \"exclude\"): boolean {\n  return (\n    softDeletes === \"exclude\" &&\n    !!getBaseMeta(meta).timestampFields?.deletedAt &&\n    // We don't support CTI subtype soft-delete filtering yet\n    (meta.inheritanceType !== \"cti\" || meta.baseTypes.length === 0)\n  );\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\n/** The `type_id = X` discriminator condition for an STI subtype, shared by em.find and em.query. */\nexport function stiSubtypeFilter(meta: EntityMetadata, alias: string): ColumnCondition | undefined {\n  if (meta.inheritanceType !== \"sti\" || meta.stiDiscriminatorValue === undefined) return undefined;\n  const baseMeta = getBaseMeta(meta);\n  const column = baseMeta.fields[baseMeta.stiDiscriminatorField!].serde?.columns[0]!;\n  return {\n    kind: \"column\",\n    alias,\n    column: column.columnName,\n    dbType: column.dbType,\n    cond: { kind: \"eq\", value: meta.stiDiscriminatorValue },\n    pruneable: true,\n  };\n}\n\n/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */\nexport function makeLike(search: any | undefined): any {\n  return search ? `%${search.replace(/\\s+/g, \"%\")}%` : undefined;\n}\n\n/** Returns true for values that should be treated like an omitted filter. */\nfunction shouldPruneValueFilter(key: unknown, value: unknown): boolean {\n  if (value === undefined) return true;\n  return value === false && key !== \"eq\" && key !== \"ne\";\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAsNA,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,yBAAAA,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,IAAI,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,eAAAA,QAAQ,MAAM;EAClC,MAAM,KAAK,cAAc,KAAA,IAAY,kBAAkB,MAAM,MAAM;EACnE,IAAI,CAAC,eAAe,CAAC,MAAM,SAAS,aAAa,CAACC,gBAAAA,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,iBAAAA,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,iBAAAA,MAAM,OAAO,IAAI;IACvB,MAAMA,iBAAAA,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,gBAAAA,QAAQ,OAAO,EAAE,GAC7E,cAAc,IAAIG,gBAAAA,aAAa,OAAO,EAAE,GAAG;GAAE;GAAM;EAAM,CAAC;OACrD,IAAIH,gBAAAA,QAAQ,MAAM,GACvB,cAAc,IAAIG,gBAAAA,aAAa,MAAM,GAAG;GAAE;GAAM;EAAM,CAAC;EAGzD,YAAY,MAAM,OAAO,QAAQ,UAAU,IAAI,IAAI;CACrD;CAEA,SAAS,YACP,MACA,YACA,QACA,UACA,SAAyC,kBAAkB,MAAM,MAAM,GACvE,aAAkC,WAC5B;EACN,IAAIJ,eAAAA,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,YAAYK,eAAAA,aAAa,KAAK,CAAC,CAAC,WACzC,IAAI,SAAS,SAAS,UACpB,YAAY,MAAM,YAAY,SAAS,QAAQ,UAAU,KAAA,GAAW,UAAU;OACzE;GACL,MAAM,IAAIC,gBAAAA,MAAS,KAAK,IAAI;GAC5B,MAAM,SAAS,SAAS,GAAG,CAAC;GAC5B,cAAc,IAAIF,gBAAAA,aAAa,CAAC,GAAG;IAAE;IAAM,OAAO;GAAW,CAAC;GAC9D,IAAIG,eAAAA,kBAAkB,MAAM,GAAG;IAG7B,YAAY,MAAM,YAAY,OAAO,OAAO,UAAU,KAAA,GAAW,UAAU;IAC3E,SAAS,mBAAmB,OAAO,UAAU;GAC/C,OAAO;IACL,MAAM,aAAa,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;IAC3D,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,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,gBAAAA,QAAQ,GAAG,GAAG;KAChB,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,UACAE,iBAAAA,MAAM,IAAI,OAAO,UAAU,GAC3BA,iBAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF;IACA,MAAM,IAAI,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,UACAA,iBAAAA,MAAM,IAAI,OAAO,UAAU,GAC3BA,iBAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF,OACE,SAAS,eAAe,IAAI,QAAQ,CAAC;GAEzC,OAAO,IAAI,MAAM,SAAS,QAAQ;IAChC,MAAM,IAAI,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,IAAI,aAAa,EAAE,KAAK,GAAG;KAC3B,MAAM,OAAO,MAAM,WAAW,MAAM,MAAM;MACxC,MAAM,YAAY,EAAE,cAAc;MAClC,MAAM,OAAOM,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,MAAM,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,MAAMT,uBAAAA,YAAY,IAAI,CAAC,CAAC,CACrG,aACH,WAAW,MAAO,QAAQ,EAAE,CAAC;IACnC,SACE,MAAM,cAAc,GACpB,GACA,SACAI,iBAAAA,MAAM,YAAY,IAAI,GACtBA,iBAAAA,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,iBAAAA,MAAM,YAAY,IAAI,GACtBA,iBAAAA,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,IAAI,kBAAkB,MAAM,cAAc,GAAG,GAAG;IACtD,IAAI,CAAC,KAAK,CAACF,gBAAAA,QAAQ,GAAG,GAAG;IAEzB,MAAM,KAAK,SAAS,MAAM,aAAa;IACvC,OAAO,KAAK;KACV,MAAM;KACN,OAAO;KACP,OAAO,MAAM;KACb,MAAME,iBAAAA,MAAM,YAAY,IAAI;KAC5B,MAAMA,iBAAAA,MAAM,IAAI,MAAM,YAAY,EAAE;KACpC,YAAY;MAAE,aAAa;MAAY,WAAW;MAAI,MAAM;KAAM;IACpE,CAAC;IAED,IAAIF,gBAAAA,QAAQ,GAAG,KAAK,GAAG,SAAS,UAAU,kBAAkB,MAAM,cAAc,GAAG,WAAW,GAAG;KAC/F,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,SACAE,iBAAAA,MAAM,IAAI,MAAM,YAAY,EAAE,GAC9BA,iBAAAA,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,QAAQ,aAAa,KAAK,IACvC,QACAQ,aAAAA,YAAY,WAAWC,aAAAA,0BAA0B,KAAK,CAAC;MAC7D;KACF;KACA,SAAS,mBAAmB;MAC1B,MAAM;MACN,OAAO;MACP,QAAQ,MAAM,YAAY;MAC1B,QAAQ,UAAU;MAClB,MAAM,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,MAAMT,iBAAAA,MAAM,YAAY,IAAI;KAC5B,MAAMA,iBAAAA,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,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,IAAIN,yBAAAA,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,QAAQW,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,KAAKK,gBAAAA,iBAAiB,MAAM,OAAO,MAAM,KAAK;KAEpD,OAAO,KAAK;MACV,OAAO;MACP;MACA,MAAM;MACN,MAAMV,iBAAAA,MAAM,IAAI,MAAM;MACtB,MAAMA,iBAAAA,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,MAAMW,UAAQ,SAAS,KAAK,SAAS;CACrC,IAAI,KAAK,gBACP,QAAQ,KAAK,GAAG,oBAAoB,MAAMA,OAAK,CAAC;MAEhD,QAAQ,KAAK,GAAGZ,iBAAAA,GAAGY,OAAK,EAAE,GAAG;CAE/B,SAAS,MAAMA,SAAO,WAAW,OAAO,OAAO,MAAM;CAGrD,IAAI,gBACF,GAAG,mBAAmB,cAAc;CAGtC,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,4BAAA,iBAAiB,OAAO,WAAW;CAErC,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,mBAAmB,OAA8B;CAC/D,qBAAA,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,OAAOC,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;;AAUA,SAAgB,kBAAkB,MAAsB,QAA6C;CACnG,IAAI,WAAW,KAAA,GAEb;MACK,IAAId,gBAAAA,QAAQ,MAAM,GAEvB;MACK,IAAID,eAAAA,QAAQ,MAAM,GAOvB,OAAO;EAAE,MAAM;EAAQ,WAAW,CAAC;CAAE;MAChC,IAAI,WAAW,MACpB,OAAO,EAAE,MAAM,UAAU;MACpB,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UACzD,OAAO;EAAE,MAAM;EAAM,OAAO;CAAO;MAC9B,IAAI,OAAO,WAAW,WAC3B,OAAO,SAAS,EAAE,MAAM,WAAW,IAAI,EAAE,MAAM,UAAU;MACpD,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO;EACL,MAAM;EACN,OAAO,OAAO,KAAK,MAAgC;GACjD,OAAOgB,eAAAA,SAAS,CAAC,IAAK,EAAE,iBAAiB,WAAW,IAAI,IAAK;EAC/D,CAAC;CACH;MACK,IAAIA,eAAAA,SAAS,MAAM,GACxB,OAAO;EAAE,MAAM;EAAM,OAAO,OAAO,iBAAiB,WAAW,IAAI;CAAE;MAChE,IAAI,OAAO,WAAW,UAAU;EAErC,MAAM,OAAO,OAAO,KAAK,MAAM;EAE/B,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,WAAW;QACrB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAIA,eAAAA,SAAS,KAAK,GACvB,OAAO;IAAE,MAAM;IAAM,OAAO,MAAM,iBAAiB,WAAW,IAAI;GAAE;QAEpE,MAAM,IAAI,MAAM,0BAA0B,OAAO;EAErD;EAEA,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,UAAU;QACpB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAIA,eAAAA,SAAS,KAAK,GACvB,OAAO;IAAE,MAAM;IAAM,OAAO,MAAM,iBAAiB,WAAW,IAAI;GAAE;QAEpE,OAAO,iBAAiB,KAAK,CAAC,CAAC;EAEnC;EAIA,MAAM,YAAY,CAAC;EACnB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,SAAS,OAAO,UAAU,YAAY,EAAA,GAACC,YAAAA,cAAAA,CAAc,KAAK,KAAK,mBAAmB,OACpF,UAAU,OAAO,MAAM,iBAAiB,WAAW,IAAI;OAEvD,UAAU,OAAO;EAGrB,OAAO;GAAE,MAAM;GAAQ;EAAU;CACnC,OACE,MAAM,IAAI,MAAM,uBAAuB,QAAQ;AAEnD;;;;;;;;;;;;;AAcA,SAAS,WAAW,MAA2B;CAC7C,QAAQ,KAAK,UAAb;EACE,KAAK;EACL,KAAK,UACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,SACE,OAAOC,cAAAA,YAAY,KAAK,QAAQ;CACpC;AACF;AAEA,SAAS,aAAa,OAAqB;CACzC,OAAO,UAAU,MAAM,UAAU;AACnC;;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;;;;;;;AAyCA,SAAgB,iBAAoB,QAAqD;CACvF,IAAI,WAAW,MACb,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;MACtB,IAAI,WAAW,KAAA,GAEpB,OAAO,CAAC;MACH,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;MAChC,KAAA,GAAID,YAAAA,cAAAA,CAAc,MAAM,GAAG;EAChC,MAAM,OAAO,OAAO,KAAK,MAAM;EAC/B,IAAI,KAAK,WAAW,GAElB,OAAO,CAAC;OACH,IAAI,KAAK,WAAW,KAAK,QAAQ,UAAU,WAAW,QAAQ;GAEnE,MAAM,EAAE,IAAI,UAAU;GACtB,IAAI,uBAAuB,IAAI,KAAK,GAClC,OAAO,CAAC;QACH,IAAI,UAAU,MACnB,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;QAE3B,OAAO,CAAC;IAAE,MAAM;IAAI,OAAO,SAAS;GAAK,CAAC;EAE9C,OAAO,IAAI,KAAK,WAAW,KAAK,SAAS,UAAU,SAAS,QAAQ;GAClE,MAAM,EAAE,KAAK,QAAQ;GACrB,OAAO,CAAC;IAAE,MAAM;IAAW,OAAO,CAAC,KAAK,GAAG;GAAE,CAAC;EAChD,OACE,OAAO,OAAO,QAAQ,MAAM,CAAC,CAC1B,KAAK,CAAC,KAAK,WAAW;GAErB,IAAI,uBAAuB,KAAK,KAAK,GACnC;GAEF,QAAQ,KAAR;IACE,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,UAAmB;SAElC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO;IAAK;IAErD,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,WAAoB;SAEnC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO,QAAQ;IAAK;IAE7D,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,eACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,KAAK,cACH,OAAO;KAAE,MAAM;KAA2B,OAAO,OAAO;IAAK;IAC/D,KAAK,cACH,OAAO;KAAE,MAAM;KAA8B,OAAO,OAAO;IAAK;IAClE,KAAK,UACH,OAAO;KAAE,MAAM;KAAkB,OAAO,SAAS,OAAO,IAAI;IAAE;IAChE,KAAK,WACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,SACE,MAAM,IAAI,MAAM,gCAAgC,KAAK;GACzD;EACF,CAAC,CAAC,CACD,OAAOE,sBAAAA,SAAS;CAEvB,OAEE,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;AAEzC;;AAGA,SAAgB,QAAQ,QAAgB,QAAwD;CAM9F,QAAQ,OAAO,MAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAC1C,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,OAAO;IAAE,MAAM;IAAY,OAAO,OAAO,QAAQ,OAAO,KAAK;GAAE;QAE/D,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,MAAM,IAAI,MAAM,wDAAwD;QAExE,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GAEH,IAAI,EADqB,OAAO,WAAW,OAAO,WAAW,UAE3D,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,+CAA+C;GAEhF,IAAI,OAAO,SACT,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAI5C,OAAO;EACT,KAAK;GACH,OAAO,QAAQ,CAAC,OAAO,QAAQ,OAAO,MAAM,EAAE,GAAG,OAAO,QAAQ,OAAO,MAAM,EAAE,CAAC;GAChF,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,qBACH,OAAO;EACT,SACE,MAAMD,cAAAA,YAAY,MAAM;CAC5B;AACF;;AAGA,SAAgB,gBAAgB,OAAwB,MAAsB,OAAqB;CACjG,MAAM,EAAE,aAAa;CACrB,IAAI,KAAK,SAAS;EAEhB,MAAM,UADQ,KAAK,UAAU,KAAK,YAAYV,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,iBAAAA,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,iBAAAA,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,iBAAAA,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;;;;;;;AAQA,SAAgB,oBAAoB,MAAsB,OAAyB;CACjF,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAAG;EAC9C,IAAI,CAAC,MAAM,OAAO;EAClB,IAAI,MAAM,SAAS,eAAe,MAAM,MAAM;EAC9C,KAAK,MAAM,UAAU,MAAM,MAAM,SAAS,QAAQ,KAAKP,iBAAAA,MAAM,OAAO,OAAO,UAAU,CAAC;CACxF;CACA,OAAO;AACT;;AAGA,SAAS,uBACP,OACA,UACM;CACN,SAAS,QAAQ,QAA4D;EAC3E,OAAO,SAAS,IAAI,MAAM,KAAKK,cAAAA,KAAK,aAAa,OAAO,UAAU,2CAA2C;CAC/G;CACA,SAAS,aAAuD,GAAqB;EACnF,OAAOY,sBAAAA,yBAAyB,CAAC,IAAI,EAAEC,sBAAAA,iBAAiB,CAAC,OAAO,IAAI,KAAA;CACtE;CACA,qBAAA,gBAAgB,OAAO;EAAE,WAAW;EAAc,UAAU;CAAa,CAAC;AAC5E;AAEA,SAAgB,uBACd,YACA,MACA,OACA,aACM;CACN,IAAI,kBAAkB,MAAM,WAAW,GAAG;EACxC,MAAM,SAAS,KAAK,UAAUtB,uBAAAA,YAAY,IAAI,CAAC,CAAC,gBAAiB,UAAW,CAAC,OAAO,QAAQ;EAC5F,WAAW,KAAK;GACd,MAAM;GACN;GACA,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf,MAAM,EAAE,MAAM,UAAU;EAC1B,CAAC;CACH;AACF;AAEA,SAAgB,kBAAkB,MAAsB,aAA6C;CACnG,OACE,gBAAgB,aAChB,CAAC,CAACA,uBAAAA,YAAY,IAAI,CAAC,CAAC,iBAAiB,cAEpC,KAAK,oBAAoB,SAAS,KAAK,UAAU,WAAW;AAEjE;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,OAAO,iBAAiB,aAAa,KAAK;CAChD,IAAI,MAAM,GAAG,mBAAmB,IAAI;AACtC;;AAGA,SAAgB,iBAAiB,MAAsB,OAA4C;CACjG,IAAI,KAAK,oBAAoB,SAAS,KAAK,0BAA0B,KAAA,GAAW,OAAO,KAAA;CACvF,MAAM,WAAWA,uBAAAA,YAAY,IAAI;CACjC,MAAM,SAAS,SAAS,OAAO,SAAS,sBAAuB,CAAC,OAAO,QAAQ;CAC/E,OAAO;EACL,MAAM;EACN;EACA,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,MAAM;GAAE,MAAM;GAAM,OAAO,KAAK;EAAsB;EACtD,WAAW;CACb;AACF;;AAGA,SAAgB,SAAS,QAA8B;CACrD,OAAO,SAAS,IAAI,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK,KAAA;AACvD;;AAGA,SAAS,uBAAuB,KAAc,OAAyB;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,OAAO,UAAU,SAAS,QAAQ,QAAQ,QAAQ;AACpD"}
+{"version":3,"file":"QueryParser.cjs","names":["ConditionBuilder","abbreviation","getBaseMeta","isScope","isAlias","kq","kqDot","getAliasMgmt","resolveScope","newAlias","isScopeJoinFilter","fail","getConstructorFromTaggedId","groupBy","keyToNumber","maybeResolveReferenceToId","getMaybeCtiAlias","alias","getMetadataForTable","isEntity","isPlainObject","assertNever","isDefined","isDeferredCondition","predicateBrand","isDeferredAliasCondition","deferredAliasSym"],"sources":["../src/QueryParser.ts"],"sourcesContent":["import { groupBy, isPlainObject } from \"joist-utils\";\n\nimport { type AliasMgmt, getAliasMgmt, getMaybeCtiAlias, isAlias, alias as newAlias } from \"./Aliases.ts\";\nimport { type ConditionInput, predicateBrand } from \"./conditions.ts\";\nimport { getMetadataForTable } from \"./configure.ts\";\nimport { deferredAliasSym, isDeferredAliasCondition } from \"./DeferredAlias.ts\";\nimport { type Entity, isEntity } from \"./Entity.ts\";\nimport { type ExpressionFilter, type OrderBy, type ValueFilter } from \"./EntityFilter.ts\";\nimport { type EntityMetadata, type Field, getBaseMeta } from \"./EntityMetadata.ts\";\nimport { isDeferredCondition } from \"./Expr.ts\";\nimport {\n  type Column,\n  ConditionBuilder,\n  getConstructorFromTaggedId,\n  isDefined,\n  keyToNumber,\n  maybeResolveReferenceToId,\n} from \"./index.ts\";\nimport { kq, kqDot } from \"./keywords.ts\";\nimport { pruneUnusedJoins } from \"./QueryParser.pruning.ts\";\nimport { visitConditions } from \"./QueryVisitor.ts\";\nimport { type Scope, isScope, isScopeJoinFilter, resolveScope } from \"./scopes.ts\";\nimport { abbreviation, assertNever, fail } from \"./utils.ts\";\n\n/** A tree of ANDs/ORs with conditions or nested conditions. */\nexport interface ParsedExpressionFilter {\n  kind: \"exp\";\n  op: \"and\" | \"or\";\n  conditions: ParsedExpressionCondition[];\n}\n\n/** A condition or nested condition in a `ParsedExpressionFilter`. */\nexport type ParsedExpressionCondition = ParsedExpressionFilter | ColumnCondition | RawCondition | ExistsCondition;\n\nexport interface ColumnCondition {\n  kind: \"column\";\n  alias: string;\n  column: string;\n  dbType: string;\n  cond: ParsedValueFilter<any>;\n  /**\n   * A pruneable condition is one that was auto-added by something like soft-delete, and shouldn't\n   * be something that marks a join as actually used by the user's query.\n   */\n  pruneable?: boolean;\n}\n\n/** A user-provided condition like `SUM(${alias}.amount) > 1000` or `a1.last_name = b1.title`. */\nexport interface RawCondition {\n  kind: \"raw\";\n  /** The aliases, i.e. `[a, b]`, used within the condition, to ensure we don't prune them. */\n  aliases: string[];\n  /** The condition itself, i.e. `SUM(a.age) DESC`. */\n  condition: string;\n  /** The bindings within `condition`, i.e. `SUM(${alias}.amount) > ?`. */\n  bindings: readonly any[];\n  /** Used to mark system-added conditions (like `LATERAL JOIN` conditions), which can be ignored when pruning unused joins. */\n  pruneable: boolean;\n}\n\n/** An EXISTS or NOT EXISTS subquery condition. */\nexport interface ExistsCondition {\n  kind: \"exists\";\n  /** When true, renders as NOT EXISTS. */\n  negate: boolean;\n  /** The subquery: SELECT 1 FROM child WHERE correlation AND filter. */\n  subquery: ParsedFindQuery;\n  /** Outer aliases referenced by the correlation predicate, for join pruning. */\n  outerAliases: string[];\n}\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            if (isNilIdValue(f.value)) return;\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 || isNilIdValue(value)\n                ? value\n                : 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/** An ADT version of `EntityFilter`. */\nexport type ParsedEntityFilter =\n  // ParsedValueFilter is any simple match on `id`\n  | ParsedValueFilter<string | number>\n  // Otherwise we return the join/complex\n  | { kind: \"join\"; subFilter: object };\n\n/** Parses an entity filter, which could be \"just an id\", an array of ids, or a nested filter. */\nexport function parseEntityFilter(meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined {\n  if (filter === undefined) {\n    // This matches legacy `em.find(Book, { author: undefined })` behavior\n    return undefined;\n  } else if (isAlias(filter)) {\n    // We're just binding an alias to this position in the join tree\n    return undefined;\n  } else if (isScope(filter)) {\n    // A scope on a relation (e.g. `{ author: Author.adult }`) always implies conditions on the\n    // related entity, so signal \"needs a join\" via the existing `join` discriminant rather than\n    // adding a dedicated `kind: \"scope\"` that every relation branch would have to learn. The empty\n    // `subFilter` is intentionally never read: the m2o/m2m branches only check `kind === \"join\"` to\n    // decide whether to join, then re-dispatch the original scope value back through `addTable`,\n    // where `isScope(...)` routes it to `addScopeFilterAt` to apply the scope's actual fragments.\n    return { kind: \"join\", subFilter: {} };\n  } else if (filter === null) {\n    return { kind: \"is-null\" };\n  } else if (typeof filter === \"string\" || typeof filter === \"number\") {\n    return { kind: \"eq\", value: filter };\n  } else if (typeof filter === \"boolean\") {\n    return filter ? { kind: \"not-null\" } : { kind: \"is-null\" };\n  } else if (Array.isArray(filter)) {\n    return {\n      kind: \"in\",\n      value: filter.map((v: string | number | Entity) => {\n        return isEntity(v) ? (v.idTaggedMaybe ?? nilIdValue(meta)) : v;\n      }),\n    };\n  } else if (isEntity(filter)) {\n    return { kind: \"eq\", value: filter.idTaggedMaybe || nilIdValue(meta) };\n  } else if (typeof filter === \"object\") {\n    // Looking for `{ firstName: \"f1\" }` or `{ ne: \"f1\" }`\n    const keys = Object.keys(filter);\n    // Special case only looking at `ne`\n    if (keys.length === 1 && keys[0] === \"ne\") {\n      const value = filter[\"ne\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"not-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"ne\", value };\n      } else if (isEntity(value)) {\n        return { kind: \"ne\", value: value.idTaggedMaybe || nilIdValue(meta) };\n      } else {\n        throw new Error(`Unsupported \"ne\" value ${value}`);\n      }\n    }\n    // Special case only looking at `id`\n    if (keys.length === 1 && keys[0] === \"id\") {\n      const value = filter[\"id\"];\n      if (value === undefined) {\n        return undefined;\n      } else if (value === null) {\n        return { kind: \"is-null\" };\n      } else if (typeof value === \"string\" || typeof value === \"number\") {\n        return { kind: \"eq\", value };\n      } else if (isEntity(value)) {\n        return { kind: \"eq\", value: value.idTaggedMaybe || nilIdValue(meta) };\n      } else {\n        return parseValueFilter(value)[0] as any;\n      }\n    }\n    // Look for subFilter values being EntityFilter-ish instances like ManyToOneReference\n    // that have an id, and so structurally match the entity filter without really being filters,\n    // and convert them over here before getting into parseValueFilter.\n    const subFilter = {} as any;\n    for (const [key, value] of Object.entries(filter)) {\n      if (value && typeof value === \"object\" && !isPlainObject(value) && \"idTaggedMaybe\" in value) {\n        subFilter[key] = value.idTaggedMaybe || nilIdValue(meta);\n      } else {\n        subFilter[key] = value;\n      }\n    }\n    return { kind: \"join\", subFilter };\n  } else {\n    throw new Error(`Unrecognized filter ${filter}`);\n  }\n}\n\n/**\n * We use this value if users include new (id-less) entities as em.find conditions.\n *\n * The idea is that this condition would never be met, but we still want to do the em.find\n * query in case it's in an `OR` clause that would match false, but some other part of the\n * clause would match. I.e. instead of just skipping the DB query all together, which is\n * also something we could consider doing.\n *\n * For int IDs we use -1, and for uuid IDs, we use the nil UUID value:\n *\n * https://en.wikipedia.org/wiki/Universally_unique_identifier#Nil_UUID\n */\nfunction nilIdValue(meta: EntityMetadata): any {\n  switch (meta.idDbType) {\n    case \"int\":\n    case \"bigint\":\n      return -1;\n    case \"uuid\":\n      return \"00000000-0000-0000-0000-000000000000\";\n    case \"text\":\n      return \"0\";\n    default:\n      return assertNever(meta.idDbType);\n  }\n}\n\nfunction isNilIdValue(value: any): boolean {\n  return value === -1 || value === \"00000000-0000-0000-0000-000000000000\";\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/**\n * An ADT version of `ValueFilter`.\n *\n * The ValueFilter is a\n */\nexport type ParsedValueFilter<V> =\n  | { kind: \"eq\"; value: V }\n  | { kind: \"in\"; value: readonly V[] }\n  | { kind: \"nin\"; value: readonly V[] }\n  | { kind: \"gt\"; value: V }\n  | { kind: \"gte\"; value: V }\n  | { kind: \"ne\"; value: V }\n  | { kind: \"is-null\" }\n  | { kind: \"not-null\" }\n  | { kind: \"lt\"; value: V }\n  | { kind: \"lte\"; value: V }\n  | { kind: \"like\"; value: V }\n  | { kind: \"nlike\"; value: V }\n  | { kind: \"ilike\"; value: V }\n  | { kind: \"nilike\"; value: V }\n  | { kind: \"regex\"; value: V }\n  | { kind: \"nregex\"; value: V }\n  | { kind: \"iregex\"; value: V }\n  | { kind: \"niregex\"; value: V }\n  | { kind: \"contains\"; value: readonly V[] }\n  | { kind: \"ncontains\"; value: readonly V[] }\n  | { kind: \"overlaps\"; value: readonly V[] }\n  | { kind: \"noverlaps\"; value: readonly V[] }\n  | { kind: \"containedBy\"; value: readonly V[] }\n  | { kind: \"between\"; value: [V, V] }\n  | { kind: \"jsonPathExists\"; value: string }\n  | { kind: \"jsonPathPredicate\"; value: string };\n\n/**\n * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.\n *\n * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have\n * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.\n */\nexport function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[] {\n  if (filter === null) {\n    return [{ kind: \"is-null\" }];\n  } else if (filter === undefined) {\n    // This is legacy behavior where `em.find(Book, { author: undefined })` would match all books\n    return [];\n  } else if (Array.isArray(filter)) {\n    return [{ kind: \"in\", value: filter }];\n  } else if (isPlainObject(filter)) {\n    const keys = Object.keys(filter);\n    if (keys.length === 0) {\n      // Should this be an error?\n      return [];\n    } else if (keys.length === 2 && \"op\" in filter && \"value\" in filter) {\n      // Probe for `findGql` op & value\n      const { op, value } = filter;\n      if (shouldPruneValueFilter(op, value)) {\n        return [];\n      } else if (value === null) {\n        return [{ kind: \"is-null\" }];\n      } else {\n        return [{ kind: op, value: value ?? null }];\n      }\n    } else if (keys.length === 2 && \"gte\" in filter && \"lte\" in filter) {\n      const { gte, lte } = filter;\n      return [{ kind: \"between\", value: [gte, lte] }];\n    } else {\n      return Object.entries(filter)\n        .map(([key, value]) => {\n          // Always do condition pruning on the value\n          if (shouldPruneValueFilter(key, value)) {\n            return undefined;\n          }\n          switch (key) {\n            case \"eq\":\n              if (value === null) {\n                return { kind: \"is-null\" as const };\n              } else {\n                return { kind: \"eq\" as const, value: filter[key] };\n              }\n            case \"ne\":\n              if (value === null) {\n                return { kind: \"not-null\" as const };\n              } else {\n                return { kind: \"ne\" as const, value: filter[key] ?? null };\n              }\n            case \"in\":\n            case \"nin\":\n            case \"gt\":\n            case \"gte\":\n            case \"lt\":\n            case \"lte\":\n            case \"like\":\n            case \"nlike\":\n            case \"ilike\":\n            case \"nilike\":\n            case \"regex\":\n            case \"nregex\":\n            case \"iregex\":\n            case \"niregex\":\n            case \"contains\":\n            case \"overlaps\":\n            case \"containedBy\":\n              return { kind: key, value: filter[key] };\n            case \"pathExists\":\n              return { kind: \"jsonPathExists\" as const, value: filter[key] };\n            case \"pathIsTrue\":\n              return { kind: \"jsonPathPredicate\" as const, value: filter[key] };\n            case \"search\":\n              return { kind: \"ilike\" as const, value: makeLike(filter[key]) };\n            case \"between\":\n              return { kind: key, value: filter[key] };\n            default:\n              throw new Error(`Unsupported value filter key ${key}`);\n          }\n        })\n        .filter(isDefined);\n    }\n  } else {\n    // This is a primitive like a string, number\n    return [{ kind: \"eq\", value: filter }];\n  }\n}\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any> {\n  // ...to teach this `mapToDb` function to handle/rewrite `in: [1, null]` handling, we'd need to:\n  // 1. return a maybe-simple/maybe-nested condition, so basically a `ParsedExpressionCondition`, because\n  // this would let `in` return an `{ or: ... }` to all the callers.\n  // 2. also return `{ parsed: ParsedExpressionCondition, simples: SimpleCondition[] }` tuple, for the\n  // alias `addCondition` processing to track the `simples` and rewrite their alias when later bound.\n  switch (filter.kind) {\n    case \"eq\":\n    case \"gt\":\n    case \"gte\":\n    case \"ne\":\n    case \"lt\":\n    case \"lte\":\n    case \"like\":\n    case \"nlike\":\n    case \"ilike\":\n    case \"nilike\":\n    case \"regex\":\n    case \"nregex\":\n    case \"iregex\":\n    case \"niregex\":\n      filter.value = column.mapToDb(filter.value);\n      return filter;\n    case \"in\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        return { kind: \"contains\", value: column.mapToDb(filter.value) };\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"nin\":\n      if (column.isArray) {\n        // Arrays need a special operator\n        throw new Error(\"The nin operator is not supported on array columns yet\");\n      } else {\n        filter.value = filter.value.map((v) => column.mapToDb(v));\n      }\n      return filter;\n    case \"contains\":\n    case \"ncontains\":\n    case \"overlaps\":\n    case \"noverlaps\":\n    case \"containedBy\":\n      const supportsContains = column.isArray || column.dbType === \"jsonb\";\n      if (!supportsContains) {\n        throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);\n      }\n      if (column.isArray) {\n        filter.value = column.mapToDb(filter.value);\n      } else {\n        // leave jsonb values alone\n      }\n      return filter;\n    case \"between\":\n      filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];\n      return filter;\n    case \"is-null\":\n    case \"not-null\":\n    case \"jsonPathExists\":\n    case \"jsonPathPredicate\":\n      return filter;\n    default:\n      throw assertNever(filter);\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/**\n * Builds the primary table's SELECT columns explicitly, i.e. excluding any `lazy` columns.\n *\n * Only used when `meta.hasLazyColumns` is true; otherwise callers keep their plain `alias.*`, so\n * that entities without lazy columns emit byte-identical SQL to before this feature existed.\n */\nexport function lazyExcludedSelects(meta: EntityMetadata, alias: string): string[] {\n  const selects: string[] = [];\n  for (const field of Object.values(meta.fields)) {\n    if (!field.serde) continue;\n    if (field.kind === \"primitive\" && field.lazy) continue;\n    for (const column of field.serde.columns) selects.push(kqDot(alias, column.columnName));\n  }\n  return selects;\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 maybeAddNotSoftDeleted(\n  conditions: ColumnCondition[],\n  meta: EntityMetadata,\n  alias: string,\n  softDeletes: \"include\" | \"exclude\",\n): void {\n  if (filterSoftDeletes(meta, softDeletes)) {\n    const column = meta.allFields[getBaseMeta(meta).timestampFields!.deletedAt!].serde?.columns[0]!;\n    conditions.push({\n      kind: \"column\",\n      alias,\n      column: column.columnName,\n      dbType: column.dbType,\n      cond: { kind: \"is-null\" },\n    });\n  }\n}\n\nexport function filterSoftDeletes(meta: EntityMetadata, softDeletes: \"include\" | \"exclude\"): boolean {\n  return (\n    softDeletes === \"exclude\" &&\n    !!getBaseMeta(meta).timestampFields?.deletedAt &&\n    // We don't support CTI subtype soft-delete filtering yet\n    (meta.inheritanceType !== \"cti\" || meta.baseTypes.length === 0)\n  );\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\n/** The `type_id = X` discriminator condition for an STI subtype, shared by em.find and em.query. */\nexport function stiSubtypeFilter(meta: EntityMetadata, alias: string): ColumnCondition | undefined {\n  if (meta.inheritanceType !== \"sti\" || meta.stiDiscriminatorValue === undefined) return undefined;\n  const baseMeta = getBaseMeta(meta);\n  const column = baseMeta.fields[baseMeta.stiDiscriminatorField!].serde?.columns[0]!;\n  return {\n    kind: \"column\",\n    alias,\n    column: column.columnName,\n    dbType: column.dbType,\n    cond: { kind: \"eq\", value: meta.stiDiscriminatorValue },\n    pruneable: true,\n  };\n}\n\n/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */\nexport function makeLike(search: any | undefined): any {\n  return search ? `%${search.replace(/\\s+/g, \"%\")}%` : undefined;\n}\n\n/** Returns true for values that should be treated like an omitted filter. */\nfunction shouldPruneValueFilter(key: unknown, value: unknown): boolean {\n  if (value === undefined) return true;\n  return value === false && key !== \"eq\" && key !== \"ne\";\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAwNA,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,yBAAAA,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,IAAI,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,eAAAA,QAAQ,MAAM;EAClC,MAAM,KAAK,cAAc,KAAA,IAAY,kBAAkB,MAAM,MAAM;EACnE,IAAI,CAAC,eAAe,CAAC,MAAM,SAAS,aAAa,CAACC,gBAAAA,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,iBAAAA,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,iBAAAA,MAAM,OAAO,IAAI;IACvB,MAAMA,iBAAAA,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,gBAAAA,QAAQ,OAAO,EAAE,GAC7E,cAAc,IAAIG,gBAAAA,aAAa,OAAO,EAAE,GAAG;GAAE;GAAM;EAAM,CAAC;OACrD,IAAIH,gBAAAA,QAAQ,MAAM,GACvB,cAAc,IAAIG,gBAAAA,aAAa,MAAM,GAAG;GAAE;GAAM;EAAM,CAAC;EAGzD,YAAY,MAAM,OAAO,QAAQ,UAAU,IAAI,IAAI;CACrD;CAEA,SAAS,YACP,MACA,YACA,QACA,UACA,SAAyC,kBAAkB,MAAM,MAAM,GACvE,aAAkC,WAC5B;EACN,IAAIJ,eAAAA,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,YAAYK,eAAAA,aAAa,KAAK,CAAC,CAAC,WACzC,IAAI,SAAS,SAAS,UACpB,YAAY,MAAM,YAAY,SAAS,QAAQ,UAAU,KAAA,GAAW,UAAU;OACzE;GACL,MAAM,IAAIC,gBAAAA,MAAS,KAAK,IAAI;GAC5B,MAAM,SAAS,SAAS,GAAG,CAAC;GAC5B,cAAc,IAAIF,gBAAAA,aAAa,CAAC,GAAG;IAAE;IAAM,OAAO;GAAW,CAAC;GAC9D,IAAIG,eAAAA,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,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,gBAAAA,QAAQ,GAAG,GAAG;KAChB,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,UACAE,iBAAAA,MAAM,IAAI,OAAO,UAAU,GAC3BA,iBAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF;IACA,MAAM,IAAI,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,UACAA,iBAAAA,MAAM,IAAI,OAAO,UAAU,GAC3BA,iBAAAA,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF,OACE,SAAS,eAAe,IAAI,QAAQ,CAAC;GAEzC,OAAO,IAAI,MAAM,SAAS,QAAQ;IAChC,MAAM,IAAI,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,IAAI,aAAa,EAAE,KAAK,GAAG;KAC3B,MAAM,OAAO,MAAM,WAAW,MAAM,MAAM;MACxC,MAAM,YAAY,EAAE,cAAc;MAClC,MAAM,OAAOM,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,MAAM,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,MAAMT,uBAAAA,YAAY,IAAI,CAAC,CAAC,CACrG,aACH,WAAW,MAAO,QAAQ,EAAE,CAAC;IACnC,SACE,MAAM,cAAc,GACpB,GACA,SACAI,iBAAAA,MAAM,YAAY,IAAI,GACtBA,iBAAAA,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,iBAAAA,MAAM,YAAY,IAAI,GACtBA,iBAAAA,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,IAAI,kBAAkB,MAAM,cAAc,GAAG,GAAG;IACtD,IAAI,CAAC,KAAK,CAACF,gBAAAA,QAAQ,GAAG,GAAG;IAEzB,MAAM,KAAK,SAAS,MAAM,aAAa;IACvC,OAAO,KAAK;KACV,MAAM;KACN,OAAO;KACP,OAAO,MAAM;KACb,MAAME,iBAAAA,MAAM,YAAY,IAAI;KAC5B,MAAMA,iBAAAA,MAAM,IAAI,MAAM,YAAY,EAAE;KACpC,YAAY;MAAE,aAAa;MAAY,WAAW;MAAI,MAAM;KAAM;IACpE,CAAC;IAED,IAAIF,gBAAAA,QAAQ,GAAG,KAAK,GAAG,SAAS,UAAU,kBAAkB,MAAM,cAAc,GAAG,WAAW,GAAG;KAC/F,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,SACAE,iBAAAA,MAAM,IAAI,MAAM,YAAY,EAAE,GAC9BA,iBAAAA,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,QAAQ,aAAa,KAAK,IACvC,QACAQ,aAAAA,YAAY,WAAWC,aAAAA,0BAA0B,KAAK,CAAC;MAC7D;KACF;KACA,SAAS,mBAAmB;MAC1B,MAAM;MACN,OAAO;MACP,QAAQ,MAAM,YAAY;MAC1B,QAAQ,UAAU;MAClB,MAAM,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,MAAMT,iBAAAA,MAAM,YAAY,IAAI;KAC5B,MAAMA,iBAAAA,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,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,IAAIN,yBAAAA,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,QAAQW,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,KAAKK,gBAAAA,iBAAiB,MAAM,OAAO,MAAM,KAAK;KAEpD,OAAO,KAAK;MACV,OAAO;MACP;MACA,MAAM;MACN,MAAMV,iBAAAA,MAAM,IAAI,MAAM;MACtB,MAAMA,iBAAAA,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,MAAMW,UAAQ,SAAS,KAAK,SAAS;CACrC,IAAI,KAAK,gBACP,QAAQ,KAAK,GAAG,oBAAoB,MAAMA,OAAK,CAAC;MAEhD,QAAQ,KAAK,GAAGZ,iBAAAA,GAAGY,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,4BAAA,iBAAiB,OAAO,WAAW;CAErC,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,mBAAmB,OAA8B;CAC/D,qBAAA,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,OAAOC,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;;AAUA,SAAgB,kBAAkB,MAAsB,QAA6C;CACnG,IAAI,WAAW,KAAA,GAEb;MACK,IAAId,gBAAAA,QAAQ,MAAM,GAEvB;MACK,IAAID,eAAAA,QAAQ,MAAM,GAOvB,OAAO;EAAE,MAAM;EAAQ,WAAW,CAAC;CAAE;MAChC,IAAI,WAAW,MACpB,OAAO,EAAE,MAAM,UAAU;MACpB,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UACzD,OAAO;EAAE,MAAM;EAAM,OAAO;CAAO;MAC9B,IAAI,OAAO,WAAW,WAC3B,OAAO,SAAS,EAAE,MAAM,WAAW,IAAI,EAAE,MAAM,UAAU;MACpD,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO;EACL,MAAM;EACN,OAAO,OAAO,KAAK,MAAgC;GACjD,OAAOgB,eAAAA,SAAS,CAAC,IAAK,EAAE,iBAAiB,WAAW,IAAI,IAAK;EAC/D,CAAC;CACH;MACK,IAAIA,eAAAA,SAAS,MAAM,GACxB,OAAO;EAAE,MAAM;EAAM,OAAO,OAAO,iBAAiB,WAAW,IAAI;CAAE;MAChE,IAAI,OAAO,WAAW,UAAU;EAErC,MAAM,OAAO,OAAO,KAAK,MAAM;EAE/B,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,WAAW;QACrB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAIA,eAAAA,SAAS,KAAK,GACvB,OAAO;IAAE,MAAM;IAAM,OAAO,MAAM,iBAAiB,WAAW,IAAI;GAAE;QAEpE,MAAM,IAAI,MAAM,0BAA0B,OAAO;EAErD;EAEA,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,UAAU;QACpB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAIA,eAAAA,SAAS,KAAK,GACvB,OAAO;IAAE,MAAM;IAAM,OAAO,MAAM,iBAAiB,WAAW,IAAI;GAAE;QAEpE,OAAO,iBAAiB,KAAK,CAAC,CAAC;EAEnC;EAIA,MAAM,YAAY,CAAC;EACnB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,SAAS,OAAO,UAAU,YAAY,EAAA,GAACC,YAAAA,cAAAA,CAAc,KAAK,KAAK,mBAAmB,OACpF,UAAU,OAAO,MAAM,iBAAiB,WAAW,IAAI;OAEvD,UAAU,OAAO;EAGrB,OAAO;GAAE,MAAM;GAAQ;EAAU;CACnC,OACE,MAAM,IAAI,MAAM,uBAAuB,QAAQ;AAEnD;;;;;;;;;;;;;AAcA,SAAS,WAAW,MAA2B;CAC7C,QAAQ,KAAK,UAAb;EACE,KAAK;EACL,KAAK,UACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,SACE,OAAOC,cAAAA,YAAY,KAAK,QAAQ;CACpC;AACF;AAEA,SAAS,aAAa,OAAqB;CACzC,OAAO,UAAU,MAAM,UAAU;AACnC;;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;;;;;;;AAyCA,SAAgB,iBAAoB,QAAqD;CACvF,IAAI,WAAW,MACb,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;MACtB,IAAI,WAAW,KAAA,GAEpB,OAAO,CAAC;MACH,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;MAChC,KAAA,GAAID,YAAAA,cAAAA,CAAc,MAAM,GAAG;EAChC,MAAM,OAAO,OAAO,KAAK,MAAM;EAC/B,IAAI,KAAK,WAAW,GAElB,OAAO,CAAC;OACH,IAAI,KAAK,WAAW,KAAK,QAAQ,UAAU,WAAW,QAAQ;GAEnE,MAAM,EAAE,IAAI,UAAU;GACtB,IAAI,uBAAuB,IAAI,KAAK,GAClC,OAAO,CAAC;QACH,IAAI,UAAU,MACnB,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;QAE3B,OAAO,CAAC;IAAE,MAAM;IAAI,OAAO,SAAS;GAAK,CAAC;EAE9C,OAAO,IAAI,KAAK,WAAW,KAAK,SAAS,UAAU,SAAS,QAAQ;GAClE,MAAM,EAAE,KAAK,QAAQ;GACrB,OAAO,CAAC;IAAE,MAAM;IAAW,OAAO,CAAC,KAAK,GAAG;GAAE,CAAC;EAChD,OACE,OAAO,OAAO,QAAQ,MAAM,CAAC,CAC1B,KAAK,CAAC,KAAK,WAAW;GAErB,IAAI,uBAAuB,KAAK,KAAK,GACnC;GAEF,QAAQ,KAAR;IACE,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,UAAmB;SAElC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO;IAAK;IAErD,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,WAAoB;SAEnC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO,QAAQ;IAAK;IAE7D,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,eACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,KAAK,cACH,OAAO;KAAE,MAAM;KAA2B,OAAO,OAAO;IAAK;IAC/D,KAAK,cACH,OAAO;KAAE,MAAM;KAA8B,OAAO,OAAO;IAAK;IAClE,KAAK,UACH,OAAO;KAAE,MAAM;KAAkB,OAAO,SAAS,OAAO,IAAI;IAAE;IAChE,KAAK,WACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,SACE,MAAM,IAAI,MAAM,gCAAgC,KAAK;GACzD;EACF,CAAC,CAAC,CACD,OAAOE,sBAAAA,SAAS;CAEvB,OAEE,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;AAEzC;;AAGA,SAAgB,QAAQ,QAAgB,QAAwD;CAM9F,QAAQ,OAAO,MAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAC1C,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,OAAO;IAAE,MAAM;IAAY,OAAO,OAAO,QAAQ,OAAO,KAAK;GAAE;QAE/D,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,MAAM,IAAI,MAAM,wDAAwD;QAExE,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GAEH,IAAI,EADqB,OAAO,WAAW,OAAO,WAAW,UAE3D,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,+CAA+C;GAEhF,IAAI,OAAO,SACT,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAI5C,OAAO;EACT,KAAK;GACH,OAAO,QAAQ,CAAC,OAAO,QAAQ,OAAO,MAAM,EAAE,GAAG,OAAO,QAAQ,OAAO,MAAM,EAAE,CAAC;GAChF,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,qBACH,OAAO;EACT,SACE,MAAMD,cAAAA,YAAY,MAAM;CAC5B;AACF;;AAGA,SAAgB,gBAAgB,OAAwB,MAAsB,OAAqB;CACjG,MAAM,EAAE,aAAa;CACrB,IAAI,KAAK,SAAS;EAEhB,MAAM,UADQ,KAAK,UAAU,KAAK,YAAYV,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,iBAAAA,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,iBAAAA,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,iBAAAA,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;;;;;;;AAQA,SAAgB,oBAAoB,MAAsB,OAAyB;CACjF,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAAG;EAC9C,IAAI,CAAC,MAAM,OAAO;EAClB,IAAI,MAAM,SAAS,eAAe,MAAM,MAAM;EAC9C,KAAK,MAAM,UAAU,MAAM,MAAM,SAAS,QAAQ,KAAKP,iBAAAA,MAAM,OAAO,OAAO,UAAU,CAAC;CACxF;CACA,OAAO;AACT;;AAGA,SAAS,qBAAqB,WAA6C;CACzE,IAAI,CAAC,WAAW;CAChB,IAAIiB,aAAAA,oBAAoB,SAAS,KAAMC,mBAAAA,kBAAkB,aAAa,UAAUA,mBAAAA,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,KAAKb,cAAAA,KAAK,aAAa,OAAO,UAAU,2CAA2C;CAC/G;CACA,SAAS,aAAuD,GAAqB;EACnF,OAAOc,sBAAAA,yBAAyB,CAAC,IAAI,EAAEC,sBAAAA,iBAAiB,CAAC,OAAO,IAAI,KAAA;CACtE;CACA,qBAAA,gBAAgB,OAAO;EAAE,WAAW;EAAc,UAAU;CAAa,CAAC;AAC5E;AAEA,SAAgB,uBACd,YACA,MACA,OACA,aACM;CACN,IAAI,kBAAkB,MAAM,WAAW,GAAG;EACxC,MAAM,SAAS,KAAK,UAAUxB,uBAAAA,YAAY,IAAI,CAAC,CAAC,gBAAiB,UAAW,CAAC,OAAO,QAAQ;EAC5F,WAAW,KAAK;GACd,MAAM;GACN;GACA,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf,MAAM,EAAE,MAAM,UAAU;EAC1B,CAAC;CACH;AACF;AAEA,SAAgB,kBAAkB,MAAsB,aAA6C;CACnG,OACE,gBAAgB,aAChB,CAAC,CAACA,uBAAAA,YAAY,IAAI,CAAC,CAAC,iBAAiB,cAEpC,KAAK,oBAAoB,SAAS,KAAK,UAAU,WAAW;AAEjE;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,OAAO,iBAAiB,aAAa,KAAK;CAChD,IAAI,MAAM,GAAG,mBAAmB,IAAI;AACtC;;AAGA,SAAgB,iBAAiB,MAAsB,OAA4C;CACjG,IAAI,KAAK,oBAAoB,SAAS,KAAK,0BAA0B,KAAA,GAAW,OAAO,KAAA;CACvF,MAAM,WAAWA,uBAAAA,YAAY,IAAI;CACjC,MAAM,SAAS,SAAS,OAAO,SAAS,sBAAuB,CAAC,OAAO,QAAQ;CAC/E,OAAO;EACL,MAAM;EACN;EACA,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,MAAM;GAAE,MAAM;GAAM,OAAO,KAAK;EAAsB;EACtD,WAAW;CACb;AACF;;AAGA,SAAgB,SAAS,QAA8B;CACrD,OAAO,SAAS,IAAI,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK,KAAA;AACvD;;AAGA,SAAS,uBAAuB,KAAc,OAAyB;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,OAAO,UAAU,SAAS,QAAQ,QAAQ,QAAQ;AACpD"}

package/build/QueryParser.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"QueryParser.d.cts","names":[],"sources":["../src/QueryParser.ts"],"mappings":";;;;;;UAuBiB;EACf;EACA;EACA,YAAY;;;KAIF,4BAA4B,yBAAyB,kBAAkB,eAAe;UAEjF;EACf;EACA;EACA;EACA;EACA,MAAM;;;;;EAKN;;;UAIe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;UAIe;EACf;;EAEA;;EAEA,UAAU;;EAEV;;UAMe;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;;;;;;;;;;;;;;;;EAsBA;;IAEE;;IAEA;;IAEA;;;;;;;;;;;;;;;;;;;;;UAsBa;EACf;;EAEA;;EAEA;;;;;;;;;;;;;UAce;;EAEf;;EAEA;IAAY;IAAoB;;;EAEhC;IAAS;IAAa;IAAa;;IAA+B;IAAa,OAAO;;;EAEtF;;;;;UAMe;EACf;EACA;;EAEA;;EAEA;;EAEA,OAAO;;EAEP;IAAa;IAAgB;;;KAGnB,cAAc,eAAe,YAAY,iBAAiB;UAErD;EACf;EACA;EACA,OAAO;;KAGG;EAAkB;EAAe;;EAAqB;;KAEtD,wBAAwB;KAC/B;EAA6B;EAAa;EAAiB;;;UAG/C;EACf,SAAS;;EAET,QAAQ;;EAER,YAAY;;EAEZ,WAAW;;EAEX,UAAU;;EAEV,OAAO;;;;;;;;iBASO,eACd,MAAM,gBACN,aACA;EACE,aAAa;EACb;EACA;EACA;EACA;EACA;EACA;IAED;;;;;;;;;;;;iBAqhBa,mBAAmB,OAAO;;iBAgC1B,WAAW;;KAKf,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,MAAM,gBAAgB,cAAc;;iBA+GtD,gBAAgB,MAAM,gBAAgB,eAAe;EAAU;;;;;;;KAcnE,kBAAkB;EACxB;EAAY,OAAO;;EACnB;EAAY,gBAAgB;;EAC5B;EAAa,gBAAgB;;EAC7B;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAY,OAAO;;EACnB;;EACA;;EACA;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAc,OAAO;;EACrB;EAAe,OAAO;;EACtB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAgB,OAAO;;EACvB;EAAiB,OAAO;;EACxB;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAqB,gBAAgB;;EACrC;EAAiB,QAAQ,GAAG;;EAC5B;EAAwB;;EACxB;EAA2B;;;;;;;;iBAQjB,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,gBAAgB,OAAO,iBAAiB,MAAM,gBAAgB;iBAiB9D,iCACd,OAAO,iBACP,MAAM,gBACN,eACA;;;;;;;iBAyEc,oBAAoB,MAAM,gBAAgB;iBAwB1C,uBACd,YAAY,mBACZ,MAAM,gBACN,eACA;iBAcc,kBAAkB,MAAM,gBAAgB;iBASxC,UAAU,OAAO,mBAAmB,cAAc,aAAa,oBAAoB;;iBAiCnF,iBAAiB,MAAM,gBAAgB,gBAAgB;;iBAevD,SAAS"}
+{"version":3,"file":"QueryParser.d.cts","names":[],"sources":["../src/QueryParser.ts"],"mappings":";;;;;;UAyBiB;EACf;EACA;EACA,YAAY;;;KAIF,4BAA4B,yBAAyB,kBAAkB,eAAe;UAEjF;EACf;EACA;EACA;EACA;EACA,MAAM;;;;;EAKN;;;UAIe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;UAIe;EACf;;EAEA;;EAEA,UAAU;;EAEV;;UAMe;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;;;;;;;;;;;;;;;;EAsBA;;IAEE;;IAEA;;IAEA;;;;;;;;;;;;;;;;;;;;;UAsBa;EACf;;EAEA;;EAEA;;;;;;;;;;;;;UAce;;EAEf;;EAEA;IAAY;IAAoB;;;EAEhC;IAAS;IAAa;IAAa;;IAA+B;IAAa,OAAO;;;EAEtF;;;;;UAMe;EACf;EACA;;EAEA;;EAEA;;EAEA,OAAO;;EAEP;IAAa;IAAgB;;;KAGnB,cAAc,eAAe,YAAY,iBAAiB;UAErD;EACf;EACA;EACA,OAAO;;KAGG;EAAkB;EAAe;;EAAqB;;KAEtD,wBAAwB;KAC/B;EAA6B;EAAa;EAAiB;;;UAG/C;EACf,SAAS;;EAET,QAAQ;;EAER,YAAY;;EAEZ,WAAW;;EAEX,UAAU;;EAEV,OAAO;;;;;;;;iBASO,eACd,MAAM,gBACN,aACA;EACE,aAAa;EACb;EACA;EACA;EACA;EACA;EACA;IAED;;;;;;;;;;;;iBAwhBa,mBAAmB,OAAO;;iBAgC1B,WAAW;;KAKf,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,MAAM,gBAAgB,cAAc;;iBA+GtD,gBAAgB,MAAM,gBAAgB,eAAe;EAAU;;;;;;;KAcnE,kBAAkB;EACxB;EAAY,OAAO;;EACnB;EAAY,gBAAgB;;EAC5B;EAAa,gBAAgB;;EAC7B;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAY,OAAO;;EACnB;;EACA;;EACA;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAc,OAAO;;EACrB;EAAe,OAAO;;EACtB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAgB,OAAO;;EACvB;EAAiB,OAAO;;EACxB;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAqB,gBAAgB;;EACrC;EAAiB,QAAQ,GAAG;;EAC5B;EAAwB;;EACxB;EAA2B;;;;;;;;iBAQjB,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,gBAAgB,OAAO,iBAAiB,MAAM,gBAAgB;iBAiB9D,iCACd,OAAO,iBACP,MAAM,gBACN,eACA;;;;;;;iBAyEc,oBAAoB,MAAM,gBAAgB;iBAqC1C,uBACd,YAAY,mBACZ,MAAM,gBACN,eACA;iBAcc,kBAAkB,MAAM,gBAAgB;iBASxC,UAAU,OAAO,mBAAmB,cAAc,aAAa,oBAAoB;;iBAiCnF,iBAAiB,MAAM,gBAAgB,gBAAgB;;iBAevD,SAAS"}

package/build/QueryParser.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"QueryParser.d.mts","names":[],"sources":["../src/QueryParser.ts"],"mappings":";;;;;;UAuBiB;EACf;EACA;EACA,YAAY;;;KAIF,4BAA4B,yBAAyB,kBAAkB,eAAe;UAEjF;EACf;EACA;EACA;EACA;EACA,MAAM;;;;;EAKN;;;UAIe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;UAIe;EACf;;EAEA;;EAEA,UAAU;;EAEV;;UAMe;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;;;;;;;;;;;;;;;;EAsBA;;IAEE;;IAEA;;IAEA;;;;;;;;;;;;;;;;;;;;;UAsBa;EACf;;EAEA;;EAEA;;;;;;;;;;;;;UAce;;EAEf;;EAEA;IAAY;IAAoB;;;EAEhC;IAAS;IAAa;IAAa;;IAA+B;IAAa,OAAO;;;EAEtF;;;;;UAMe;EACf;EACA;;EAEA;;EAEA;;EAEA,OAAO;;EAEP;IAAa;IAAgB;;;KAGnB,cAAc,eAAe,YAAY,iBAAiB;UAErD;EACf;EACA;EACA,OAAO;;KAGG;EAAkB;EAAe;;EAAqB;;KAEtD,wBAAwB;KAC/B;EAA6B;EAAa;EAAiB;;;UAG/C;EACf,SAAS;;EAET,QAAQ;;EAER,YAAY;;EAEZ,WAAW;;EAEX,UAAU;;EAEV,OAAO;;;;;;;;iBASO,eACd,MAAM,gBACN,aACA;EACE,aAAa;EACb;EACA;EACA;EACA;EACA;EACA;IAED;;;;;;;;;;;;iBAqhBa,mBAAmB,OAAO;;iBAgC1B,WAAW;;KAKf,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,MAAM,gBAAgB,cAAc;;iBA+GtD,gBAAgB,MAAM,gBAAgB,eAAe;EAAU;;;;;;;KAcnE,kBAAkB;EACxB;EAAY,OAAO;;EACnB;EAAY,gBAAgB;;EAC5B;EAAa,gBAAgB;;EAC7B;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAY,OAAO;;EACnB;;EACA;;EACA;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAc,OAAO;;EACrB;EAAe,OAAO;;EACtB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAgB,OAAO;;EACvB;EAAiB,OAAO;;EACxB;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAqB,gBAAgB;;EACrC;EAAiB,QAAQ,GAAG;;EAC5B;EAAwB;;EACxB;EAA2B;;;;;;;;iBAQjB,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,gBAAgB,OAAO,iBAAiB,MAAM,gBAAgB;iBAiB9D,iCACd,OAAO,iBACP,MAAM,gBACN,eACA;;;;;;;iBAyEc,oBAAoB,MAAM,gBAAgB;iBAwB1C,uBACd,YAAY,mBACZ,MAAM,gBACN,eACA;iBAcc,kBAAkB,MAAM,gBAAgB;iBASxC,UAAU,OAAO,mBAAmB,cAAc,aAAa,oBAAoB;;iBAiCnF,iBAAiB,MAAM,gBAAgB,gBAAgB;;iBAevD,SAAS"}
+{"version":3,"file":"QueryParser.d.mts","names":[],"sources":["../src/QueryParser.ts"],"mappings":";;;;;;UAyBiB;EACf;EACA;EACA,YAAY;;;KAIF,4BAA4B,yBAAyB,kBAAkB,eAAe;UAEjF;EACf;EACA;EACA;EACA;EACA,MAAM;;;;;EAKN;;;UAIe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;UAIe;EACf;;EAEA;;EAEA,UAAU;;EAEV;;UAMe;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;;;;;;;;;;;;;;;;EAsBA;;IAEE;;IAEA;;IAEA;;;;;;;;;;;;;;;;;;;;;UAsBa;EACf;;EAEA;;EAEA;;;;;;;;;;;;;UAce;;EAEf;;EAEA;IAAY;IAAoB;;;EAEhC;IAAS;IAAa;IAAa;;IAA+B;IAAa,OAAO;;;EAEtF;;;;;UAMe;EACf;EACA;;EAEA;;EAEA;;EAEA,OAAO;;EAEP;IAAa;IAAgB;;;KAGnB,cAAc,eAAe,YAAY,iBAAiB;UAErD;EACf;EACA;EACA,OAAO;;KAGG;EAAkB;EAAe;;EAAqB;;KAEtD,wBAAwB;KAC/B;EAA6B;EAAa;EAAiB;;;UAG/C;EACf,SAAS;;EAET,QAAQ;;EAER,YAAY;;EAEZ,WAAW;;EAEX,UAAU;;EAEV,OAAO;;;;;;;;iBASO,eACd,MAAM,gBACN,aACA;EACE,aAAa;EACb;EACA;EACA;EACA;EACA;EACA;IAED;;;;;;;;;;;;iBAwhBa,mBAAmB,OAAO;;iBAgC1B,WAAW;;KAKf,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,MAAM,gBAAgB,cAAc;;iBA+GtD,gBAAgB,MAAM,gBAAgB,eAAe;EAAU;;;;;;;KAcnE,kBAAkB;EACxB;EAAY,OAAO;;EACnB;EAAY,gBAAgB;;EAC5B;EAAa,gBAAgB;;EAC7B;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAY,OAAO;;EACnB;;EACA;;EACA;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAc,OAAO;;EACrB;EAAe,OAAO;;EACtB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAgB,OAAO;;EACvB;EAAiB,OAAO;;EACxB;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAqB,gBAAgB;;EACrC;EAAiB,QAAQ,GAAG;;EAC5B;EAAwB;;EACxB;EAA2B;;;;;;;;iBAQjB,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,gBAAgB,OAAO,iBAAiB,MAAM,gBAAgB;iBAiB9D,iCACd,OAAO,iBACP,MAAM,gBACN,eACA;;;;;;;iBAyEc,oBAAoB,MAAM,gBAAgB;iBAqC1C,uBACd,YAAY,mBACZ,MAAM,gBACN,eACA;iBAcc,kBAAkB,MAAM,gBAAgB;iBASxC,UAAU,OAAO,mBAAmB,cAAc,aAAa,oBAAoB;;iBAiCnF,iBAAiB,MAAM,gBAAgB,gBAAgB;;iBAevD,SAAS"}

package/build/QueryParser.js

@@ -1,9 +1,11 @@
+import { predicateBrand } from "./conditions.js";
 import { isScope, isScopeJoinFilter, resolveScope } from "./scopes.js";
 import "./EntityFilter.js";
 import { kq, kqDot } from "./keywords.js";
 import { keyToNumber, maybeResolveReferenceToId } from "./keys.js";
 import { getBaseMeta } from "./EntityMetadata.js";
 import { abbreviation, assertNever, fail } from "./utils.js";
+import { isDeferredCondition } from "./Expr.js";
 import { ConditionBuilder } from "./ConditionBuilder.js";
 import { pruneUnusedJoins } from "./QueryParser.pruning.js";
 import { visitConditions } from "./QueryVisitor.js";
@@ -133,9 +135,11 @@ function parseFindQuery(meta, filter, opts = {}) {
 			});
 			if (isScopeJoinFilter(result)) {
 				addFilterAt(meta, tableAlias, result.where, targetCb, void 0, parentJoin);
+				checkDomainCondition(result.conditions);
 				targetCb.maybeAddExpression(result.conditions);
 			} else {
 				const conditions = Array.isArray(result) ? result : [result];
+				for (const condition of conditions) checkDomainCondition(condition);
 				if (conditions.length > 0) targetCb.maybeAddExpression({ and: conditions });
 			}
 		}
@@ -380,7 +384,10 @@ function parseFindQuery(meta, filter, opts = {}) {
 	if (meta.hasLazyColumns) selects.push(...lazyExcludedSelects(meta, alias$1));
 	else selects.push(`${kq(alias$1)}.*`);
 	addTable(meta, alias$1, "primary", "n/a", "n/a", filter);
-	if (optsExpression) cb.maybeAddExpression(optsExpression);
+	if (optsExpression) {
+		checkDomainCondition(optsExpression);
+		cb.maybeAddExpression(optsExpression);
+	}
 	Object.assign(query, { condition: cb.toExpressionFilter() });
 	resolveAliasConditions(query, aliasBindings);
 	if (query.tables.some((t) => t.join === "outer")) maybeAddIdNotNulls(query);
@@ -727,6 +734,13 @@ function lazyExcludedSelects(meta, alias) {
 	}
 	return selects;
 }
+/** Rejects SQL predicates throughout a domain condition tree before optional-filter pruning. */
+function checkDomainCondition(condition) {
+	if (!condition) return;
+	if (isDeferredCondition(condition) || predicateBrand in condition && condition[predicateBrand] === "sql") fail("SQL predicates are only supported by em.query/em.execute; use alias(...) predicates in em.find and scopes.");
+	if ("and" in condition && condition.and) for (const child of condition.and) checkDomainCondition(child);
+	else if ("or" in condition && condition.or) for (const child of condition.or) checkDomainCondition(child);
+}
 /** Resolves every `DeferredAliasCondition` in `query` against the parse's alias bindings. */
 function resolveAliasConditions(query, bindings) {
 	function resolve(handle) {