turbine-orm 0.50.0 → 0.51.0

package/dist/cjs/query/relations.js

@@ -106,7 +106,7 @@ function resolveColumns(qi, select, omit, includePii) {
     if (select) {
         // An array here means a caller wrote `select: ['id', 'name']` (Drizzle/SQL
         // style) instead of the object shape. Object.entries() would iterate the
-        // numeric indices and throw a cryptic `Unknown field "0"` — catch it early
+        // numeric indices and throw a cryptic `Unknown field "0"`, catch it early
         // with an actionable message.
         if (Array.isArray(select)) {
             throw new errors_js_1.ValidationError(`[turbine] "select" must be an object mapping field names to true ` +
@@ -156,7 +156,7 @@ function withFingerprint(qi, withClause, table, depth = 0) {
         const spec = withClause[relName];
         if (!spec)
             continue;
-        // Reserved `_count` key — fingerprint by the selected relation set so
+        // Reserved `_count` key, fingerprint by the selected relation set so
         // `_count: true` and `_count: { posts: true }` never share a cache entry.
         if (relName === '_count') {
             const c = spec;
@@ -242,7 +242,7 @@ function collectWithParams(qi, withClause, params, table, flattenPlan) {
         }
         collectRelationSubqueryParams(qi, relDef, relSpec, params, table ?? qi.table);
     }
-    // `_count` global-filter params — mirror buildSelectWithRelations, which
+    // `_count` global-filter params, mirror buildSelectWithRelations, which
     // appends the count subqueries (and any target-filter params) AFTER every
     // relation subquery, in resolveCountRelations order.
     const countSpec = withClause._count;
@@ -312,14 +312,14 @@ function collectRelationSubqueryParams(qi, relDef, spec, params, _parentRef, dep
     if (nativeOrderPath && hasOrder) {
         collectRelationOrderParams(qi, targetTable, targetMeta, relOrderEntries, params);
     }
-    // where params — mirrors buildAliasWhere push order
+    // where params, mirrors buildAliasWhere push order
     if (spec.where) {
         whereMod.collectAliasWhereParams(qi, targetTable, targetMeta, spec.where, params);
     }
-    // Global filter on the target — mirrors targetGlobalFilterAlias in
+    // Global filter on the target, mirrors targetGlobalFilterAlias in
     // buildRelationSubquery (pushed after spec.where, before limit).
     whereMod.collectTargetGlobalFilterAlias(qi, targetTable, params);
-    // limit param — only hasMany parameterizes its limit (mirrors
+    // limit param, only hasMany parameterizes its limit (mirrors
     // buildRelationSubquery). belongsTo/hasOne ignore limit (always LIMIT 1), so
     // pushing one here would orphan a param and desync the collect path.
     // `limit: 0` pushes (LIMIT 0 is honored), so check !== undefined.
@@ -340,7 +340,7 @@ function collectRelationSubqueryParams(qi, relDef, spec, params, _parentRef, dep
  * Value-shape fingerprint for a single orderBy entry, so two queries whose
  * ORDER BY differs only in nulls placement, vector metric, or relation-count
  * vs relation-column never collide on one cached SQL string. Captures the
- * SQL-shaping bits (direction, nulls, metric, relation keys) — never values.
+ * SQL-shaping bits (direction, nulls, metric, relation keys), never values.
  */
 function orderByEntryFingerprint(qi, d, targetTable) {
     // Vector KNN ordering changes the emitted operator by metric and adds a
@@ -386,7 +386,7 @@ function orderByEntryFingerprint(qi, d, targetTable) {
         // emits one ORDER BY term per entry in Object.entries order, so entry
         // order is SQL-shaping precedence. A sorted fingerprint made
         // `{ name: 'asc', email: 'desc' }` and the swapped literal share one
-        // cached SQL string — silently mis-ordered results on a warm cache.
+        // cached SQL string, silently mis-ordered results on a warm cache.
         return `rel(${Object.entries(d)
             .map(([k, v]) => `${k}=${orderByEntryFingerprint(qi, v)}`)
             .join(',')})`;
@@ -438,7 +438,7 @@ function buildOrderBy(qi, orderBy, params, lateralSink) {
         if (isRelationOrderByValue(qi, value)) {
             return buildRelationOrderBy(qi, key, value, `ord${relOrdCounter++}`, params, undefined, lateralSink);
         }
-        // Scalar column ordering — a plain direction or an OrderBySpec (nulls).
+        // Scalar column ordering, a plain direction or an OrderBySpec (nulls).
         if (meta && !(key in meta.columnMap)) {
             throw new errors_js_1.ValidationError(`[turbine] Unknown field "${key}" in orderBy on table "${qi.table}". ` +
                 `Known fields: ${Object.keys(meta.columnMap).join(', ') || '(none)'}.`);
@@ -463,7 +463,7 @@ function isRelationOrderByValue(_qi, value) {
 }
 /**
  * Render the ` NULLS FIRST` / ` NULLS LAST` suffix for a column ordering.
- * Only PostgreSQL and SQLite support the `NULLS FIRST/LAST` grammar — on any
+ * Only PostgreSQL and SQLite support the `NULLS FIRST/LAST` grammar, on any
  * other engine a caller asking for explicit nulls placement gets a clear
  * {@link UnsupportedFeatureError} (E017) instead of broken SQL.
  */
@@ -543,6 +543,100 @@ function buildJsonPathOrderEntry(qi, table, meta, field, spec, prefix, params) {
             : '';
     return `${lhs} ${dir}${nullsSql}`;
 }
+/**
+ * Order by a column reached through TWO OR MORE to-one relation hops, e.g.
+ * `orderBy: { model: { category: { name: 'asc' } } }`.
+ *
+ * One hop already compiled to a correlated scalar subquery; each additional
+ * hop is added to that same subquery as an INNER JOIN, so the whole chain is
+ * one subquery with one `LIMIT 1` regardless of depth:
+ *
+ *   (SELECT t1."name"
+ *      FROM "models" t0
+ *      JOIN "categories" t1 ON t1."id" = t0."category_id"
+ *     WHERE t0."id" = "versions"."model_id"
+ *     LIMIT 1) ASC
+ *
+ * Every hop must be to-one. A to-many hop has no single value to order by, so
+ * it is refused rather than silently picking an arbitrary row (`{ pick, by }`
+ * exists for that, deliberately, because it forces the caller to say WHICH
+ * row). Each hop's target global filter is applied to its join condition, so
+ * ordering never keys off a soft-deleted or other-tenant row.
+ */
+function buildChainedToOneOrderBy(qi, head, nextRelName, nextValue, params) {
+    const joins = [];
+    let currentMeta = qi.schema.tables[head.relDef.to];
+    let currentAlias = head.alias;
+    let hop = 0;
+    let relName = nextRelName;
+    let value = nextValue;
+    const path = [head.relName];
+    // Walk the chain, emitting one JOIN per hop, until the value stops being a
+    // relation object. Bounded by the same depth cap as nested `with`.
+    for (;;) {
+        if (!currentMeta)
+            throw new errors_js_1.RelationError(`[turbine] Unknown relation target in orderBy chain "${path.join('.')}"`);
+        const relDef = (0, utils_js_1.ownLookup)(currentMeta.relations, relName);
+        if (!relDef) {
+            throw new errors_js_1.ValidationError(`[turbine] Unknown relation "${relName}" in orderBy on relation "${path.join('.')}" ` +
+                `(table "${currentMeta.name}"). Available: ${Object.keys(currentMeta.relations).join(', ') || '(none)'}.`);
+        }
+        if (relDef.type !== 'belongsTo' && relDef.type !== 'hasOne') {
+            throw new errors_js_1.ValidationError(`[turbine] orderBy cannot traverse the to-many relation "${relName}" on "${currentMeta.name}" ` +
+                `(path "${path.concat(relName).join('.')}"): a to-many relation has no single value to order by. ` +
+                `Use a pick-row ordering ({ pick, by }) at the top level, or order by "_count".`);
+        }
+        if (++hop > MAX_ORDER_BY_RELATION_HOPS) {
+            throw new errors_js_1.CircularRelationError(path.concat(relName));
+        }
+        const nextMeta = qi.schema.tables[relDef.to];
+        if (!nextMeta)
+            throw new errors_js_1.RelationError(`[turbine] Unknown relation target "${relDef.to}" in orderBy`);
+        const nextAlias = `${head.alias}c${hop}`;
+        const on = relDef.type === 'belongsTo'
+            ? qi.dialect.buildCorrelation(nextAlias, relDef.referenceKey, currentAlias, relDef.foreignKey)
+            : qi.dialect.buildCorrelation(nextAlias, relDef.foreignKey, currentAlias, relDef.referenceKey);
+        let onSql = on;
+        if (params) {
+            const gf = whereMod.targetGlobalFilterAlias(qi, relDef.to, nextAlias, params);
+            if (gf)
+                onSql += ` AND ${gf}`;
+        }
+        joins.push(`JOIN ${qi.q(relDef.to)} ${nextAlias} ON ${onSql}`);
+        path.push(relName);
+        currentMeta = nextMeta;
+        currentAlias = nextAlias;
+        // Exactly one key per level, as with the single-hop form.
+        const entries = Object.entries(value);
+        if (entries.length !== 1) {
+            throw new errors_js_1.ValidationError(`[turbine] orderBy on relation "${path.join('.')}" needs exactly one key per level ` +
+                `(got: ${entries.map(([k]) => k).join(', ') || '(empty)'}).`);
+        }
+        const [key, entryValue] = entries[0];
+        if ((0, utils_js_1.ownLookup)(currentMeta.relations, key) && isRelationOrderByValue(qi, entryValue)) {
+            relName = key;
+            value = entryValue;
+            continue;
+        }
+        // Terminal: a column on the last table in the chain.
+        const snakeCol = (0, utils_js_1.ownLookup)(currentMeta.columnMap, key) ?? (0, schema_js_1.camelToSnake)(key);
+        if (!currentMeta.allColumns.includes(snakeCol)) {
+            throw new errors_js_1.ValidationError(`[turbine] Unknown column "${key}" in orderBy on relation "${path.join('.')}" (table "${currentMeta.name}").`);
+        }
+        const { dir, nulls } = (0, filters_js_1.normalizeOrderBy)(entryValue);
+        let where = head.correlation;
+        if (params) {
+            const gf = whereMod.targetGlobalFilterAlias(qi, head.relDef.to, head.alias, params);
+            if (gf)
+                where += ` AND ${gf}`;
+        }
+        const from = `${qi.q(head.relDef.to)} ${head.alias} ${joins.join(' ')}`;
+        return (`(SELECT ${currentAlias}.${qi.q(snakeCol)} FROM ${from} WHERE ${where}${qi.limitOneClause()}) ` +
+            `${dir}${nullsSuffix(qi, nulls)}`);
+    }
+}
+/** Depth cap for a chained relation orderBy, mirroring the nested-`with` cap. */
+const MAX_ORDER_BY_RELATION_HOPS = 10;
 /**
  * Compile a relation ordering term. For a to-many relation the only allowed
  * key is `_count`, which becomes a correlated `COUNT(*)` subquery. For a
@@ -610,14 +704,26 @@ function buildRelationOrderBy(qi, relName, value, alias, params, ctx, lateralSin
     }
     return entries
         .map(([col, dirValue]) => {
+        // A nested relation: `orderBy: { model: { category: { name: 'asc' } } }`.
+        // Each further to-one hop becomes a JOIN inside the SAME correlated
+        // subquery rather than another level of nesting, so an N-hop chain still
+        // costs one subquery.
+        const nestedRel = (0, utils_js_1.ownLookup)(targetMeta.relations, col);
+        if (nestedRel && isRelationOrderByValue(qi, dirValue)) {
+            return buildChainedToOneOrderBy(qi, { relName, relDef, alias, correlation }, col, dirValue, params);
+        }
         // columnMap-first resolution (camelToSnake fallback): mirrors the
         // scalar orderBy path so camelCase-named DB columns resolve here too.
         const snakeCol = (0, utils_js_1.ownLookup)(targetMeta.columnMap, col) ?? (0, schema_js_1.camelToSnake)(col);
         if (!targetMeta.allColumns.includes(snakeCol)) {
-            throw new errors_js_1.ValidationError(`[turbine] Unknown column "${col}" in orderBy on relation "${relName}" (table "${relDef.to}").`);
+            const relationHint = (0, utils_js_1.ownLookup)(targetMeta.relations, col)
+                ? ` "${col}" is a relation on "${relDef.to}": order by one of ITS columns, e.g. ` +
+                    `{ ${relName}: { ${col}: { <column>: 'asc' } } }.`
+                : '';
+            throw new errors_js_1.ValidationError(`[turbine] Unknown column "${col}" in orderBy on relation "${relName}" (table "${relDef.to}").${relationHint}`);
         }
         const { dir, nulls } = (0, filters_js_1.normalizeOrderBy)(dirValue);
-        // Target's global filter applies here too — otherwise ordering keys off
+        // Target's global filter applies here too, otherwise ordering keys off
         // a soft-deleted / other-tenant related row's value (matches the with
         // subquery semantics for belongsTo/hasOne).
         let where = correlation;
@@ -974,7 +1080,7 @@ function collectManyToManyTargetGlobalFilter(qi, relDef, params) {
 /**
  * Param-collect mirror of {@link buildRelationCountExpr}'s global-filter
  * params (hasMany direct filter, or manyToMany EXISTS-on-target). Only pushes
- * when a filter applies — no-op otherwise.
+ * when a filter applies, no-op otherwise.
  */
 function collectRelationCountParams(qi, relDef, params) {
     if (relDef.type === 'manyToMany') {
@@ -1128,7 +1234,7 @@ function buildJsonRow(qi, jsonPairs) {
 // `json_build_object` renders a handful of Postgres types as something other
 // than the value the driver hands back for the same column, so the 'join'
 // strategy used to disagree with a top-level read, with 'batched', and with
-// 'flatten' — losing precision outright on numeric and int8. The two halves of
+// 'flatten', losing precision outright on numeric and int8. The two halves of
 // the fix live here and must stay in lockstep:
 //
 //   SQL side   jsonScalarPairs() emits `alias."col"::text` for a divergent
@@ -1141,9 +1247,17 @@ function buildJsonRow(qi, jsonPairs) {
 // decode (or vice versa). Postgres-only: other engines neither use
 // json_build_object nor share this divergence set.
 // ---------------------------------------------------------------------------
-/** True when this query's engine gets the JSON-wire cast/decode treatment. */
-function usesJsonWireCoercion(qi) {
-    return qi.dialect.name === 'postgresql';
+/**
+ * The JSON-wire rule for one column, or undefined when its JSON rendering
+ * already matches the driver. Routed entirely through the dialect, so each
+ * engine states its own divergence set (see {@link Dialect.jsonWireRule}); a
+ * dialect that omits the hook keeps the pre-0.51 no-cast behavior.
+ */
+function jsonWireRuleFor(qi, meta, col) {
+    const type = meta.pgTypes?.[col];
+    if (!type)
+        return undefined;
+    return qi.dialect.jsonWireRule?.(type);
 }
 /**
  * The JSON value expression for one scalar relation column: the plain column
@@ -1152,9 +1266,7 @@ function usesJsonWireCoercion(qi) {
  */
 function jsonScalarExpr(qi, targetMeta, col, ref) {
     const expr = `${ref}.${qi.q(col)}`;
-    if (!usesJsonWireCoercion(qi))
-        return expr;
-    return (0, utils_js_1.jsonWireCoercionOid)(targetMeta.pgTypes?.[col]) === undefined ? expr : `${expr}::text`;
+    return jsonWireRuleFor(qi, targetMeta, col)?.sql(expr) ?? expr;
 }
 /**
  * The `[camelKey, valueExpr]` pairs for a relation's scalar columns. Single
@@ -1188,16 +1300,13 @@ function jsonWireFields(qi, table, meta) {
     if (cached !== undefined)
         return cached;
     let fields = null;
-    const pgTypes = meta.pgTypes;
-    if (pgTypes) {
-        for (const col of meta.allColumns) {
-            const oid = (0, utils_js_1.jsonWireCoercionOid)(pgTypes[col]);
-            if (oid === undefined)
-                continue;
-            if (fields === null)
-                fields = new Map();
-            fields.set(meta.reverseColumnMap[col] ?? (0, schema_js_1.snakeToCamel)(col), oid);
-        }
+    for (const col of meta.allColumns) {
+        const rule = jsonWireRuleFor(qi, meta, col);
+        if (rule === undefined)
+            continue;
+        if (fields === null)
+            fields = new Map();
+        fields.set(meta.reverseColumnMap[col] ?? (0, schema_js_1.snakeToCamel)(col), rule);
     }
     byTable.set(table, fields);
     return fields;
@@ -1208,8 +1317,6 @@ function jsonWireFields(qi, table, meta) {
  * so the ordinary relation pays nothing beyond the memo lookup.
  */
 function decodeJsonWireRow(qi, row, table, meta) {
-    if (!usesJsonWireCoercion(qi))
-        return row;
     const fields = jsonWireFields(qi, table, meta);
     if (fields === null)
         return row;
@@ -1218,13 +1325,13 @@ function decodeJsonWireRow(qi, row, table, meta) {
     // be holding. Measured against an in-place variant on a 20K-child-row join the
     // two were indistinguishable, so the copy is free insurance.
     let decoded;
-    for (const [field, oid] of fields) {
+    for (const [field, rule] of fields) {
         const raw = row[field];
         if (typeof raw !== 'string')
             continue;
         if (decoded === undefined)
             decoded = { ...row };
-        decoded[field] = (0, utils_js_1.coerceJsonWireValue)(oid, raw);
+        decoded[field] = rule.decode(raw);
     }
     return decoded ?? row;
 }
@@ -1293,7 +1400,7 @@ function makeNestedParser(qi, withClause, includePii, flattenPlan) {
 /**
  * Return a shallow copy of a top-level row with each relation column decoded
  * from its positional array(s) into the object representation. Only relation
- * columns are positional — base scalar columns stay object-keyed — so the
+ * columns are positional, base scalar columns stay object-keyed, so the
  * result is exactly what the object encoding would have handed parseNestedRow.
  */
 function decodePositionalRelations(qi, row, shapes) {
@@ -1343,7 +1450,7 @@ function decodePositionalObject(qi, arr, shape) {
     return obj;
 }
 // ---------------------------------------------------------------------------
-// relationLoadStrategy: 'flatten' — to-one relations compiled as LEFT JOINs
+// relationLoadStrategy: 'flatten', to-one relations compiled as LEFT JOINs
 // ---------------------------------------------------------------------------
 /**
  * Alias prefix for a flattened relation's join. Deliberately distinct from the
@@ -1358,7 +1465,7 @@ const FLATTEN_ALIAS_PREFIX = 'f';
  * The top-level `WHERE` and `ORDER BY` reference the parent's columns
  * UNQUALIFIED (`WHERE "name" = $1`). A bare `LEFT JOIN "orgs" f0` puts a second
  * table in scope, so any column name the two tables share ("id", "name",
- * "created_at" — i.e. most of them) turns those references ambiguous and
+ * "created_at", i.e. most of them) turns those references ambiguous and
  * Postgres rejects the statement. Qualifying the parent's references is not an
  * option here: they are compiled by the shared WHERE walk, which is scope-blind
  * by design.
@@ -1461,13 +1568,13 @@ function provableUniqueTargetKey(relDef, targetMeta) {
  *
  * A relation is ELIGIBLE when all of the following hold:
  *   1. it is `belongsTo` or `hasOne` AND its target-side correlation columns are
- *      provably unique ({@link provableUniqueTargetKey}) — the row-multiplication
+ *      provably unique ({@link provableUniqueTargetKey}), the row-multiplication
  *      guard;
  *   2. its spec declares no `limit` and no `orderBy` (both are no-ops over a
  *      single matching row, but refusing them keeps the emitted SQL and the
  *      param stream trivially equivalent);
  *   3. its nested `with` names only real relations and no reserved `_count`
- *      (nested `_count` is unsupported on every strategy — falling back lets the
+ *      (nested `_count` is unsupported on every strategy, falling back lets the
  *      subquery path raise the same error);
  *   4. the depth cap is not reached, so a too-deep chain still raises
  *      {@link CircularRelationError} from the subquery path instead of silently
@@ -1602,7 +1709,7 @@ function warnFlattenFallback(table, rejects) {
  * it emits today, down to the cache key).
  *
  * The plan is a pure function of the schema, the `with` clause shape and
- * `includePii` — never of any bound value — so the build path, the cache-hit
+ * `includePii`, never of any bound value, so the build path, the cache-hit
  * param-collect path and the row assembler can each recompute it and agree.
  */
 function planFlattenWith(qi, table, withClause, includePii) {
@@ -1905,8 +2012,8 @@ function buildSelectWithRelations(qi, table, withClause, params, columnsList, de
     const meta = qi.schema.tables[table];
     if (!meta)
         throw new errors_js_1.ValidationError(`[turbine] Unknown table "${table}"`);
-    // Positional JSON encoding is Postgres-only in v1. Gate here — the single
-    // entry point for every `with` clause — so no engine ever emits the
+    // Positional JSON encoding is Postgres-only in v1. Gate here, the single
+    // entry point for every `with` clause, so no engine ever emits the
     // json_build_array shape its dialect can't produce (and mssql's FOR JSON
     // override path is never reached with positional active).
     if (qi.jsonEncoding === 'positional' && qi.dialect.name !== 'postgresql') {
@@ -2048,7 +2155,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
     const currentDepth = depth ?? 0;
     const currentPath = path ?? [qi.table];
     const targetTable = relDef.to;
-    // Hard depth cap — the `with` clause is a finite JSON structure so users can't
+    // Hard depth cap, the `with` clause is a finite JSON structure so users can't
     // create true infinite recursion, but extremely deep nesting (10+ levels) produces
     // unmanageably large SQL. Back-references (e.g. posts → user → posts) are allowed
     // since they are legitimate queries (Prisma supports the same pattern).
@@ -2073,7 +2180,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
             const miss = (0, index_advisor_js_1.missingIndexForRelation)(qi.schema, relDef);
             if (miss && (0, warn_registry_js_1.shouldWarnOnce)(warn_registry_js_1.WARN_NS.unindexedRelation, warnKey)) {
                 console.warn(`[turbine] Relation "${relDef.name}" on "${relDef.from}" probes ` +
-                    `"${miss.table}"(${miss.columns.join(', ')}) which has no covering index — ` +
+                    `"${miss.table}"(${miss.columns.join(', ')}) which has no covering index, ` +
                     `each parent row scans the full table. Fix: ${miss.createSql}; ` +
                     'or run `npx turbine doctor` for a full report.');
             }
@@ -2117,7 +2224,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
     // Determine if this hasMany will take the wrapped subquery path (LIMIT or ORDER BY).
     // When wrapping, nested relations are built in the wrapped path referencing innerAlias,
     // so we must NOT build them here (they would push orphaned params).
-    // An orderBy with no defined entries (`orderBy: {}`) is treated as absent —
+    // An orderBy with no defined entries (`orderBy: {}`) is treated as absent -
     // it must neither trigger the wrap (dropping nested relations) nor render a
     // dangling `ORDER BY `. `limit: 0` is meaningful (LIMIT 0) and DOES wrap.
     const relOrderEntries = spec !== true && spec.orderBy ? (0, filters_js_1.orderByEntries)(spec.orderBy).filter(([, dir]) => dir !== undefined) : [];
@@ -2128,7 +2235,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
     if (relDef.type === 'manyToMany') {
         return buildManyToManySubquery(qi, relDef, spec, params, parentRef, aliasCounter, currentDepth, currentPath, alias, targetMeta, targetColumns, includePii);
     }
-    // Nested relations — only in the non-wrapped path (wrapped path builds them separately)
+    // Nested relations, only in the non-wrapped path (wrapped path builds them separately)
     if (!willWrap && spec !== true && spec.with) {
         for (const [nestedRelName, nestedSpec] of (0, filters_js_1.sortedEntries)(spec.with)) {
             const nestedRelDef = (0, utils_js_1.ownLookup)(targetMeta.relations, nestedRelName);
@@ -2144,7 +2251,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
         }
     }
     const jsonObj = buildJsonRow(qi, jsonPairs);
-    // Quote parent ref — can be a table name or auto-generated alias
+    // Quote parent ref, can be a table name or auto-generated alias
     const qParent = qi.q(parentRef);
     const qTarget = qi.q(targetTable);
     // Build ORDER BY for json_agg: unified with the top-level orderBy surface
@@ -2155,10 +2262,10 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
     if (relOrderEntries.length > 0) {
         orderClause = buildRelationOrderClause(qi, targetTable, targetMeta, alias, relOrderEntries, params);
     }
-    // Build WHERE — correlate to parent via parentRef (alias or table name).
+    // Build WHERE, correlate to parent via parentRef (alias or table name).
     // For hasMany/hasOne: TARGET has the FK (RelationDef.foreignKey is always
     // the child-side column), so alias.fk = parentRef.pk. hasOne is just
-    // hasMany with a unique FK — treating it like belongsTo here silently
+    // hasMany with a unique FK, treating it like belongsTo here silently
     // correlated the wrong columns (caught dogfooding: uuid = varchar).
     // For belongsTo: SOURCE has the FK, so alias.pk = parentRef.fk (reversed).
     // Supports composite foreign keys (string[]) via buildCorrelation.
@@ -2169,20 +2276,20 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
     else {
         whereClause = qi.dialect.buildCorrelation(alias, relDef.foreignKey, qParent, relDef.referenceKey);
     }
-    // Additional filters — full scalar where surface (equality, null, operator
+    // Additional filters, full scalar where surface (equality, null, operator
     // objects, OR/AND/NOT), properly parameterized against this alias.
     if (spec !== true && spec.where) {
         const extra = whereMod.buildAliasWhere(qi, targetTable, targetMeta, alias, spec.where, params);
         if (extra)
             whereClause += ` AND ${extra}`;
     }
-    // Global filter on the target table (soft-delete / tenancy) — AND-merged so
+    // Global filter on the target table (soft-delete / tenancy), AND-merged so
     // a `with` never surfaces filtered-out child rows. Pushed AFTER spec.where,
     // mirrored by collectRelationSubqueryParams.
     const gfExtra = whereMod.targetGlobalFilterAlias(qi, targetTable, alias, params);
     if (gfExtra)
         whereClause += ` AND ${gfExtra}`;
-    // LIMIT — only meaningful for hasMany. A belongsTo / hasOne subquery returns
+    // LIMIT, only meaningful for hasMany. A belongsTo / hasOne subquery returns
     // a single row (literal `LIMIT 1` below), so a `spec.limit` here must NOT push
     // a parameter: doing so orphans an untyped `$N` that the SQL never references,
     // which Postgres rejects with "could not determine data type of parameter $N"
@@ -2200,7 +2307,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
             // Rewrite: SELECT json_agg(json_build_object(...)) FROM (SELECT * FROM table WHERE ... ORDER BY ... LIMIT N) AS alias
             // Inner SELECT always needs all columns for WHERE/ORDER to work; json_build_object filters later
             const innerSql = `SELECT ${targetMeta.allColumns.map((c) => `${alias}.${qi.q(c)}`).join(', ')} FROM ${qTarget} ${alias} WHERE ${whereClause}${orderClause}${limitClause}`;
-            // For the json_build_object, reference the inner alias — only include resolved columns
+            // For the json_build_object, reference the inner alias, only include resolved columns
             const innerJsonPairs = jsonScalarPairs(qi, targetMeta, targetColumns, innerAlias);
             // Build nested relation subqueries referencing innerAlias
             if (spec !== true && spec.with) {
@@ -2220,7 +2327,7 @@ function buildRelationSubquery(qi, relDef, spec, params, parentRef, aliasCounter
         }
         // Inline ORDER BY only when the dialect's array-agg supports it (PG). For
         // hasMany this path is reached only when there is no orderClause, so the
-        // argument is `undefined` either way — keeping PG output byte-identical.
+        // argument is `undefined` either way, keeping PG output byte-identical.
         const inlineOrder = qi.dialect.aggSupportsInlineOrderBy ? orderClause.trim() || undefined : undefined;
         return `SELECT ${qi.dialect.buildJsonArrayAgg(jsonObj, inlineOrder)} FROM ${qTarget} ${alias} WHERE ${whereClause}`;
     }
@@ -2261,7 +2368,7 @@ function buildManyToManySubquery(qi, relDef, spec, params, parentRef, aliasCount
     // JOIN: junction.targetKey = target.<targetPK>. Composite keys pair positionally.
     const targetKeys = (0, schema_js_1.normalizeKeyColumns)(relDef.through.targetKey);
     // The target PK is the column(s) the junction's targetKey references. An empty
-    // introspected PK means we cannot know what to JOIN on — fail loudly rather than
+    // introspected PK means we cannot know what to JOIN on, fail loudly rather than
     // silently guessing `id` and generating a wrong JOIN.
     if (targetMeta.primaryKey.length === 0) {
         throw new errors_js_1.ValidationError(`[turbine] manyToMany relation "${relDef.name}" targets table "${targetTable}" which has no primary key; ` +
@@ -2293,7 +2400,7 @@ function buildManyToManySubquery(qi, relDef, spec, params, parentRef, aliasCount
     if (relOrderEntries.length > 0) {
         orderClause = buildRelationOrderClause(qi, targetTable, targetMeta, talias, relOrderEntries, params);
     }
-    // Additional WHERE filters on the target — full scalar where surface,
+    // Additional WHERE filters on the target, full scalar where surface,
     // properly parameterized against the target alias.
     if (spec !== true && spec.where) {
         const extra = whereMod.buildAliasWhere(qi, targetTable, targetMeta, talias, spec.where, params);
@@ -2305,7 +2412,7 @@ function buildManyToManySubquery(qi, relDef, spec, params, parentRef, aliasCount
     const gfExtra = whereMod.targetGlobalFilterAlias(qi, targetTable, talias, params);
     if (gfExtra)
         whereClause += ` AND ${gfExtra}`;
-    // LIMIT — `limit: 0` is honored (LIMIT 0 → empty array)
+    // LIMIT, `limit: 0` is honored (LIMIT 0 → empty array)
     let limitClause = '';
     if (spec !== true && spec.limit !== undefined) {
         limitClause = ` LIMIT ${qi.paginationRef(spec.limit, params, 'relation limit')}`;