@spinajs/orm 2.0.491 → 2.0.495

package/lib/mjs/relation-objects.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relation-objects.d.ts","sourceRoot":"","sources":["../../src/relation-objects.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,SAAS,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACzJ,OAAO,EAAM,WAAW,EAA8B,MAAM,aAAa,CAAC;AAC1E,OAAO,EAAe,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAChE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAE/B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAoBxC,qBAAa,OAAO;IAClB;;;;;;OAMG;WACW,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,IAC5D,UAAU,CAAC,EAAE,EAAE,MAAM,MAAM,EAAE;IAkBvC;;;;;;;OAOG;WACW,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,IACpE,UAAU,CAAC,EAAE,EAAE,MAAM,MAAM,EAAE;CAKxC;AAED;;;;GAIG;AACH,8BACsB,QAAQ,CAAC,CAAC,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO,SAAS,CAAC,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAE,YAAW,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IA0BjK,SAAS,CAAC,KAAK,EAAE,CAAC;IAAE,SAAS,CAAC,QAAQ,EAAE,mBAAmB;IAzBhE,qBAAqB,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAE/C,SAAS,EAAE,OAAO,CAAS;IAElC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC;IAE5B,SAAS,CAAC,kBAAkB,EAAE,OAAO,CAAC;IAEtC,SAAS,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC;IAErD;;;;;;;;;;OAUG;IACH,MAAM,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,qBAE1B;gBAEqB,KAAK,EAAE,CAAC,EAAY,QAAQ,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE;IAiBtF;;;;;;;;;;OAUG;IACH,SAAS,KAAK,cAAc,IAAI,GAAG,CAGlC;IAEM,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE;IAUzF;;;;OAIG;aACa,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAEvD;;;;OAIG;aACa,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;IAEzC;;;;OAIG;aACa,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,EAAE;IAErE;;OAEG;IACU,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAInC;;OAEG;IACI,KAAK;IAIZ;;;;;;OAMG;aACa,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAErC;;;;OAIG;aACa,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC;IAEvC;;;;;;;OAOG;aACa,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAEnF;;;;;OAKG;aACa,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,IAAI;IAEjE;;;;;;OAMG;aACa,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAE3E;;;;;OAKG;aACa,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI;IAE1E;;OAEG;aACa,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;CACjH;AAED,qBACa,cAAc,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,GAAG,SAAS;IASlE,SAAS,CAAC,MAAM,EAAE,CAAC;IAAE,SAAS,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,GAAG,IAAI;IAAE,SAAS,CAAC,QAAQ,EAAE,mBAAmB,GAAG,IAAI;IARrI,qBAAqB,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAEtD,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC;IAEZ,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;IAE5B,SAAS,EAAE,OAAO,CAAS;gBAEZ,MAAM,EAAE,CAAC,EAAY,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,GAAG,IAAI,EAAY,QAAQ,EAAE,mBAAmB,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;IAOxJ;;;OAGG;IACU,GAAG,CAAC,GAAG,EAAE,CAAC;IAOvB;;;;;;;;OAQG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI;IAcpB,MAAM;IAIb;;;;OAIG;IACU,MAAM;IASnB;;;;;;;;;;;OAWG;IACU,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,kBAAkB,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;CAoB1F;AAED,qBAAa,qBAAqB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,CAAE,SAAQ,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IAC/G,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAExC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;IAE1B,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,EAAE;IAKtD,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAGrB,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC;IAGvB,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAGrE,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,eAAe,GAAG,IAAI;IAGnD,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAG7D,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI;IAG3D,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAGrF,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE;CAInE;AAED,qBAAa,mBAAmB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,GAAG,SAAS,CAAE,SAAQ,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrG,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;CAIhC;AAED,qBACa,sBAAsB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,CAAE,SAAQ,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IAEvH,SAAS,CAAC,uBAAuB,EAAE,gBAAgB,GAAG,IAAI,CAAC;gBAE/C,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE;IAQlE;;;;;;;;;;;OAWG;IACI,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAItE;;;;;OAKG;IACI,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,eAAe,GAAG,IAAI;IAIrD;;;;;;;OAOG;IACI,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAI9D;;;;KAIC;IACM,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;IAM9D;;;;OAIG;IACI,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAE3C;;;OAGG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAE1C;;;OAGG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAE5B;;;SAGK;IACE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE;IAW1B;;;;;MAKE;cACc,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE;IAsBjC;;;;;;;;;QASI;IACS,IAAI;IAOjB;;;;OAIG;IACU,MAAM;IAMnB,qFAAqF;cACrE,OAAO;IAuBV,QAAQ,CAAC,CAAC,SAAS,OAAO,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI;CAmC1H;AAED,qBACa,qBAAqB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,CAAE,SAAQ,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IACtH;;;;;OAKG;cACa,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE;IAsBjC;;OAEG;IACU,QAAQ,CAAC,CAAC,SAAS,OAAO,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAmBzI;;;;;;;;;;;OAWG;IACU,IAAI;IAOjB;;;;OAIG;IACU,MAAM;IAMnB,qFAAqF;cACrE,OAAO;IAkBvB;;;;;;OAMG;IACI,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO;IAI5D;;;;OAIG;IACI,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;IAM9D;;;;;;OAMG;IACI,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO;IAIhE;;;;OAIG;IACI,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE;IAIrB;;;OAGG;IACI,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GAAG,CAAC,EAAE;IAI/E;;;;OAIG;IACI,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAE3C;;;OAGG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAE1C;;;OAGG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAE5B;;;SAGK;IACE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE;IAWnB,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,GAGtC,GAAG;IAG1B,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC;CAKjE"}
+{"version":3,"file":"relation-objects.d.ts","sourceRoot":"","sources":["../../src/relation-objects.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAmB,kBAAkB,EAAE,SAAS,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACzJ,OAAO,EAAM,WAAW,EAAe,MAAM,aAAa,CAAC;AAE3D,OAAO,EAAe,kBAAkB,EAAsB,MAAM,eAAe,CAAC;AACpF,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAE/B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AA2CxC;;;GAGG;AACH,qBAAa,OAAO;IAClB;;;;;;OAMG;WACW,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,IAC5D,UAAU,CAAC,EAAE,EAAE,MAAM,MAAM,EAAE;IAcvC;;;;;;OAMG;WACW,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,IACpE,UAAU,CAAC,EAAE,EAAE,MAAM,MAAM,EAAE;IAOvC;;;;;;;;OAQG;WACW,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,IAC7D,UAAU,CAAC,EAAE,EAAE,MAAM,MAAM,EAAE;CAcxC;AAED;;;;GAIG;AACH,8BACsB,QAAQ,CAAC,CAAC,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO,SAAS,CAAC,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAE,YAAW,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IAuBjK,SAAS,CAAC,KAAK,EAAE,CAAC;IAAE,SAAS,CAAC,QAAQ,EAAE,mBAAmB;IAtBhE,qBAAqB,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAE/C,SAAS,EAAE,OAAO,CAAS;IAElC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC;IAE5B,SAAS,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC;IAErD;;;;;;;;;OASG;IACH,MAAM,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,qBAE1B;gBAEqB,KAAK,EAAE,CAAC,EAAY,QAAQ,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE;IAetF;;;;;;;;;;OAUG;IACH,SAAS,KAAK,cAAc,IAAI,GAAG,CAGlC;IAED;;;;;OAKG;IACI,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAE9C;;;;;OAKG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;IAiBhC;;OAEG;IACU,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAInC;;OAEG;IACI,KAAK;IAIZ;;;;;;OAMG;aACa,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAErC;;;;OAIG;aACa,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC;IAEvC;;;;;;;OAOG;IACI,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAI1E;;;;;;;OAOG;IACI,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,IAAI;IAIpE;;;;;;;OAOG;IACI,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAIlE;;;;;;OAMG;IACI,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI;IAMjE;;OAEG;aACa,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;CACjH;AAED,qBACa,cAAc,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,GAAG,SAAS;IASlE,SAAS,CAAC,MAAM,EAAE,CAAC;IAAE,SAAS,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,GAAG,IAAI;IAAE,SAAS,CAAC,QAAQ,EAAE,mBAAmB,GAAG,IAAI;IARrI,qBAAqB,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAEtD,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC;IAEZ,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;IAE5B,SAAS,EAAE,OAAO,CAAS;gBAEZ,MAAM,EAAE,CAAC,EAAY,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,GAAG,IAAI,EAAY,QAAQ,EAAE,mBAAmB,GAAG,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;IAOxJ;;;OAGG;IACU,GAAG,CAAC,GAAG,EAAE,CAAC;IAOvB;;;;;;;;OAQG;IACI,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI;IAcpB,MAAM;IAIb;;;;OAIG;IACU,MAAM;IASnB;;;;;;;;;;;OAWG;IACU,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,kBAAkB,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;CAoB1F;AAED,qBAAa,qBAAqB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,CAAE,SAAQ,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IAC/G,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IACxC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;IAI1B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAGrB,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC;IAGvB,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAGrE,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,IAAI;IAG/D,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAG7D,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI;IAG3D,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBAGrF,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE;CAInE;AAED,qBAAa,mBAAmB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,GAAG,SAAS,CAAE,SAAQ,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrG,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;CAIhC;AAED,qBACa,sBAAsB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,CAAE,SAAQ,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IAEvH,SAAS,CAAC,uBAAuB,EAAE,gBAAgB,GAAG,IAAI,CAAC;gBAE/C,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,mBAAmB,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE;IASlE;;;;;MAKE;cACc,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE;IAwBjC;;;;;;;QAOI;IACS,IAAI;IAOjB;;;;OAIG;IACU,MAAM;IAMnB;;;;OAIG;IACH,SAAS,CAAC,mBAAmB,CAAC,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,kBAAkB,GAAG,mBAAmB;IAWtG;;;;;;;OAOG;cACa,OAAO;IA4BV,QAAQ,CAAC,CAAC,SAAS,OAAO,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI;CAsB1H;AAED,qBACa,qBAAqB,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,SAAS,CAAE,SAAQ,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IACtH;;;;;OAKG;cACa,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE;IAyCjC;;;;;;;OAOG;IACU,QAAQ,CAAC,CAAC,SAAS,OAAO,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAyBzI;;;;;;;;;;;OAWG;IACU,IAAI;IAOjB;;;;OAIG;IACU,MAAM;IAMnB,qFAAqF;cACrE,OAAO;CAkBxB"}

package/lib/mjs/relation-objects.js

@@ -9,60 +9,104 @@ var __metadata = (this && this.__metadata) || function (k, v) {
 };
 /* eslint-disable prettier/prettier */
 import { InsertBehaviour } from './interfaces.js';
-import { DI, isConstructor, NewInstance } from '@spinajs/di';
-import { createQuery, SelectQueryBuilder } from './builders.js';
+import { DI, NewInstance } from '@spinajs/di';
+import { DateTime } from 'luxon';
+import { createQuery, SelectQueryBuilder, UpdateQueryBuilder } from './builders.js';
 import { Orm } from './orm.js';
 import _ from 'lodash';
 import { extractModelDescriptor } from './descriptor.js';
 import { isCompositePk, pkColumns, pkKeyStringFor, pkValueOf, whereNotAnyPk } from './primary-keys.js';
 import { OrmException } from './exceptions.js';
 /**
- * Builds a lodash iteratee for the given primary key columns. A single column stays a plain
- * property name ( lodash's fast path ); a composite key becomes a function that flattens the
- * tuple, because an array iteratee would be read as a property PATH — `_.differenceBy(a, b,
- * ['TenantId','Code'])` resolves `obj['TenantId']['Code']`, undefined for every row, so every
- * row would compare equal.
+ * Builds the equality used by every keyed set operation.
+ *
+ * Same reference is always equal. Two DIFFERENT rows are equal only when every key column is
+ * set on both and the flattened key strings match — a fresh, unsaved model ( undefined key )
+ * never equals another row, so two new models are two members, not one. The previous
+ * `differenceBy` iteratee stringified undefined keys and collapsed all unsaved rows into one.
  */
-function pkIteratee(pKey) {
-    if (pKey.length === 1) {
-        return pKey[0];
+function pkComparator(pKey) {
+    return (a, b) => {
+        if (a === b) {
+            return true;
+        }
+        if (pKey.length === 0) {
+            return false;
+        }
+        const isSet = (x) => pKey.every((k) => x?.[k] !== null && x?.[k] !== undefined);
+        if (!isSet(a) || !isSet(b)) {
+            return false;
+        }
+        return pkKeyStringFor(a, pKey) === pkKeyStringFor(b, pKey);
+    };
+}
+/**
+ * A set operation with no comparator falls back to primary key equality, which needs key
+ * columns to exist. Comparing keyless rows silently matches nothing ( or everything ), so
+ * fail loudly instead.
+ */
+function assertSetOpKeys(pKey, callback) {
+    if (!callback && pKey.length === 0) {
+        throw new OrmException('set operation compares by primary key, but the model declares no primary key columns; pass an explicit comparator callback');
     }
-    return (x) => pkKeyStringFor(x, pKey);
 }
+/**
+ * Pure, in-memory set algebra over model collections. Nothing here touches the database —
+ * apply a result with `relation.set(...)` and persist it with `sync()` / `update()` / `save()`.
+ */
 export class Dataset {
     /**
-     *
-     * Calculates difference between data in this relation and provides set. Result is saved to db.
+     * Calculates the symmetric difference between the relation data and the provided dataset —
+     * members of either set that are not in the other. In-memory only; persist with `sync()`.
      *
      * @param dataset - data to compare
-     * @param callback - function to compare objects, if none provideded - primary key value is used
+     * @param callback - function to compare objects, if none provided - primary key value is used
      */
     static diff(dataset, callback) {
         return (datasetB, pKey) => {
-            // TODO: maybe refactor for speedup, this is not optimal
-            // two calls to _.difference is not optimal, but it is easy to implement
-            const iteratee = pkIteratee(pKey);
-            // calculate difference between this data in relation and dataset ( objects from this relation)
-            const result = callback ? _.differenceWith(dataset, [...datasetB], callback) : _.differenceBy(dataset, [...datasetB], iteratee);
-            // calculate difference between dataset and data in this relation ( objects from dataset )
-            const result2 = callback ? _.differenceWith([...datasetB], dataset, callback) : _.differenceBy([...datasetB], dataset, iteratee);
-            // combine difference from two sets
-            const finalDiff = [...result, ...result2];
-            return finalDiff;
+            assertSetOpKeys(pKey, callback);
+            const eq = callback ?? pkComparator(pKey);
+            // members of dataset that are not in the relation data
+            const result = _.differenceWith(dataset, [...datasetB], eq);
+            // members of the relation data that are not in dataset
+            const result2 = _.differenceWith([...datasetB], dataset, eq);
+            return [...result, ...result2];
         };
     }
     /**
-     *
-     * Calculates intersection between data in this relation and provided dataset
-     * It saves result to db
+     * Calculates the intersection between the relation data and the provided dataset.
+     * In-memory only; persist with `sync()`.
      *
      * @param dataset - dataset to compare
      * @param callback - function to compare models, if not set it is compared by primary key value
      */
     static intersection(dataset, callback) {
         return (datasetB, pKey) => {
-            const iteratee = pkIteratee(pKey);
-            return callback ? _.intersectionWith(dataset, [...datasetB], callback) : _.intersectionBy(dataset, [...datasetB], iteratee);
+            assertSetOpKeys(pKey, callback);
+            const eq = callback ?? pkComparator(pKey);
+            return _.intersectionWith(dataset, [...datasetB], eq);
+        };
+    }
+    /**
+     * Calculates the union of the relation data and the provided dataset. Members already
+     * present ( by primary key or comparator ) are kept once, the relation's own instance
+     * winning over the incoming duplicate. Unsaved models compare by reference, so they are
+     * always appended. In-memory only; persist with `sync()`.
+     *
+     * @param dataset - data to add
+     * @param callback - function to compare models, if not set it is compared by primary key value
+     */
+    static union(dataset, callback) {
+        return (datasetB, pKey) => {
+            assertSetOpKeys(pKey, callback);
+            const eq = callback ?? pkComparator(pKey);
+            const result = [...datasetB];
+            for (const item of dataset) {
+                if (!result.some((existing) => eq(existing, item))) {
+                    result.push(item);
+                }
+            }
+            return result;
         };
     }
 }
@@ -73,15 +117,14 @@ export class Dataset {
  */
 let Relation = class Relation extends Array {
     /**
-     * Array methods that derive a new collection ( `splice`, `filter`, `slice`, `concat`, … )
-     * construct `new this.constructor[Symbol.species](len)` by default. That would call this
-     * class's constructor with no relation descriptor, and the very next line dereferences
-     * `this.Relation.TargetModel` — so `order.Items.splice(0, 1)` threw
+     * Array methods that derive a new collection ( `splice`, `filter`, `slice`, `concat`,
+     * `map`, … ) construct `new this.constructor[Symbol.species](len)` by default. That would
+     * call this class's constructor with no relation descriptor, and the very next line
+     * dereferences `this.Relation.TargetModel` — so `order.Items.splice(0, 1)` threw
      * `Cannot read properties of undefined (reading 'TargetModel')`.
      *
      * Deriving plain arrays is also the right semantics: a slice of a relation is a list of
-     * models, not a relation with an owner. ( The hand-written `map()` below predates this and
-     * worked around the same thing for one method. )
+     * models, not a relation with an owner.
      */
     static get [Symbol.species]() {
         return Array;
@@ -99,7 +142,6 @@ let Relation = class Relation extends Array {
         if (this.TargetModelDescriptor) {
             this.Driver = DI.resolve('OrmConnection', [this.TargetModelDescriptor.Connection]);
         }
-        this.IsModelAForwardRef = !isConstructor(this.Model);
     }
     /**
      * The owner-side value this relation joins on.
@@ -116,13 +158,18 @@ let Relation = class Relation extends Array {
         const key = this.Relation?.PrimaryKey;
         return key ? this.Owner[key] : this.Owner.PrimaryKeyValue;
     }
-    map(callbackfn, thisArg) {
-        const result = [];
-        for (let index = 0; index < this.length; index++) {
-            const element = this[index];
-            result.push(callbackfn.call(thisArg, element, index, this));
+    remove(obj) {
+        let toRemove;
+        if (_.isFunction(obj)) {
+            toRemove = [...this].filter(obj);
+        }
+        else {
+            const candidates = Array.isArray(obj) ? obj : [obj];
+            const eq = pkComparator(pkColumns(this.TargetModelDescriptor));
+            toRemove = [...this].filter((member) => candidates.some((c) => eq(member, c)));
         }
-        return result;
+        this.set((data) => data.filter((d) => !toRemove.includes(d)));
+        return toRemove;
     }
     /**
      * Delete all objects from relation ( alias for empty )
@@ -136,6 +183,51 @@ let Relation = class Relation extends Array {
     empty() {
         this.length = 0;
     }
+    /**
+     * Calculates the intersection between this relation and the provided dataset. Pure
+     * computation — apply it with `set()` and persist with `sync()` / `save()`.
+     *
+     * @param dataset - dataset to compare
+     * @param callback - function to compare models, if not set it is compared by primary key value
+     * @returns members present in both sets
+     */
+    intersection(dataset, callback) {
+        return Dataset.intersection(dataset, callback)([...this], pkColumns(this.TargetModelDescriptor));
+    }
+    /**
+     * Adds the dataset's members to this relation, skipping members already present ( compared
+     * by primary key, or by the callback ). In-memory only — nothing is written until `sync()`,
+     * `update()` or `save()`.
+     *
+     * @param dataset - data to add
+     * @param callback - function to compare models, if not set it is compared by primary key value
+     */
+    union(dataset, callback) {
+        this.set(Dataset.union(dataset, callback)([...this], pkColumns(this.TargetModelDescriptor)));
+    }
+    /**
+     * Calculates the symmetric difference between this relation and the dataset — members of
+     * this relation that are not in the dataset, plus members of the dataset that are not in
+     * this relation. Pure computation — apply it with `set()` and persist with `sync()`.
+     *
+     * @param dataset - data to compare
+     * @param callback - function to compare objects, if none provided - primary key value is used
+     */
+    diff(dataset, callback) {
+        return Dataset.diff(dataset, callback)([...this], pkColumns(this.TargetModelDescriptor));
+    }
+    /**
+     * Clears the relation and replaces its members with the new dataset ( or with the result of
+     * a `Dataset.diff` / `Dataset.intersection` / `Dataset.union` closure ). In-memory only —
+     * persist with `sync()` / `update()` / `save()`.
+     *
+     * @param obj - replacement data, or a closure receiving the current members and the primary key columns
+     */
+    set(obj) {
+        const toPush = _.isFunction(obj) ? obj([...this], pkColumns(this.TargetModelDescriptor)) : obj;
+        this.empty();
+        this.push(...toPush);
+    }
 };
 Relation = __decorate([
     NewInstance(),
@@ -236,30 +328,29 @@ SingleRelation = __decorate([
 ], SingleRelation);
 export { SingleRelation };
 export class ManyQueryRelationList extends Relation {
-    /* eslint-disable prettier/prettier */
     remove(_obj) {
-        throw new Error('Query relations cannot be removed. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be removed. This relation is used only for query purposes and it is always populated.');
     }
     sync() {
-        throw new Error('Query relations cannot be synced. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be synced. This relation is used only for query purposes and it is always populated.');
     }
     update() {
-        throw new Error('Query relations cannot be updated. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be updated. This relation is used only for query purposes and it is always populated.');
     }
     intersection(_dataset, _callback) {
-        throw new Error('Query relations cannot be intersected. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be intersected. This relation is used only for query purposes and it is always populated.');
     }
-    union(_dataset, _mode) {
-        throw new Error('Query relations cannot be unioned. This relation is used only for query purposes and it is always populated.');
+    union(_dataset, _callback) {
+        throw new OrmException('Query relations cannot be unioned. This relation is used only for query purposes and it is always populated.');
     }
     diff(_dataset, _callback) {
-        throw new Error('Query relations cannot be diffed. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be diffed. This relation is used only for query purposes and it is always populated.');
     }
     set(_obj) {
-        throw new Error('Query relations cannot be set. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be set. This relation is used only for query purposes and it is always populated.');
     }
     populate(_callback) {
-        throw new Error('Query relations cannot be populated. This relation is used only for query purposes and it is always populated.');
+        throw new OrmException('Query relations cannot be populated. This relation is used only for query purposes and it is always populated.');
     }
     constructor(owner, relation, objects) {
         super(owner, relation, objects);
@@ -279,58 +370,6 @@ let ManyToManyRelationList = class ManyToManyRelationList extends Relation {
             this.junctionModelDescriptor = extractModelDescriptor(this.Relation.JunctionModel);
         }
     }
-    /**
-     * Calculates intersection between data in this relation and provided dataset
-     *
-     * `[...this]` rather than `this`: these delegate into lodash, and `Relation extends Array`
-     * with a three-argument constructor, so anything that derives a new collection has to work
-     * on a plain array. ( `OneToManyRelationList` sidesteps the same problem by overriding
-     * `filter`/`map`; this class has no such overrides. )
-     *
-     * @param obj - dataset to compare with
-     * @param callback - compare function, if not set the target model's primary key is used
-     * @returns members present in both sets
-     */
-    intersection(obj, callback) {
-        return Dataset.intersection(obj, callback)([...this], this.TargetModelDescriptor.PrimaryKey);
-    }
-    /**
-     * Appends `obj` to this relation. Shorthand for push — nothing is removed and nothing is
-     * written to the database until `sync()`, `update()` or `save()` runs.
-     *
-     * @param obj - members to add
-     */
-    union(obj, _mode) {
-        this.push(...obj);
-    }
-    /**
-     * Calculates the symmetric difference between this relation and `dataset` — members of this
-     * relation that are not in the dataset, plus members of the dataset that are not in this
-     * relation.
-     *
-     * @param obj - dataset to compare with
-     * @param callback - compare function, if not set the target model's primary key is used
-     */
-    diff(obj, callback) {
-        return Dataset.diff(obj, callback)([...this], this.TargetModelDescriptor.PrimaryKey);
-    }
-    /**
-   * Sets data in relation ( clear data and replace with new dataset )
-   *
-   * @param obj
-   */
-    set(obj) {
-        const toPush = _.isFunction(obj) ? obj([...this], pkColumns(this.TargetModelDescriptor)) : obj;
-        this.empty();
-        this.push(...toPush);
-    }
-    remove(obj) {
-        const toRemove = _.isFunction(obj) ? this.filter(obj) : Array.isArray(obj) ? obj : [obj];
-        this.set((data) => {
-            return data.filter((d) => !toRemove.includes(d));
-        });
-        return toRemove;
-    }
     /**
     * Deletes from db data that are not in relation
     *
@@ -347,8 +386,10 @@ let ManyToManyRelationList = class ManyToManyRelationList extends Relation {
         if (this.Driver.Options.Database) {
             query.database(this.Driver.Options.Database);
         }
-        // if we have data in relation, we need to exclude them from delete query
-        const toDelete = [...data].filter((x) => x.PrimaryKeyValue).map((x) => x.PrimaryKeyValue);
+        // if we have data in relation, we need to exclude them from delete query.
+        // Explicit null/undefined checks — a primary key of 0 or '' is a real key, and dropping
+        // it from the keep-list would delete that member's junction row.
+        const toDelete = [...data].map((x) => x.PrimaryKeyValue).filter((v) => v !== null && v !== undefined);
         if (toDelete.length !== 0) {
             query.whereNotIn(this.Relation.JunctionModelTargetModelFKey_Name, toDelete);
         }
@@ -359,8 +400,6 @@ let ManyToManyRelationList = class ManyToManyRelationList extends Relation {
       *  Deletes from db entries that are not in relation and adds entries that are not in db
       *  Sets foreign key to relational data
       *
-      *  Inserts or updates models that are dirty only.
-      *
       *  One transaction: the junction upserts and the orphan delete used to be independent
       *  statements. Nested inside a caller's transaction this takes a savepoint.
       */
@@ -371,42 +410,69 @@ let ManyToManyRelationList = class ManyToManyRelationList extends Relation {
         });
     }
     /**
-     * Updates or ads data to relation
-     * It will not delete data from db that are not in relation. It will only update or insert new data.
-     * Only dirty models are updated.
+     * Adds missing rows to the database without deleting anything: unsaved members are
+     * inserted, members without a junction row get one. Existing junction rows are left
+     * untouched.
      */
     async update() {
         await this.Driver.transaction(async () => {
             await this._update();
         });
     }
-    /** The write itself, without a transaction of its own, so `sync()` can share one. */
+    /**
+     * Finds the junction model's relation pointing at `model`, by constructor identity — the
+     * junction's PROPERTY name is the author's choice ( `Order`, `Tag`, … ) and has nothing to
+     * do with the target class name.
+     */
+    junctionRelationFor(model) {
+        const relations = Array.from(this.junctionModelDescriptor?.Relations.values() ?? []);
+        const found = relations.find((r) => r.TargetModel === model);
+        if (!found) {
+            throw new OrmException(`junction model ${this.junctionModelDescriptor?.Name} of relation ${this.Relation.Name} declares no relation targeting ${model?.name}; add a @BelongsTo for it`);
+        }
+        return found;
+    }
+    /**
+     * The write itself, without a transaction of its own, so `sync()` can share one.
+     *
+     * Unsaved members are inserted first — a junction row written for a model with no primary
+     * key would carry a NULL foreign key. Members that already have a junction row are skipped:
+     * the junction's own primary key is auto-generated, so re-inserting the pair would DUPLICATE
+     * the link rather than upsert it ( which is exactly what repeated `sync()` calls used to do ).
+     */
     async _update() {
+        const sourceModelRelation = this.junctionRelationFor(this.Owner.constructor);
+        const existingQuery = this.Driver.select().from(this.junctionModelDescriptor.TableName).where(this.Relation.JunctionModelSourceModelFKey_Name, this.OwnerJoinValue);
+        if (this.Driver.Options.Database) {
+            existingQuery.database(this.Driver.Options.Database);
+        }
+        const existingRows = (await existingQuery.asRaw()) ?? [];
+        const linked = new Set(existingRows.map((r) => r[this.Relation.JunctionModelTargetModelFKey_Name]).filter((v) => v !== null && v !== undefined));
         for (const f of this) {
-            const junctionEntry = new this.Relation.JunctionModel();
-            const desc = junctionEntry.ModelDescriptor;
-            const relationsArray = Array.from(desc.Relations.values());
-            const sourceModelRelation = relationsArray.find((r) => r.TargetModel === this.Owner.constructor);
-            const targetModelRelation = relationsArray.find((r) => r.TargetModel === f.constructor);
-            if (!sourceModelRelation) {
-                throw new Error(`Junction model relation for source model ${this.Owner.constructor.name} not found.`);
+            if (f.PrimaryKeyValue === null || f.PrimaryKeyValue === undefined) {
+                await f.insert(InsertBehaviour.InsertOrUpdate);
             }
-            if (!targetModelRelation) {
-                throw new Error(`Junction model relation for target model ${f.constructor.name} not found.`);
+            if (linked.has(f.PrimaryKeyValue)) {
+                continue;
             }
+            const targetModelRelation = this.junctionRelationFor(f.constructor);
+            const junctionEntry = new this.Relation.JunctionModel();
             junctionEntry[sourceModelRelation.Name].Value = this.Owner;
             junctionEntry[targetModelRelation.Name].Value = f;
             await junctionEntry.insert(InsertBehaviour.InsertOrUpdate);
         }
     }
     async populate(callback) {
+        // Resolved by constructor, not by `TargetModel.name` — the junction's property name is
+        // unrelated to the target class name, and class names do not survive minification.
+        const targetModelRelation = this.junctionRelationFor(this.Relation.TargetModel);
         const query = this.Relation.JunctionModel.where(this.Relation.JunctionModelSourceModelFKey_Name, this.OwnerJoinValue).populate(this.Relation.TargetModel, callback);
         const result = await query;
         if (result) {
             this.length = 0;
-            this.push(...result.map((r) => {
-                return r[this.Relation.TargetModel.name].Value;
-            }));
+            // A junction row whose target row no longer exists resolves to a null Value — skip it
+            // rather than push null into the member list.
+            this.push(...result.map((r) => r[targetModelRelation.Name].Value).filter((v) => v !== null && v !== undefined));
         }
         this.Populated = true;
         this.Owner.snapshotRelation(this.Relation.Name);
@@ -425,24 +491,45 @@ let OneToManyRelationList = class OneToManyRelationList extends Relation {
      * @returns
      */
     async _dbDiff(data) {
-        const query = this.Driver.del().from(this.TargetModelDescriptor.TableName).where(this.Relation.ForeignKey, this.OwnerJoinValue);
-        if (this.Driver.Options.Database) {
-            query.database(this.Driver.Options.Database);
-        }
-        // if we have data in relation, we need to exclude them from delete query.
         // A composite key is a tuple and always truthy, so filter on the key COLUMNS being set
         // rather than on the tuple itself.
         const keys = pkColumns(this.TargetModelDescriptor);
-        const toDelete = data
+        const toKeep = data
             .map((x) => pkValueOf(x, this.TargetModelDescriptor))
             .filter((v) => (Array.isArray(v) ? v.every((p) => p !== null && p !== undefined) : v !== null && v !== undefined));
-        if (toDelete.length !== 0 && keys.length !== 0) {
-            whereNotAnyPk(query, this.TargetModelDescriptor, toDelete);
+        // A `@SoftDelete` target is never hard-deleted — the same degradation
+        // `SubjectExecutor.effectivePolicy` applies to orphans on the save() path. The stamp goes
+        // through a model-aware builder so the DateTime passes the column's converter.
+        const softDeleteColumn = this.TargetModelDescriptor.SoftDelete?.DeletedAt;
+        if (softDeleteColumn) {
+            const { query } = createQuery(this.Relation.TargetModel, UpdateQueryBuilder);
+            const update = query.update({ [softDeleteColumn]: DateTime.now() });
+            update.where(this.Relation.ForeignKey, this.OwnerJoinValue);
+            // Rows stamped by an earlier sync keep their original deletion time.
+            update.whereNull(softDeleteColumn);
+            if (toKeep.length !== 0 && keys.length !== 0) {
+                whereNotAnyPk(update, this.TargetModelDescriptor, toKeep);
+            }
+            await update;
+            return;
+        }
+        const query = this.Driver.del().from(this.TargetModelDescriptor.TableName).where(this.Relation.ForeignKey, this.OwnerJoinValue);
+        if (this.Driver.Options.Database) {
+            query.database(this.Driver.Options.Database);
+        }
+        // if we have data in relation, we need to exclude them from the delete query
+        if (toKeep.length !== 0 && keys.length !== 0) {
+            whereNotAnyPk(query, this.TargetModelDescriptor, toKeep);
         }
         await query;
     }
     /**
      * Populates this relation ( loads all data related to owner of this relation)
+     *
+     * Pushes the rows into THIS list rather than routing through `Owner.attach()`: attach flags
+     * the owner dirty ( a read must not create unsaved changes ), feeds every sibling relation
+     * with the same target model, and drops discriminated subclass rows because their
+     * constructor is not the declared target. Only attach's back-reference wiring is kept.
      */
     async populate(callback) {
         const query = this.Relation.TargetModel.where(this.Relation.ForeignKey, this.OwnerJoinValue);
@@ -453,7 +540,12 @@ let OneToManyRelationList = class OneToManyRelationList extends Relation {
         if (result) {
             this.length = 0;
             result.forEach((r) => {
-                this.Owner.attach(r);
+                // Set the child's back-reference to this owner, when the child declares one.
+                const backRef = [...(r.ModelDescriptor?.Relations.entries() ?? [])].find((e) => e[1].ForeignKey === this.Relation.ForeignKey);
+                if (backRef) {
+                    r[backRef[0]].Value = this.Owner;
+                }
+                this.push(r);
             });
         }
         this.Populated = true;
@@ -503,67 +595,6 @@ let OneToManyRelationList = class OneToManyRelationList extends Relation {
             await f.insert(InsertBehaviour.InsertOrUpdate);
         }
     }
-    /**
-     * Calculates difference between this relation and dataset ( items from this relation that are not in dataset and items from dataset that are not in this relation)
-     *
-     * @param dataset
-     * @param callback
-     * @returns Difference between this relation and dataset
-     */
-    diff(dataset, callback) {
-        return Dataset.diff(dataset, callback)([...this], pkColumns(this.TargetModelDescriptor));
-    }
-    /**
-     * Sets data in relation ( clear data and replace with new dataset )
-     *
-     * @param obj
-     */
-    set(obj) {
-        const toPush = _.isFunction(obj) ? obj([...this], pkColumns(this.TargetModelDescriptor)) : obj;
-        this.empty();
-        this.push(...toPush);
-    }
-    /**
-     * Calculates intersection between data in this relation and provided dataset
-     *
-     * @param obj
-     * @param callback compare function, if not set - primary key value is used
-     * @returns Data that are in both sets
-     */
-    intersection(obj, callback) {
-        return Dataset.intersection(obj, callback)([...this], pkColumns(this.TargetModelDescriptor));
-    }
-    /**
-     * Combines data with this relation and saves to db
-     * Shorthand for push
-     * @param obj
-     */
-    union(obj) {
-        this.push(...obj);
-    }
-    /**
-     * Returns the elements of an array that meet the condition specified in a callback function.
-     * @param predicate A function that accepts up to three arguments. The filter method calls the predicate function one time for each element in the array.
-     */
-    filter(predicate) {
-        return [...this].filter(predicate);
-    }
-    remove(obj) {
-        const toRemove = _.isFunction(obj) ? this.filter(obj) : Array.isArray(obj) ? obj : [obj];
-        this.set((data) => {
-            return data.filter((d) => !toRemove.includes(d));
-        });
-        return toRemove;
-    }
-    flatMap(callback) {
-        const r = this.map(callback);
-        return r.flatMap(x => x);
-    }
-    map(callback) {
-        const r = [];
-        this.forEach((x, i, a) => r.push(callback(x, i, a)));
-        return r;
-    }
 };
 OneToManyRelationList = __decorate([
     NewInstance()