turbine-orm 0.42.0 → 0.43.0

package/dist/cjs/cli/prisma-resolve.js

@@ -236,6 +236,21 @@ function relationFkColumns(model, field) {
     const fieldsArg = relAttr?.args.find((a) => a.key === 'fields' && a.kind === 'array');
     return fieldsArg?.items?.map((pf) => fieldColumn(model, pf)) ?? null;
 }
+/**
+ * FK columns for an INVERSE relation field (one carrying no `fields: [...]`),
+ * derived by @relation("Name") pairing: the opposing model's same-named field
+ * that owns the FK pins the columns. Returns undefined when there is no
+ * relation name or no named counterpart. This is how Prisma disambiguates two
+ * or more relations to the same target model.
+ */
+function pairedInverseFkColumns(model, field, targetModelName, modelsByName) {
+    const relName = relationNameOf(field);
+    const targetModel = modelsByName.get(targetModelName);
+    if (!relName || !targetModel)
+        return null;
+    const opposing = targetModel.fields.find((f) => f.type === model.name && relationNameOf(f) === relName && (relationFkColumns(targetModel, f)?.length ?? 0) > 0);
+    return opposing ? relationFkColumns(targetModel, opposing) : null;
+}
 function resolveRelation(model, fieldName, targetModelName, isList, modelTable, modelsByName, schema, tableMeta, noDb) {
     const cardinality = isList ? 'many' : 'one';
     const base = {
@@ -261,15 +276,7 @@ function resolveRelation(model, fieldName, targetModelName, isList, modelTable,
     // fall back to the ambiguity handling below when there is no relation name or
     // the named pair cannot be found.
     if (!fkColumns || fkColumns.length === 0) {
-        const relName = relationNameOf(field);
-        const targetModel = modelsByName.get(targetModelName);
-        if (relName && targetModel) {
-            const opposing = targetModel.fields.find((f) => f.type === model.name &&
-                relationNameOf(f) === relName &&
-                (relationFkColumns(targetModel, f)?.length ?? 0) > 0);
-            if (opposing)
-                fkColumns = relationFkColumns(targetModel, opposing);
-        }
+        fkColumns = pairedInverseFkColumns(model, field, targetModelName, modelsByName);
     }
     const candidates = Object.values(tableMeta.relations).filter((def) => {
         if (targetTable && def.to !== targetTable)
@@ -299,6 +306,36 @@ function resolveRelation(model, fieldName, targetModelName, isList, modelTable,
         };
     }
     if (picked.length > 1) {
+        // Elimination pass: an UNNAMED pair can still resolve when every sibling
+        // relation field to the same target pins a different candidate (via its own
+        // `fields: [...]` or @relation("Name") pairing). Subtract those consumed
+        // candidates; exactly one survivor means the unnamed pair is unambiguous by
+        // elimination, which is how Prisma itself resolves it.
+        const consumed = new Set();
+        for (const sibling of model.fields) {
+            if (sibling.name === fieldName || sibling.type !== targetModelName)
+                continue;
+            const sibFks = relationFkColumns(model, sibling) ?? pairedInverseFkColumns(model, sibling, targetModelName, modelsByName);
+            if (!sibFks || sibFks.length === 0)
+                continue;
+            const sibWant = [...sibFks].sort().join(',');
+            for (const def of candidates) {
+                const fk = Array.isArray(def.foreignKey) ? def.foreignKey : [def.foreignKey];
+                if ([...fk].sort().join(',') === sibWant)
+                    consumed.add(def.name);
+            }
+        }
+        const surviving = picked.filter((def) => !consumed.has(def.name));
+        if (surviving.length === 1) {
+            const def = surviving[0];
+            return {
+                ...base,
+                turbineName: def.name,
+                cardinality,
+                junction: def.type === 'manyToMany' ? def.through?.table : undefined,
+                status: 'resolved',
+            };
+        }
         return {
             ...base,
             reason: `ambiguous - ${picked.length} candidate relations match (${picked.map((d) => d.name).join(', ')})`,

package/dist/cjs/client.js

@@ -412,9 +412,9 @@ class TurbineClient {
         }
         else {
             const poolConfig = {
-                max: config.poolSize ?? 10,
-                idleTimeoutMillis: config.idleTimeoutMs ?? 30_000,
-                connectionTimeoutMillis: config.connectionTimeoutMs ?? 5_000,
+                max: config.poolSize ?? config.max ?? 10,
+                idleTimeoutMillis: config.idleTimeoutMs ?? config.idleTimeoutMillis ?? 30_000,
+                connectionTimeoutMillis: config.connectionTimeoutMs ?? config.connectionTimeoutMillis ?? 5_000,
             };
             // Did the caller supply ANY explicit connection target? If not, and a
             // DATABASE_URL is present in the environment, fall back to it so
@@ -463,9 +463,9 @@ class TurbineClient {
             if (typeof replica === 'string') {
                 const replicaPool = new pg_1.default.Pool({
                     connectionString: replica,
-                    max: config.poolSize ?? 10,
-                    idleTimeoutMillis: config.idleTimeoutMs ?? 30_000,
-                    connectionTimeoutMillis: config.connectionTimeoutMs ?? 5_000,
+                    max: config.poolSize ?? config.max ?? 10,
+                    idleTimeoutMillis: config.idleTimeoutMs ?? config.idleTimeoutMillis ?? 30_000,
+                    connectionTimeoutMillis: config.connectionTimeoutMs ?? config.connectionTimeoutMillis ?? 5_000,
                     ...(config.ssl !== undefined ? { ssl: config.ssl } : {}),
                 });
                 replicaPool.on('error', (err) => {

package/dist/cjs/prisma-compat.js

@@ -151,7 +151,16 @@ function decorate(err, prismaErrorCodes) {
     }
     return err;
 }
-function buildLookups(mm) {
+const TIME_PG_TYPES = new Set(['time', 'time without time zone', 'timetz', 'time with time zone']);
+/** `HH:MM:SS(.fff)?` (a pg `time` wire value) → Prisma's epoch-day `Date`. */
+function timeStringToDate(v) {
+    const m = v.match(/^(\d{2}):(\d{2}):(\d{2})(?:\.(\d{1,6}))?$/);
+    if (!m)
+        return null;
+    const ms = m[4] ? Math.round(Number(`0.${m[4]}`) * 1000) : 0;
+    return new Date(Date.UTC(1970, 0, 1, Number(m[1]), Number(m[2]), Number(m[3]), ms));
+}
+function buildLookups(ctx, mm) {
     const reverseFields = {};
     let identityFields = true;
     for (const [prismaField, turbineField] of Object.entries(mm.fields)) {
@@ -163,12 +172,17 @@ function buildLookups(mm) {
     for (const [prismaRel, rel] of Object.entries(mm.relations)) {
         reverseRelations[rel.name] = { prismaName: prismaRel, cardinality: rel.cardinality };
     }
-    return { reverseFields, identityFields, reverseRelations };
+    const timeFields = new Set();
+    for (const col of ctx.schema.tables[mm.table]?.columns ?? []) {
+        if (TIME_PG_TYPES.has(col.pgType))
+            timeFields.add(col.field);
+    }
+    return { reverseFields, identityFields, reverseRelations, timeFields };
 }
 function lookupsFor(ctx, mm) {
     let l = ctx.lookups.get(mm.table);
     if (!l) {
-        l = buildLookups(mm);
+        l = buildLookups(ctx, mm);
         ctx.lookups.set(mm.table, l);
     }
     return l;
@@ -724,7 +738,11 @@ function reshapeRow(ctx, mm, row) {
             out[rel.prismaName] = rv;
             continue;
         }
-        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = val;
+        let sv = val;
+        if (typeof sv === 'string' && l.timeFields.has(key)) {
+            sv = timeStringToDate(sv) ?? sv;
+        }
+        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = sv;
     }
     return out;
 }
@@ -756,7 +774,11 @@ function reshapeAggregate(ctx, mm, res) {
             out[key] = reshapeAggFieldBlock(l, val, false);
             continue;
         }
-        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = val;
+        let sv = val;
+        if (typeof sv === 'string' && l.timeFields.has(key)) {
+            sv = timeStringToDate(sv) ?? sv;
+        }
+        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = sv;
     }
     return out;
 }
@@ -788,7 +810,11 @@ function reshapeGroupRow(ctx, mm, row) {
             out[key] = reshapeAggFieldBlock(l, val, false);
             continue;
         }
-        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = val;
+        let sv = val;
+        if (typeof sv === 'string' && l.timeFields.has(key)) {
+            sv = timeStringToDate(sv) ?? sv;
+        }
+        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = sv;
     }
     return out;
 }

package/dist/cjs/query/where.js

@@ -868,7 +868,44 @@ function buildRelationFilter(qi, _relName, relDef, filterObj, params, parentTabl
     const clauses = [];
     // Correlation: link child table to parent table (supports composite FKs)
     let correlation;
-    if (relDef.type === 'hasMany' || relDef.type === 'hasOne') {
+    if (relDef.type === 'manyToMany') {
+        // The target row is related iff a junction row links it to the parent.
+        // Direct FK correlation (the other branches) would compile target.pk =
+        // parent.pk and silently match nothing, so route through the junction:
+        //   EXISTS (SELECT 1 FROM junction
+        //           WHERE junction.targetKey = target.pk AND junction.sourceKey = parent.ref)
+        // All bare table names (no aliases), so the scoped sub-where machinery and
+        // nested relation filters inside the branch keep their qualification. The
+        // fragment binds no params, so collectRelationFilterParams needs no mirror.
+        if (!relDef.through) {
+            throw new errors_js_1.ValidationError(`[turbine] manyToMany relation "${relDef.name}" is missing a \`through\` junction descriptor.`);
+        }
+        const qJunction = qi.q(relDef.through.table);
+        const targetKeys = (0, schema_js_1.normalizeKeyColumns)(relDef.through.targetKey);
+        const targetPk = targetMeta.primaryKey;
+        if (targetPk.length === 0) {
+            throw new errors_js_1.ValidationError(`[turbine] manyToMany relation "${relDef.name}" targets table "${targetTable}" which has no primary key; ` +
+                `cannot correlate the relation filter through the junction.`);
+        }
+        if (targetKeys.length !== targetPk.length) {
+            throw new errors_js_1.ValidationError(`[turbine] manyToMany relation "${relDef.name}": through.targetKey has ${targetKeys.length} column(s) ` +
+                `but target "${targetTable}" primary key has ${targetPk.length}. Composite keys must pair positionally.`);
+        }
+        const sourceKeys = (0, schema_js_1.normalizeKeyColumns)(relDef.through.sourceKey);
+        const refKeys = (0, schema_js_1.normalizeKeyColumns)(relDef.referenceKey);
+        if (sourceKeys.length !== refKeys.length) {
+            throw new errors_js_1.ValidationError(`[turbine] manyToMany relation "${relDef.name}": through.sourceKey has ${sourceKeys.length} column(s) ` +
+                `but referenceKey has ${refKeys.length}. Composite keys must pair positionally.`);
+        }
+        const targetLink = targetKeys
+            .map((jcol, i) => `${qJunction}.${qi.q(jcol)} = ${qt}.${qi.q(targetPk[i])}`)
+            .join(' AND ');
+        const parentLink = sourceKeys
+            .map((jcol, i) => `${qJunction}.${qi.q(jcol)} = ${qSelf}.${qi.q(refKeys[i])}`)
+            .join(' AND ');
+        correlation = `EXISTS (SELECT 1 FROM ${qJunction} WHERE ${targetLink} AND ${parentLink})`;
+    }
+    else if (relDef.type === 'hasMany' || relDef.type === 'hasOne') {
         // parent.pk = child.fk
         correlation = qi.dialect.buildCorrelation(qt, relDef.foreignKey, qSelf, relDef.referenceKey);
     }

package/dist/cli/prisma-resolve.js

@@ -231,6 +231,21 @@ function relationFkColumns(model, field) {
     const fieldsArg = relAttr?.args.find((a) => a.key === 'fields' && a.kind === 'array');
     return fieldsArg?.items?.map((pf) => fieldColumn(model, pf)) ?? null;
 }
+/**
+ * FK columns for an INVERSE relation field (one carrying no `fields: [...]`),
+ * derived by @relation("Name") pairing: the opposing model's same-named field
+ * that owns the FK pins the columns. Returns undefined when there is no
+ * relation name or no named counterpart. This is how Prisma disambiguates two
+ * or more relations to the same target model.
+ */
+function pairedInverseFkColumns(model, field, targetModelName, modelsByName) {
+    const relName = relationNameOf(field);
+    const targetModel = modelsByName.get(targetModelName);
+    if (!relName || !targetModel)
+        return null;
+    const opposing = targetModel.fields.find((f) => f.type === model.name && relationNameOf(f) === relName && (relationFkColumns(targetModel, f)?.length ?? 0) > 0);
+    return opposing ? relationFkColumns(targetModel, opposing) : null;
+}
 function resolveRelation(model, fieldName, targetModelName, isList, modelTable, modelsByName, schema, tableMeta, noDb) {
     const cardinality = isList ? 'many' : 'one';
     const base = {
@@ -256,15 +271,7 @@ function resolveRelation(model, fieldName, targetModelName, isList, modelTable,
     // fall back to the ambiguity handling below when there is no relation name or
     // the named pair cannot be found.
     if (!fkColumns || fkColumns.length === 0) {
-        const relName = relationNameOf(field);
-        const targetModel = modelsByName.get(targetModelName);
-        if (relName && targetModel) {
-            const opposing = targetModel.fields.find((f) => f.type === model.name &&
-                relationNameOf(f) === relName &&
-                (relationFkColumns(targetModel, f)?.length ?? 0) > 0);
-            if (opposing)
-                fkColumns = relationFkColumns(targetModel, opposing);
-        }
+        fkColumns = pairedInverseFkColumns(model, field, targetModelName, modelsByName);
     }
     const candidates = Object.values(tableMeta.relations).filter((def) => {
         if (targetTable && def.to !== targetTable)
@@ -294,6 +301,36 @@ function resolveRelation(model, fieldName, targetModelName, isList, modelTable,
         };
     }
     if (picked.length > 1) {
+        // Elimination pass: an UNNAMED pair can still resolve when every sibling
+        // relation field to the same target pins a different candidate (via its own
+        // `fields: [...]` or @relation("Name") pairing). Subtract those consumed
+        // candidates; exactly one survivor means the unnamed pair is unambiguous by
+        // elimination, which is how Prisma itself resolves it.
+        const consumed = new Set();
+        for (const sibling of model.fields) {
+            if (sibling.name === fieldName || sibling.type !== targetModelName)
+                continue;
+            const sibFks = relationFkColumns(model, sibling) ?? pairedInverseFkColumns(model, sibling, targetModelName, modelsByName);
+            if (!sibFks || sibFks.length === 0)
+                continue;
+            const sibWant = [...sibFks].sort().join(',');
+            for (const def of candidates) {
+                const fk = Array.isArray(def.foreignKey) ? def.foreignKey : [def.foreignKey];
+                if ([...fk].sort().join(',') === sibWant)
+                    consumed.add(def.name);
+            }
+        }
+        const surviving = picked.filter((def) => !consumed.has(def.name));
+        if (surviving.length === 1) {
+            const def = surviving[0];
+            return {
+                ...base,
+                turbineName: def.name,
+                cardinality,
+                junction: def.type === 'manyToMany' ? def.through?.table : undefined,
+                status: 'resolved',
+            };
+        }
         return {
             ...base,
             reason: `ambiguous - ${picked.length} candidate relations match (${picked.map((d) => d.name).join(', ')})`,

package/dist/client.d.ts

@@ -158,6 +158,12 @@ export interface TurbineConfig {
     idleTimeoutMs?: number;
     /** Connection timeout in ms (default: 5000) */
     connectionTimeoutMs?: number;
+    /** pg-style alias for {@link poolSize}; the explicit field wins when both are set. */
+    max?: number;
+    /** pg-style alias for {@link idleTimeoutMs}; the explicit field wins when both are set. */
+    idleTimeoutMillis?: number;
+    /** pg-style alias for {@link connectionTimeoutMs}; the explicit field wins when both are set. */
+    connectionTimeoutMillis?: number;
     /** Enable query logging to console (default: false) */
     logging?: boolean;
     /** Default LIMIT applied to findMany() when no limit is specified (opt-in, default: undefined) */

package/dist/client.js

@@ -404,9 +404,9 @@ export class TurbineClient {
         }
         else {
             const poolConfig = {
-                max: config.poolSize ?? 10,
-                idleTimeoutMillis: config.idleTimeoutMs ?? 30_000,
-                connectionTimeoutMillis: config.connectionTimeoutMs ?? 5_000,
+                max: config.poolSize ?? config.max ?? 10,
+                idleTimeoutMillis: config.idleTimeoutMs ?? config.idleTimeoutMillis ?? 30_000,
+                connectionTimeoutMillis: config.connectionTimeoutMs ?? config.connectionTimeoutMillis ?? 5_000,
             };
             // Did the caller supply ANY explicit connection target? If not, and a
             // DATABASE_URL is present in the environment, fall back to it so
@@ -455,9 +455,9 @@ export class TurbineClient {
             if (typeof replica === 'string') {
                 const replicaPool = new pg.Pool({
                     connectionString: replica,
-                    max: config.poolSize ?? 10,
-                    idleTimeoutMillis: config.idleTimeoutMs ?? 30_000,
-                    connectionTimeoutMillis: config.connectionTimeoutMs ?? 5_000,
+                    max: config.poolSize ?? config.max ?? 10,
+                    idleTimeoutMillis: config.idleTimeoutMs ?? config.idleTimeoutMillis ?? 30_000,
+                    connectionTimeoutMillis: config.connectionTimeoutMs ?? config.connectionTimeoutMillis ?? 5_000,
                     ...(config.ssl !== undefined ? { ssl: config.ssl } : {}),
                 });
                 replicaPool.on('error', (err) => {

package/dist/prisma-compat.js

@@ -147,7 +147,16 @@ function decorate(err, prismaErrorCodes) {
     }
     return err;
 }
-function buildLookups(mm) {
+const TIME_PG_TYPES = new Set(['time', 'time without time zone', 'timetz', 'time with time zone']);
+/** `HH:MM:SS(.fff)?` (a pg `time` wire value) → Prisma's epoch-day `Date`. */
+function timeStringToDate(v) {
+    const m = v.match(/^(\d{2}):(\d{2}):(\d{2})(?:\.(\d{1,6}))?$/);
+    if (!m)
+        return null;
+    const ms = m[4] ? Math.round(Number(`0.${m[4]}`) * 1000) : 0;
+    return new Date(Date.UTC(1970, 0, 1, Number(m[1]), Number(m[2]), Number(m[3]), ms));
+}
+function buildLookups(ctx, mm) {
     const reverseFields = {};
     let identityFields = true;
     for (const [prismaField, turbineField] of Object.entries(mm.fields)) {
@@ -159,12 +168,17 @@ function buildLookups(mm) {
     for (const [prismaRel, rel] of Object.entries(mm.relations)) {
         reverseRelations[rel.name] = { prismaName: prismaRel, cardinality: rel.cardinality };
     }
-    return { reverseFields, identityFields, reverseRelations };
+    const timeFields = new Set();
+    for (const col of ctx.schema.tables[mm.table]?.columns ?? []) {
+        if (TIME_PG_TYPES.has(col.pgType))
+            timeFields.add(col.field);
+    }
+    return { reverseFields, identityFields, reverseRelations, timeFields };
 }
 function lookupsFor(ctx, mm) {
     let l = ctx.lookups.get(mm.table);
     if (!l) {
-        l = buildLookups(mm);
+        l = buildLookups(ctx, mm);
         ctx.lookups.set(mm.table, l);
     }
     return l;
@@ -720,7 +734,11 @@ function reshapeRow(ctx, mm, row) {
             out[rel.prismaName] = rv;
             continue;
         }
-        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = val;
+        let sv = val;
+        if (typeof sv === 'string' && l.timeFields.has(key)) {
+            sv = timeStringToDate(sv) ?? sv;
+        }
+        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = sv;
     }
     return out;
 }
@@ -752,7 +770,11 @@ function reshapeAggregate(ctx, mm, res) {
             out[key] = reshapeAggFieldBlock(l, val, false);
             continue;
         }
-        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = val;
+        let sv = val;
+        if (typeof sv === 'string' && l.timeFields.has(key)) {
+            sv = timeStringToDate(sv) ?? sv;
+        }
+        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = sv;
     }
     return out;
 }
@@ -784,7 +806,11 @@ function reshapeGroupRow(ctx, mm, row) {
             out[key] = reshapeAggFieldBlock(l, val, false);
             continue;
         }
-        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = val;
+        let sv = val;
+        if (typeof sv === 'string' && l.timeFields.has(key)) {
+            sv = timeStringToDate(sv) ?? sv;
+        }
+        out[l.identityFields ? key : (l.reverseFields[key] ?? key)] = sv;
     }
     return out;
 }

package/dist/query/where.js

@@ -11,7 +11,7 @@
  * primitives this module needs. See builder.ts for the thin delegating methods.
  */
 import { UnsupportedFeatureError, ValidationError } from '../errors.js';
-import { camelToSnake } from '../schema.js';
+import { camelToSnake, normalizeKeyColumns } from '../schema.js';
 import { assertBindableEqualsOperand, findArrayUniqueKey, findJsonUniqueKey, isArrayFilter, isColumnRef, isJsonFilter, isUnmatchedPlainObject, isWhereOperator, JSON_RANGE_OPERATORS, VECTOR_DISTANCE_COMPARATORS, VECTOR_METRIC_OPERATORS, validateTextSearchConfig, } from './filters.js';
 import { escapeLike, OPERATOR_KEYS, ownLookup } from './utils.js';
 import { classifyScalarForSql, fingerprintScalarToken, walkWhere, } from './where-compile.js';
@@ -808,7 +808,44 @@ export function buildRelationFilter(qi, _relName, relDef, filterObj, params, par
     const clauses = [];
     // Correlation: link child table to parent table (supports composite FKs)
     let correlation;
-    if (relDef.type === 'hasMany' || relDef.type === 'hasOne') {
+    if (relDef.type === 'manyToMany') {
+        // The target row is related iff a junction row links it to the parent.
+        // Direct FK correlation (the other branches) would compile target.pk =
+        // parent.pk and silently match nothing, so route through the junction:
+        //   EXISTS (SELECT 1 FROM junction
+        //           WHERE junction.targetKey = target.pk AND junction.sourceKey = parent.ref)
+        // All bare table names (no aliases), so the scoped sub-where machinery and
+        // nested relation filters inside the branch keep their qualification. The
+        // fragment binds no params, so collectRelationFilterParams needs no mirror.
+        if (!relDef.through) {
+            throw new ValidationError(`[turbine] manyToMany relation "${relDef.name}" is missing a \`through\` junction descriptor.`);
+        }
+        const qJunction = qi.q(relDef.through.table);
+        const targetKeys = normalizeKeyColumns(relDef.through.targetKey);
+        const targetPk = targetMeta.primaryKey;
+        if (targetPk.length === 0) {
+            throw new ValidationError(`[turbine] manyToMany relation "${relDef.name}" targets table "${targetTable}" which has no primary key; ` +
+                `cannot correlate the relation filter through the junction.`);
+        }
+        if (targetKeys.length !== targetPk.length) {
+            throw new ValidationError(`[turbine] manyToMany relation "${relDef.name}": through.targetKey has ${targetKeys.length} column(s) ` +
+                `but target "${targetTable}" primary key has ${targetPk.length}. Composite keys must pair positionally.`);
+        }
+        const sourceKeys = normalizeKeyColumns(relDef.through.sourceKey);
+        const refKeys = normalizeKeyColumns(relDef.referenceKey);
+        if (sourceKeys.length !== refKeys.length) {
+            throw new ValidationError(`[turbine] manyToMany relation "${relDef.name}": through.sourceKey has ${sourceKeys.length} column(s) ` +
+                `but referenceKey has ${refKeys.length}. Composite keys must pair positionally.`);
+        }
+        const targetLink = targetKeys
+            .map((jcol, i) => `${qJunction}.${qi.q(jcol)} = ${qt}.${qi.q(targetPk[i])}`)
+            .join(' AND ');
+        const parentLink = sourceKeys
+            .map((jcol, i) => `${qJunction}.${qi.q(jcol)} = ${qSelf}.${qi.q(refKeys[i])}`)
+            .join(' AND ');
+        correlation = `EXISTS (SELECT 1 FROM ${qJunction} WHERE ${targetLink} AND ${parentLink})`;
+    }
+    else if (relDef.type === 'hasMany' || relDef.type === 'hasOne') {
         // parent.pk = child.fk
         correlation = qi.dialect.buildCorrelation(qt, relDef.foreignKey, qSelf, relDef.referenceKey);
     }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "turbine-orm",
-  "version": "0.42.0",
+  "version": "0.43.0",
   "description": "Postgres-native TypeScript ORM — runs on Neon, Vercel Postgres, Cloudflare, Supabase. Streaming cursors, typed errors, single-query nested relations. One dependency, no WASM engine",
   "type": "module",
   "exports": {