npm - @wildo-ai/saas-backend-lib - Versions diffs - 1.1.1 → 1.1.3 - Mend

@wildo-ai/saas-backend-lib 1.1.1 → 1.1.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (972) hide show

package/dist/esm/organizations/services/organization-unit-custom-implementation.backend.service.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"organization-unit-custom-implementation.backend.service.js","sourceRoot":"","sources":["../../../../../src/organizations/services/organization-unit-custom-implementation.backend.service.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,SAAS,EACT,2BAA2B,EAC3B,sBAAsB,EACtB,2BAA2B,EAC3B,4BAA4B,EAC5B,kCAAkC,EAClC,8BAA8B,EAC9B,2BAA2B,EAC3B,2BAA2B,EAC3B,6BAA6B,EAC7B,0BAA0B,GAE3B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,yCAAyC,GAE1C,MAAM,4GAA4G,CAAC;AAIpH,OAAO,EACL,0BAA0B,EAC1B,sBAAsB,GACvB,MAAM,+EAA+E,CAAC;AAEvF;;;;;GAKG;AACH,MAAM,oBAAoB,GAAoD,cAAc,CAAC;AAE7F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2DG;AACH,MAAM,CAAC,KAAK,UAAU,kCAAkC,CACtD,MAAc,EACd,gBAAuC,EACvC,KAAmD;IAEnD,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IAErG,6FAA6F;IAC7F,yDAAyD;IACzD,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,EAAE,gBAAgB,EAAE;YAC7E,sBAAsB,EAAE,2BAA2B,CAAC,aAAa;YACjE,OAAO,EAAE;gBACP,OAAO,EAAE,iGAAiG;gBAC1G,kBAAkB,EAAE,MAAM;gBAC1B,iBAAiB,EAAE,gBAAgB,CAAC,kBAAkB;aACvD;SACF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,iBAAiB,GAAG,MAAM,cAAc,CAAC,IAAI,CAAmB,gBAAgB,EAAE;QACtF,CAAC,oBAAoB,CAAC,EAAE,MAAM;KAC/B,CAAC,CAAC;IAEH,IAAI,iBAAiB,EAAE,CAAC;QACtB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;YACxE,sBAAsB,EAAE,2BAA2B,CAAC,gCAAgC;YACpF,OAAO,EAAE;gBACP,kBAAkB,EAAE,MAAM;gBAC1B,mBAAmB,EAAE,iBAAiB,CAAC,GAAG;gBAC1C,qBAAqB,EAAE,iBAAiB,CAAC,IAAI;aAC9C;SACF,CAAC,CAAC;IACL,CAAC;IAED,gGAAgG;IAChG,kGAAkG;IAClG,gGAAgG;IAChG,MAAM,oBAAoB,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,yBAAyB,CAAC,CAAC;IAClH,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC1B,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,EAAE,gBAAgB,EAAE;YAC7E,sBAAsB,EAAE,2BAA2B,CAAC,aAAa;YACjE,OAAO,EAAE;gBACP,OAAO,EAAE,yGAAyG;gBAClH,kBAAkB,EAAE,MAAM;gBAC1B,iBAAiB,EAAE,gBAAgB,CAAC,yBAAyB;aAC9D;SACF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,kBAAkB,GAAG,MAAM,oBAAoB,CAAC,IAAI,CACxD,gBAAgB,EAChB,EAAE,kBAAkB,EAAE,MAAM,EAAE,CAC/B,CAAC;IAEF,IAAI,kBAAkB,EAAE,CAAC;QACvB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;YACxE,sBAAsB,EAAE,2BAA2B,CAAC,gCAAgC;YACpF,OAAO,EAAE;gBACP,kBAAkB,EAAE,MAAM;gBAC1B,oBAAoB,EAAE,kBAAkB,CAAC,GAAG;gBAC5C,4BAA4B,EAAE,kBAAkB,CAAC,oBAAoB;aACtE;SACF,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAKD;;;;;;GAMG;AACH,KAAK,UAAU,0BAA0B,CACvC,MAAc,EACd,gBAAuC,EACvC,KAAmD,EACnD,eAAwC;IAExC,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IACrG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,EAAE,gBAAgB,EAAE;YAC7E,sBAAsB,EAAE,2BAA2B,CAAC,aAAa;YACjE,OAAO,EAAE,EAAE,OAAO,EAAE,qDAAqD,EAAE,GAAG,eAAe,EAAE;SAChG,CAAC,CAAC;IACL,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,cAAc,CAAC,IAAI,CAA8B,gBAAgB,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IACvG,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE;YACzE,sBAAsB,EAAE,2BAA2B,CAAC,SAAS;YAC7D,OAAO,EAAE,eAAe;SACzB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,+BAA+B,CAC5C,IAAiC,EACjC,gBAAuC,EACvC,KAAmD;IAEnD,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IACrG,MAAM,aAAa,GAAG,6BAA6B,CAAC,IAAI,CAAC,CAAC;IAE1D,gGAAgG;IAChG,6FAA6F;IAC7F,+FAA+F;IAC/F,qCAAqC;IACrC,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,mBAAmB,CACrD,gBAAgB,EAChB,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,EACvC,KAAK,CAAC,cAAc,CACrB,CAAC;IACF,MAAM,IAAI,GAAkC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,MAAkD,CAAC,IAAI,CAAC;IACtI,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,2BAA2B,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,KAAK,UAAU,0BAA0B,CACvC,SAAiH,EACjH,gBAAuC,EACvC,KAAmD;IAEnD,IAAI,CAAC,SAAS,CAAC,IAAI;QAAE,OAAO;IAE5B,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IACrG,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAA8B,gBAAgB,EAAE;QACvF,cAAc,EAAE,SAAS,CAAC,cAAc;QACxC,YAAY,EAAE,SAAS,CAAC,YAAY,IAAI,IAAI;QAC5C,IAAI,EAAE,SAAS,CAAC,IAAI;KACrB,CAAC,CAAC;IAEH,IAAI,OAAO,IAAI,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;QAChD,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;YACxE,sBAAsB,EAAE,2BAA2B,CAAC,6BAA6B;YACjF,OAAO,EAAE;gBACP,MAAM,EAAE,sCAAsC;gBAC9C,kBAAkB,EAAE,SAAS,CAAC,MAAM;gBACpC,iBAAiB,EAAE,OAAO,CAAC,GAAG;gBAC9B,YAAY,EAAE,SAAS,CAAC,YAAY,IAAI,IAAI;gBAC5C,IAAI,EAAE,SAAS,CAAC,IAAI;aACrB;SACF,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,yCAAyC;IACvD,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB,EAAE,qBAAqB,CAAC,MAAM;YACjD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,gDAAgD;QAC5D,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBAClF,MAAM,QAAQ,GAAG,KAA0E,CAAC;gBAE5F,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc;uBACzC,gBAAgB,CAAC,oBAAoB,EAAE,CAAC,kCAAkC,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC;uBAC3G,gBAAgB,CAAC,YAAY,EAAE,cAAc,CAAC;gBAEnD,IAAI,CAAC,cAAc,EAAE,CAAC;oBACpB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE,EAAE,OAAO,EAAE,+DAA+D,EAAE,MAAM,EAAE,mCAAmC,EAAE;qBACnI,CAAC,CAAC;gBACL,CAAC;gBAED,wFAAwF;gBACxF,2FAA2F;gBAC3F,yFAAyF;gBACzF,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY;oBACtC,CAAC,CAAC,MAAM,0BAA0B,CAAC,QAAQ,CAAC,YAAY,EAAE,gBAAgB,EAAE,KAAK,EAAE;wBACjF,MAAM,EAAE,oCAAoC;wBAC5C,YAAY,EAAE,QAAQ,CAAC,YAAY;qBACpC,CAAC;oBACF,CAAC,CAAC,IAAI,CAAC;gBAET,MAAM,0BAA0B,CAC9B,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,EAAE,YAAY,EAAE,QAAQ,CAAC,YAAY,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,EACxF,gBAAgB,EAChB,KAAK,CACN,CAAC;gBAEF,OAAO,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,8BAA8B,CAAC,UAAU,CAAC,EAAE,CAAC;YACxF,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qCAAqC;IACnD,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB,EAAE,qBAAqB,CAAC,MAAM;YACjD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,8CAA8C;QAC1D,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBAClF,MAAM,KAAK,GAAG,KAA2B,CAAC;gBAC1C,mFAAmF;gBACnF,wFAAwF;gBACxF,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAE5E,uFAAuF;gBACvF,0FAA0F;gBAC1F,6FAA6F;gBAC7F,mFAAmF;gBACnF,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE;4BACP,OAAO,EAAE,2EAA2E;4BACpF,MAAM,EAAE,sCAAsC;4BAC9C,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;yBACpD;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,0BAA0B,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACzF,MAAM,EAAE,6BAA6B;oBACrC,kBAAkB;iBACnB,CAAC,CAAC;gBAEH,MAAM,0BAA0B,CAC9B,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EACzH,gBAAgB,EAChB,KAAK,CACN,CAAC;gBAEF,OAAO,KAAK,CAAC;YACf,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,mCAAmC;IACjD,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB,EAAE,2BAA2B,CAAC,IAAI;YACrD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,yBAAyB;QACrC,+FAA+F;QAC/F,6FAA6F;QAC7F,uFAAuF;QACvF,iBAAiB,EAAE,IAAI;QACvB,uBAAuB,EAAE,EAAE;QAC3B,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBAClF,qFAAqF;gBACrF,yFAAyF;gBACzF,mBAAmB;gBACnB,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE;4BACP,OAAO,EAAE,yDAAyD;4BAClE,MAAM,EAAE,oCAAoC;4BAC5C,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;yBACpD;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,SAAS,GAAG,KAAsC,CAAC;gBACzD,MAAM,cAAc,GAAG,SAAS,CAAC,eAAe,KAAK,SAAS,IAAI,SAAS,CAAC,eAAe,KAAK,IAAI,CAAC;gBACrG,IAAI,cAAc,IAAI,CAAC,OAAO,SAAS,CAAC,eAAe,KAAK,QAAQ,IAAI,SAAS,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;oBAChH,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE,EAAE,OAAO,EAAE,0FAA0F,EAAE,MAAM,EAAE,8CAA8C,EAAE;qBACzK,CAAC,CAAC;gBACL,CAAC;gBACD,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAE,SAAS,CAAC,eAA0B,CAAC,CAAC,CAAC,SAAS,CAAC;gBAE3F,MAAM,IAAI,GAAG,MAAM,0BAA0B,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACzF,MAAM,EAAE,6BAA6B;oBACrC,kBAAkB;iBACnB,CAAC,CAAC;gBAEH,IAAI,eAAe,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;oBACjC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;wBACxE,sBAAsB,EAAE,2BAA2B,CAAC,+BAA+B;wBACnF,OAAO,EAAE,EAAE,MAAM,EAAE,kCAAkC,EAAE,kBAAkB,EAAE,IAAI,CAAC,GAAG,EAAE;qBACtF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,aAAa,GAAG,eAAe;oBACnC,CAAC,CAAC,MAAM,0BAA0B,CAAC,eAAe,EAAE,gBAAgB,EAAE,KAAK,EAAE;wBAC3E,MAAM,EAAE,yCAAyC;wBACjD,eAAe;qBAChB,CAAC;oBACF,CAAC,CAAC,IAAI,CAAC;gBAET,0FAA0F;gBAC1F,oFAAoF;gBACpF,IAAI,aAAa,IAAI,2BAA2B,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBACtE,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;wBACxE,sBAAsB,EAAE,2BAA2B,CAAC,+BAA+B;wBACnF,OAAO,EAAE;4BACP,MAAM,EAAE,2CAA2C;4BACnD,kBAAkB,EAAE,IAAI,CAAC,GAAG;4BAC5B,eAAe;yBAChB;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,2FAA2F;gBAC3F,2FAA2F;gBAC3F,0FAA0F;gBAC1F,MAAM,0BAA0B,CAC9B,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,EAAE,eAAe,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EACzG,gBAAgB,EAChB,KAAK,CACN,CAAC;gBAEF,yFAAyF;gBACzF,oFAAoF;gBACpF,MAAM,gBAAgB,GAAG,6BAA6B,CAAC,IAAI,CAAC,CAAC;gBAC7D,MAAM,WAAW,GAAG,8BAA8B,CAAC,aAAa,CAAC,CAAC;gBAClE,MAAM,gBAAgB,GAAG,GAAG,WAAW,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;gBAEtD,MAAM,WAAW,GAAG,MAAM,+BAA+B,CAAC,IAAI,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;gBACzF,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;gBACrG,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,MAAM,cAAc,CAAC,MAAM,CACzB,gBAAgB,EAChB,UAAU,CAAC,GAAG,EACd,EAAE,IAAI,EAAE,0BAA0B,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,EAAS,EAChG,KAAK,CAAC,cAAc,CACrB,CAAC;gBACJ,CAAC;gBAED,yFAAyF;gBACzF,yFAAyF;gBACzF,OAAO,EAAE,YAAY,EAAE,eAAe,IAAI,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;YACtE,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,6CAA6C,CACpD,mBAA8F;IAE9F,MAAM,SAAS,GAAG,mBAAmB,KAAK,2BAA2B,CAAC,OAAO,CAAC;IAE9E,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB;YACnB,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,sBAAsB,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,EAAE;QACrE,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBACnF,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE;4BACP,OAAO,EAAE,qBAAqB,mBAAmB,CAAC,WAAW,EAAE,mCAAmC;4BAClG,MAAM,EAAE,iDAAiD;4BACzD,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;yBACpD;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,0BAA0B,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACzF,MAAM,EAAE,6BAA6B;oBACrC,kBAAkB;iBACnB,CAAC,CAAC;gBAEH,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,KAAK,sBAAsB,CAAC,QAAQ,CAAC;gBACxE,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;oBAClC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;wBACxE,sBAAsB,EAAE,2BAA2B,CAAC,0BAA0B;wBAC9E,OAAO,EAAE;4BACP,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,oCAAoC,CAAC,CAAC,CAAC,gCAAgC;4BAC3F,kBAAkB,EAAE,IAAI,CAAC,GAAG;4BAC5B,aAAa,EAAE,IAAI,CAAC,MAAM;yBAC3B;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,6EAA6E;oBAC7E,KAAK,MAAM,UAAU,IAAI,2BAA2B,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC3D,MAAM,QAAQ,GAAG,MAAM,0BAA0B,CAAC,UAAU,EAAE,gBAAgB,EAAE,KAAK,EAAE;4BACrF,MAAM,EAAE,sCAAsC;4BAC9C,kBAAkB,EAAE,IAAI,CAAC,GAAG;4BAC5B,cAAc,EAAE,UAAU;yBAC3B,CAAC,CAAC;wBACH,IAAI,QAAQ,CAAC,MAAM,KAAK,sBAAsB,CAAC,QAAQ,EAAE,CAAC;4BACxD,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;gCACxE,sBAAsB,EAAE,2BAA2B,CAAC,0BAA0B;gCAC9E,OAAO,EAAE;oCACP,MAAM,EAAE,2CAA2C;oCACnD,kBAAkB,EAAE,IAAI,CAAC,GAAG;oCAC5B,sBAAsB,EAAE,QAAQ,CAAC,GAAG;iCACrC;6BACF,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,8FAA8F;gBAC9F,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC;YACjG,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,OAAgE,CAAC;AAC1E,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,+CAA+C;IAC7D,OAAO;QACL,6CAA6C,CAAC,2BAA2B,CAAC,OAAO,CAAC;QAClF,6CAA6C,CAAC,2BAA2B,CAAC,OAAO,CAAC;KACnF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oDAAoD;IAClE,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE;QAC7E,OAAO,yCAAyC,CAAC;YAC/C,aAAa,EAAE;gBACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;gBACvD,mBAAmB,EAAE,qBAAqB,CAAC,MAAM;gBACjD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;gBAClD,kBAAkB,EAAE,IAAI;aACzB;YACD,QAAQ,EAAE;gBACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;oBAClF,yFAAyF;oBACzF,yFAAyF;oBACzF,0FAA0F;oBAC1F,4FAA4F;oBAC5F,+BAA+B;oBAC/B,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;oBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;wBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;4BAC1E,OAAO,EAAE;gCACP,OAAO,EAAE,gFAAgF;gCACzF,YAAY,EAAE,gBAAgB,CAAC,kBAAkB;gCACjD,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;6BACpD;yBACF,CAAC,CAAC;oBACL,CAAC;oBAED,MAAM,kCAAkC,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;oBAEtF,kEAAkE;oBAClE,OAAO,KAAK,CAAC;gBACf,CAAC;aACF;SACF,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["/*\n Organization Unit Custom Implementations\n \n DELETE dependents guard: refuses to delete an interior node of the organization tree while\n * child units still hang off it.\n /\n\nimport {\n CoreResourceOperation,\n CoreResourceType,\n ErrorType,\n ErrorCustomMessageReference,\n OrganizationUnitStatus,\n OrganizationUnit_Operations,\n ResourceOperationVariantType,\n coreResourceShared_FieldIdentifier,\n buildOrganizationUnitChildPath,\n isOrganizationUnitInSubtree,\n organizationUnitAncestorIds,\n organizationUnitSubtreePrefix,\n rebaseOrganizationUnitPath,\n type OrganizationUnit,\n} from '@wildo-ai/saas-models';\nimport {\n createResourceCustomServiceImplementation,\n type ResourceCustomServiceImplementationFactory,\n} from '~wildo-backend-lib/base-classes/services/services/resource-operation-custom-implementation.factory.backend';\nimport type { ResourcesRegistryBackendService } from '~wildo-backend-lib/resources/services/resources-registry.backend.service';\nimport type { ResourceOperation_CustomImplementation_Utils } from '~wildo-backend-lib/base-classes/services/services/resource-operation-custom-implementation-base.backend.service';\nimport type { ExecutionContext } from '~wildo-backend-lib/runtime/models/execution-context.backend.schemas';\nimport {\n describeUnaddressableShape,\n resolveSingleSubjectId,\n} from '~wildo-backend-lib/base-classes/utils/single-subject-addressing.backend.utils';\n\n/\n The FK that materializes the organization-unit tree: a unit's parent node.\n \n Typed against {@link OrganizationUnit} so a rename of the field breaks the build here rather\n * than silently degrading the guard into a filter that matches nothing.\n /\nconst PARENT_UNIT_FK_FIELD: Extract<keyof OrganizationUnit, 'parentUnitId'> = 'parentUnitId';\n\n/\n Refuse removal of an organization unit while child units still hang off it.\n \n ## Why this guard exists\n \n `ORGANIZATION_UNITS -> ORGANIZATION_UNITS` (the tree self-edge on `parentUnitId`) is the ONE\n * `ORGANIZATIONS`-family relationship that declares no `onParentDelete` cascade. Deleting an\n * interior node therefore strands its entire subtree: every descendant keeps a `parentUnitId`\n * pointing at a row that no longer exists, and the materialized `path` of the whole branch — a\n * server-computed field (`.excludeFromCreate().excludeFromUpdate()`) that nothing recomputes —\n * silently describes a hierarchy that is no longer real. Neither is recoverable from the\n * remaining data, because the deleted node held the only link between the branch and its\n * grandparent.\n \n Enabling a cascade instead was rejected: the spec's stated policy is that the operator decides\n * where an orphaned branch belongs, and silently hard-deleting an arbitrarily deep subtree behind\n * a single-node DELETE is a far worse default for a `HIGH` risk-level operation than refusing it.\n \n The remedy is MOVE: re-parent each child onto another node, then delete the emptied leaf. MOVE\n * rewrites the materialized `path` of the whole subtree in one transaction, which a raw\n * `parentUnitId` edit never did — which is why `parentUnitId` became `.excludeFromUpdate()` in the\n * same pass that implemented MOVE (plan decision D-B2). Until then the guard's only escape hatch was\n * that raw edit, and it silently left every descendant's path describing a tree that no longer\n * existed.\n \n ## Scope: direct per-unit DELETE only\n \n Deleting the whole ORGANIZATION is a different path and is deliberately NOT affected. That\n * cascade IS enabled (`ORGANIZATIONS -> ORGANIZATION_UNITS`) and removes every unit of the\n * tenant in one pass — depth is irrelevant there because every unit, root or nested, carries the\n * tenant's `organizationId`. It also runs at the REPOSITORY level, which does not execute service\n * custom implementations, so this guard is structurally never consulted on that path. Tearing a\n * tenant down does not require dismantling its org chart leaf-by-leaf first.\n \n ## Why it fails closed\n \n DELETE is `riskLevel: HIGH`, so \"cannot verify\" must never read as \"nothing found\". An\n * unregistered `ORGANIZATION_UNITS` repository raises `CONFIGURATION` rather than being skipped,\n * and any scope-filter failure inside the read propagates instead of being swallowed.\n \n Detection uses `read()` rather than `count()` deliberately: `ORGANIZATION_UNITS` declares no\n * `COUNT` core operation, so `repository.count()` would throw INTERNAL. It does declare `READ`.\n * The read is a single indexed hit on `parentUnitId` (`.isDBIndexed()`), and the guard only needs\n * existence, not a tally.\n \n ## Also covered: unit assignments (since D-B5)\n \n Assigned members block the delete too. This dependent used to be EXCLUDED: unit assignment lived\n * in an embedded `OrganizationMember.organizationUnitsMembership` array, which is not a registered\n * relationship and has no adapter-neutral query — a dot-path filter into a JSONB array resolves to\n * NULL on PostgreSQL (matching nothing) and the LIST summary projection strips the field entirely,\n * so BOTH available scans would have failed OPEN on a guard whose whole purpose is to fail closed.\n * Promoting the assignment to the `ORGANIZATION_UNIT_MEMBERS` junction is exactly what made it\n * checkable, and it is now checked here on the same fail-closed terms as child units.\n \n @param unitId - The unit row about to be deleted.\n * @throws `CONFLICT` (409, `ORGANIZATION_UNIT_HAS_DEPENDENTS`) carrying whichever dependent blocked:\n * `blockingChildUnitId` for a child unit, `blockingUnitMemberId` for a member assignment.\n * @throws `CONFIGURATION` when the organization-units repository is not registered (unverifiable).\n /\nexport async function assertNoOrganizationUnitDependents(\n unitId: string,\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n): Promise<void> {\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n\n // Fail closed: an unregistered repository means we cannot prove the node is a leaf. Skipping\n // would silently downgrade the guard to \"nothing found\".\n if (!unitRepository) {\n throw utils.errorBuilder.buildError(ErrorType.CONFIGURATION, executionContext, {\n customMessageReference: ErrorCustomMessageReference.CONFIGURATION,\n context: {\n message: 'Cannot verify organization-unit dependents: the organization-units repository is not registered',\n organizationUnitId: unitId,\n childResourceType: CoreResourceType.ORGANIZATION_UNITS,\n },\n });\n }\n\n const blockingChildUnit = await unitRepository.read<OrganizationUnit>(executionContext, {\n [PARENT_UNIT_FK_FIELD]: unitId,\n });\n\n if (blockingChildUnit) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_HAS_DEPENDENTS,\n context: {\n organizationUnitId: unitId,\n blockingChildUnitId: blockingChildUnit._id,\n blockingChildUnitName: blockingChildUnit.name,\n },\n });\n }\n\n // Assigned members — checkable since D-B5 promoted unit assignment to a real junction resource.\n // Same fail-closed terms as the child-unit scan above: an unregistered repository means we cannot\n // prove the unit is unassigned, which must never read as \"nothing found\" on a HIGH-risk delete.\n const unitMemberRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNIT_MEMBERS);\n if (!unitMemberRepository) {\n throw utils.errorBuilder.buildError(ErrorType.CONFIGURATION, executionContext, {\n customMessageReference: ErrorCustomMessageReference.CONFIGURATION,\n context: {\n message: 'Cannot verify organization-unit assignments: the organization-unit-members repository is not registered',\n organizationUnitId: unitId,\n childResourceType: CoreResourceType.ORGANIZATION_UNIT_MEMBERS,\n },\n });\n }\n\n const blockingAssignment = await unitMemberRepository.read<{ _id: string; organizationMemberId: string }>(\n executionContext,\n { organizationUnitId: unitId },\n );\n\n if (blockingAssignment) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_HAS_DEPENDENTS,\n context: {\n organizationUnitId: unitId,\n blockingUnitMemberId: blockingAssignment._id,\n blockingOrganizationMemberId: blockingAssignment.organizationMemberId,\n },\n });\n }\n}\n\n/* The unit fields these implementations read; kept narrow so a schema rename breaks the build here. /\ntype OrganizationUnitTreeNodeRow = Pick<OrganizationUnit, '_id' \| 'organizationId' \| 'parentUnitId' \| 'path' \| 'status' \| 'code' \| 'name'>;\n\n/\n Load a unit that MUST exist inside the caller's scope, or fail with 404.\n \n Cross-tenant lookups resolve to \"not found\" rather than a conflict on purpose: the contextual\n * filter scopes the read to the caller's organization, so a unit belonging to another tenant is\n * simply absent. Reporting 409 there would confirm the existence of a row the caller may not see.\n /\nasync function loadScopedOrganizationUnit(\n unitId: string,\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n notFoundContext: Record<string, unknown>,\n): Promise<OrganizationUnitTreeNodeRow> {\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n if (!unitRepository) {\n throw utils.errorBuilder.buildError(ErrorType.CONFIGURATION, executionContext, {\n customMessageReference: ErrorCustomMessageReference.CONFIGURATION,\n context: { message: 'The organization-units repository is not registered', ...notFoundContext },\n });\n }\n\n const unit = await unitRepository.read<OrganizationUnitTreeNodeRow>(executionContext, { _id: unitId });\n if (!unit) {\n throw utils.errorBuilder.buildError(ErrorType.NOT_FOUND, executionContext, {\n customMessageReference: ErrorCustomMessageReference.NOT_FOUND,\n context: notFoundContext,\n });\n }\n return unit;\n}\n\n/\n Every unit strictly below `unit`, found by the materialized-path prefix.\n \n Uses `listForInternalScan` rather than `list`: this is an internal integrity sweep, and the LIST\n * summary projection would strip `path` — the one field the rewrite depends on.\n /\nasync function listOrganizationUnitDescendants(\n unit: OrganizationUnitTreeNodeRow,\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n): Promise<OrganizationUnitTreeNodeRow[]> {\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n const subtreePrefix = organizationUnitSubtreePrefix(unit);\n\n // Filter on the organization, then narrow by prefix in memory. An adapter-neutral \"starts with\"\n // filter does not exist across Mongo and SQL, and inventing one per adapter here would put a\n // query dialect inside a domain rule. Org trees are small (hundreds of nodes), and the scan is\n // already scoped to a single tenant.\n const scoped = await unitRepository.listForInternalScan<OrganizationUnitTreeNodeRow>(\n executionContext,\n { organizationId: unit.organizationId },\n utils.serviceOptions,\n );\n const rows: OrganizationUnitTreeNodeRow[] = Array.isArray(scoped) ? scoped : (scoped as { data: OrganizationUnitTreeNodeRow[] }).data;\n return rows.filter((row) => row._id !== unit._id && isOrganizationUnitInSubtree(row, unit));\n}\n\n/\n Refuse a `code` that is already taken by a sibling under `parentUnitId`.\n \n Sibling-scoped rather than org-wide: two teams called `sales` under different divisions are a\n * legitimate org chart, and `code` is optional so many rows carry none at all. That exact identity\n * — (`organizationId`, `parentUnitId`, `code`), scoped to rows that HAVE a code — is now also the\n * schema's business key, so MongoDB enforces it with a partial compound unique index.\n \n This guard is deliberately KEPT rather than deleted as redundant. Schema-declared uniqueness\n * is emitted for MongoDB only; the SQL planner records it as intent and leaves enforcement\n * migration-owned, so on a SQL adapter this function is the ONLY thing standing between two\n * same-coded siblings. It is a read-then-write and therefore still racy — under concurrency the\n * index is what actually closes the window on Mongo — but a racy check that usually wins is\n * strictly better than no check at all on an adapter that has no index to fall back to.\n \n Both layers raise the SAME reference. The index cannot know which operation was running, so an\n * operation-specific code would make one condition report differently depending on which write won\n * the race — an API client would have to handle both to recognise one situation.\n /\nasync function assertSiblingCodeAvailable(\n candidate: { unitId: string; organizationId: string; parentUnitId: string \| undefined; code: string \| undefined },\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n): Promise<void> {\n if (!candidate.code) return;\n\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n const sibling = await unitRepository.read<OrganizationUnitTreeNodeRow>(executionContext, {\n organizationId: candidate.organizationId,\n parentUnitId: candidate.parentUnitId ?? null,\n code: candidate.code,\n });\n\n if (sibling && sibling._id !== candidate.unitId) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_CODE_EXISTS,\n context: {\n reason: 'organization_unit_sibling_code_taken',\n organizationUnitId: candidate.unitId,\n conflictingUnitId: sibling._id,\n parentUnitId: candidate.parentUnitId ?? null,\n code: candidate.code,\n },\n });\n }\n}\n\n/\n CREATE prefix — materialize `path` on the SAME write that inserts the row.\n \n `path` is `.excludeFromCreate()` and was previously never written by anything, so every unit\n * persisted with an empty hierarchy path (the defect this closes). The prefix's return value is\n * merged into the create payload and passed through the loose repository write, which is how a\n * server-owned field reaches persistence without being client-settable.\n \n The path is derived from the PARENT alone — see the format contract in\n * `organization-units.shared.path.ts` for why it cannot include the new row's own id.\n /\nexport function createOrganizationUnitCreatePathFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: CoreResourceOperation.CREATE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: 'organization-units.create.path-materialization',\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n const authored = input as { parentUnitId?: string; organizationId?: string; code?: string };\n\n const organizationId = authored.organizationId\n ?? executionContext.getContextResourceId?.(coreResourceShared_FieldIdentifier[CoreResourceType.ORGANIZATIONS])\n ?? executionContext.initiatorIds?.organizationId;\n\n if (!organizationId) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: { message: 'An organization scope is required to place a unit in the tree', reason: 'organization_unit_create_unscoped' },\n });\n }\n\n // A parent that was NAMED but cannot be resolved must fail, never silently fall back to\n // root: the scoped read returns nothing for a unit in another tenant, and treating that as\n // \"no parent\" would quietly promote a cross-tenant child to a root of the caller's tree.\n const parentUnit = authored.parentUnitId\n ? await loadScopedOrganizationUnit(authored.parentUnitId, executionContext, utils, {\n reason: 'organization_unit_parent_not_found',\n parentUnitId: authored.parentUnitId,\n })\n : null;\n\n await assertSiblingCodeAvailable(\n { unitId: '', organizationId, parentUnitId: authored.parentUnitId, code: authored.code },\n executionContext,\n utils,\n );\n\n return { ...input, organizationId, path: buildOrganizationUnitChildPath(parentUnit) };\n },\n },\n });\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n\n/\n UPDATE prefix — keep sibling `code` unambiguous on a rename.\n \n Re-parenting is no longer reachable here (`parentUnitId` is `.excludeFromUpdate()` since MOVE\n * shipped — D-B2), so the only structural collision generic UPDATE can still cause is two same-coded\n * siblings under one parent. That is the surviving half of the spec's `ORGANIZATION_UNIT_CONFLICT`\n * scenario; the cycle half now lives entirely under MOVE.\n /\nexport function createOrganizationUnitUpdateFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: CoreResourceOperation.UPDATE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: 'organization-units.update.sibling-code-guard',\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n const patch = input as { code?: unknown };\n // Only a rename can collide. An update that leaves `code` alone cannot introduce a\n // duplicate, and re-checking it would 409 every unrelated edit of an already-valid row.\n if (typeof patch.code !== 'string' \|\| patch.code.length === 0) return input;\n\n // Resolve rather than cast. The former `_id as string` asserted a shape the addressing\n // contract does not guarantee: a filter-addressed rename would have handed an OBJECT to a\n // by-id read, which builds `{ _id: <object> }` and matches nothing — surfacing as a spurious\n // NOT_FOUND while the sibling-code collision it was meant to catch went unchecked.\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: 'Organization unit UPDATE renaming `code` requires a single addressed unit',\n reason: 'organization_unit_rename_unaddressed',\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n const unit = await loadScopedOrganizationUnit(organizationUnitId, executionContext, utils, {\n reason: 'organization_unit_not_found',\n organizationUnitId,\n });\n\n await assertSiblingCodeAvailable(\n { unitId: unit._id, organizationId: unit.organizationId, parentUnitId: unit.parentUnitId ?? undefined, code: patch.code },\n executionContext,\n utils,\n );\n\n return input;\n },\n },\n });\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n\n/\n MOVE — re-parent a unit and re-home its entire subtree.\n \n The descendant rewrite is the part that must never be skipped: leaving it out is exactly the\n * \"materialized field nothing recomputes\" bug that `path` was already an instance of. Because the\n * rewrite spans many rows, the whole operation runs in one transaction — a partial rewrite would\n * leave the tree describing a shape that never existed.\n \n An absent `newParentUnitId` means \"promote to root\", which the request DTO models as optional. A\n * present-but-blank value is malformed and is refused rather than silently read as a promotion.\n \n ⚠️ Cost: the subtree rewrite is a scan plus one `update()` per descendant. `repository.updateMany`\n * is unavailable here — it requires an `UPDATE_MANY` core operation, which this resource does not\n * declare. Acceptable while org charts are small; revisit if deep trees appear.\n /\nexport function createOrganizationUnitMoveFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: OrganizationUnit_Operations.MOVE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: 'organization-units.move',\n // The subtree rewrite spans many ORGANIZATION_UNITS rows plus the moved node itself. A partial\n // rewrite would leave the tree describing a shape that never existed, so they share one unit\n // of work. No OTHER resource participates — the move is entirely within the unit tree.\n transactionalCore: true,\n transactionParticipants: {},\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n // A conditional `{ _id, … }` filter names one unit and is admitted; only a genuinely\n // population-addressed move is refused, since the subtree rewrite below is computed from\n // ONE node's path.\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: 'Organization unit MOVE requires a single addressed unit',\n reason: 'organization_unit_move_unaddressed',\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n const requested = input as { newParentUnitId?: unknown };\n const hasDestination = requested.newParentUnitId !== undefined && requested.newParentUnitId !== null;\n if (hasDestination && (typeof requested.newParentUnitId !== 'string' \|\| requested.newParentUnitId.length === 0)) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: { message: 'newParentUnitId must be a non-empty unit id, or be omitted to promote the unit to a root', reason: 'organization_unit_move_malformed_destination' },\n });\n }\n const newParentUnitId = hasDestination ? (requested.newParentUnitId as string) : undefined;\n\n const unit = await loadScopedOrganizationUnit(organizationUnitId, executionContext, utils, {\n reason: 'organization_unit_not_found',\n organizationUnitId,\n });\n\n if (newParentUnitId === unit._id) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_MOVE_CONFLICT,\n context: { reason: 'organization_unit_move_onto_self', organizationUnitId: unit._id },\n });\n }\n\n const newParentUnit = newParentUnitId\n ? await loadScopedOrganizationUnit(newParentUnitId, executionContext, utils, {\n reason: 'organization_unit_destination_not_found',\n newParentUnitId,\n })\n : null;\n\n // O(1) cycle test — the payoff of the materialized path. Moving a node beneath one of its\n // own descendants would detach the branch: it would have no route back to the root.\n if (newParentUnit && isOrganizationUnitInSubtree(newParentUnit, unit)) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_MOVE_CONFLICT,\n context: {\n reason: 'organization_unit_move_would_create_cycle',\n organizationUnitId: unit._id,\n newParentUnitId,\n },\n });\n }\n\n // Raises ORGANIZATION_UNIT_CODE_EXISTS, not MOVE_CONFLICT: the destination itself is legal\n // here — it is the unit's own `code` that collides — so renaming the unit is a remedy that\n // choosing another destination is not. The two conditions want different client handling.\n await assertSiblingCodeAvailable(\n { unitId: unit._id, organizationId: unit.organizationId, parentUnitId: newParentUnitId, code: unit.code },\n executionContext,\n utils,\n );\n\n // Re-home the branch. Descendants are rewritten BEFORE the node's own update lands, so a\n // failure anywhere rolls the whole move back rather than leaving a half-moved tree.\n const oldSubtreePrefix = organizationUnitSubtreePrefix(unit);\n const newUnitPath = buildOrganizationUnitChildPath(newParentUnit);\n const newSubtreePrefix = `${newUnitPath}${unit._id}/`;\n\n const descendants = await listOrganizationUnitDescendants(unit, executionContext, utils);\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n for (const descendant of descendants) {\n await unitRepository.update(\n executionContext,\n descendant._id,\n { path: rebaseOrganizationUnitPath(descendant.path, oldSubtreePrefix, newSubtreePrefix) } as any,\n utils.serviceOptions,\n );\n }\n\n // The MOVE request DTO names no schema field, so the core UPDATE must be handed the real\n // mutation. `parentUnitId: null` (not `undefined`) is what clears the FK on a promotion.\n return { parentUnitId: newParentUnitId ?? null, path: newUnitPath };\n },\n },\n });\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n\n/\n ARCHIVE / RESTORE — node-only status transitions (plan decision Q-B1).\n \n Archiving a branch marks ONLY the node: descendants keep their own status, which makes ARCHIVE\n * O(1) and keeps restore order explicit. RESTORE pays for that by validating the ancestor chain —\n * restoring a node under a still-archived parent would leave an active unit reachable only through\n * an inactive one, which is the inconsistency the spec's 409 describes.\n /\nfunction createOrganizationUnitStatusTransitionFactory(\n operationIdentifier: OrganizationUnit_Operations.ARCHIVE \| OrganizationUnit_Operations.RESTORE,\n): ResourceCustomServiceImplementationFactory {\n const isArchive = operationIdentifier === OrganizationUnit_Operations.ARCHIVE;\n\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: `organization-units.${isArchive ? 'archive' : 'restore'}`,\n handlers: {\n prefixCoreOperations: async (_id, _input, executionContext, _operationPath, utils) => {\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: `Organization unit ${operationIdentifier.toUpperCase()} requires a single addressed unit`,\n reason: 'organization_unit_status_transition_unaddressed',\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n const unit = await loadScopedOrganizationUnit(organizationUnitId, executionContext, utils, {\n reason: 'organization_unit_not_found',\n organizationUnitId,\n });\n\n const alreadyArchived = unit.status === OrganizationUnitStatus.ARCHIVED;\n if (isArchive === alreadyArchived) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_CONFLICT,\n context: {\n reason: isArchive ? 'organization_unit_already_archived' : 'organization_unit_not_archived',\n organizationUnitId: unit._id,\n currentStatus: unit.status,\n },\n });\n }\n\n if (!isArchive) {\n // Restore order is explicit: every ancestor must already be out of ARCHIVED.\n for (const ancestorId of organizationUnitAncestorIds(unit)) {\n const ancestor = await loadScopedOrganizationUnit(ancestorId, executionContext, utils, {\n reason: 'organization_unit_ancestor_not_found',\n organizationUnitId: unit._id,\n ancestorUnitId: ancestorId,\n });\n if (ancestor.status === OrganizationUnitStatus.ARCHIVED) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_CONFLICT,\n context: {\n reason: 'organization_unit_ancestor_still_archived',\n organizationUnitId: unit._id,\n blockingAncestorUnitId: ancestor._id,\n },\n });\n }\n }\n }\n\n // As with MOVE, the request DTO carries only `reason`, so the real mutation is supplied here.\n return { status: isArchive ? OrganizationUnitStatus.ARCHIVED : OrganizationUnitStatus.ACTIVE };\n },\n },\n });\n\n return factory as unknown as ResourceCustomServiceImplementationFactory;\n}\n\n/* ARCHIVE + RESTORE implementations. /\nexport function createOrganizationUnitStatusTransitionFactories(): ResourceCustomServiceImplementationFactory[] {\n return [\n createOrganizationUnitStatusTransitionFactory(OrganizationUnit_Operations.ARCHIVE),\n createOrganizationUnitStatusTransitionFactory(OrganizationUnit_Operations.RESTORE),\n ];\n}\n\n/\n Register {@link assertNoOrganizationUnitDependents} as the `ORGANIZATION_UNITS` DELETE prefix.\n \n PREFIX: refuses the delete with 409 `ORGANIZATION_UNIT_HAS_DEPENDENTS` while any child unit\n * still names this node as its parent. There is no CORE replacement — when the guard passes, the\n * standard DELETE proceeds untouched.\n \n Registered on `API_CALL` — the variant the resource configuration actually declares for DELETE.\n * Custom implementations are resolved by an exact operation-path key that embeds `variantType`,\n * so a guard registered under any other variant would never run.\n */\nexport function createOrganizationUnitDeleteDependentsGuardFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) => {\n return createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: CoreResourceOperation.DELETE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n // Fail closed: the dependent scan filters on a single unit id, so a POPULATION-addressed\n // delete (an ids array or an unpinned filter reaching this path via `doByOperationPath`)\n // must be refused rather than silently producing a filter that matches nothing and waving\n // the delete through. A conditional `{ _id, … }` filter resolves to the one unit the delete\n // can destroy and is admitted.\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: 'Organization unit DELETE requires a single addressed unit to verify dependents',\n resourceType: CoreResourceType.ORGANIZATION_UNITS,\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n await assertNoOrganizationUnitDependents(organizationUnitId, executionContext, utils);\n\n // Guard only — the core DELETE input is passed through unchanged.\n return input;\n },\n },\n });\n };\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n"]}
1	+ {"version":3,"file":"organization-unit-custom-implementation.backend.service.js","sourceRoot":"","sources":["../../../../../src/organizations/services/organization-unit-custom-implementation.backend.service.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,SAAS,EACT,2BAA2B,EAC3B,sBAAsB,EACtB,2BAA2B,EAC3B,4BAA4B,EAC5B,kCAAkC,EAClC,8BAA8B,EAC9B,2BAA2B,EAC3B,2BAA2B,EAC3B,6BAA6B,EAC7B,0BAA0B,GAE3B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,yCAAyC,GAE1C,MAAM,4GAA4G,CAAC;AAIpH,OAAO,EACL,0BAA0B,EAC1B,sBAAsB,GACvB,MAAM,+EAA+E,CAAC;AAEvF;;;;;GAKG;AACH,MAAM,oBAAoB,GAAoD,cAAc,CAAC;AAE7F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2DG;AACH,MAAM,CAAC,KAAK,UAAU,kCAAkC,CACtD,MAAc,EACd,gBAAuC,EACvC,KAAmD;IAEnD,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IAErG,6FAA6F;IAC7F,yDAAyD;IACzD,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,EAAE,gBAAgB,EAAE;YAC7E,sBAAsB,EAAE,2BAA2B,CAAC,aAAa;YACjE,OAAO,EAAE;gBACP,OAAO,EAAE,iGAAiG;gBAC1G,kBAAkB,EAAE,MAAM;gBAC1B,iBAAiB,EAAE,gBAAgB,CAAC,kBAAkB;aACvD;SACF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,iBAAiB,GAAG,MAAM,cAAc,CAAC,IAAI,CAAmB,gBAAgB,EAAE;QACtF,CAAC,oBAAoB,CAAC,EAAE,MAAM;KAC/B,CAAC,CAAC;IAEH,IAAI,iBAAiB,EAAE,CAAC;QACtB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;YACxE,sBAAsB,EAAE,2BAA2B,CAAC,gCAAgC;YACpF,OAAO,EAAE;gBACP,kBAAkB,EAAE,MAAM;gBAC1B,mBAAmB,EAAE,iBAAiB,CAAC,GAAG;gBAC1C,qBAAqB,EAAE,iBAAiB,CAAC,IAAI;aAC9C;SACF,CAAC,CAAC;IACL,CAAC;IAED,gGAAgG;IAChG,kGAAkG;IAClG,gGAAgG;IAChG,MAAM,oBAAoB,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,yBAAyB,CAAC,CAAC;IAClH,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC1B,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,EAAE,gBAAgB,EAAE;YAC7E,sBAAsB,EAAE,2BAA2B,CAAC,aAAa;YACjE,OAAO,EAAE;gBACP,OAAO,EAAE,yGAAyG;gBAClH,kBAAkB,EAAE,MAAM;gBAC1B,iBAAiB,EAAE,gBAAgB,CAAC,yBAAyB;aAC9D;SACF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,kBAAkB,GAAG,MAAM,oBAAoB,CAAC,IAAI,CACxD,gBAAgB,EAChB,EAAE,kBAAkB,EAAE,MAAM,EAAE,CAC/B,CAAC;IAEF,IAAI,kBAAkB,EAAE,CAAC;QACvB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;YACxE,sBAAsB,EAAE,2BAA2B,CAAC,gCAAgC;YACpF,OAAO,EAAE;gBACP,kBAAkB,EAAE,MAAM;gBAC1B,oBAAoB,EAAE,kBAAkB,CAAC,GAAG;gBAC5C,4BAA4B,EAAE,kBAAkB,CAAC,oBAAoB;aACtE;SACF,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAKD;;;;;;GAMG;AACH,KAAK,UAAU,0BAA0B,CACvC,MAAc,EACd,gBAAuC,EACvC,KAAmD,EACnD,eAAwC;IAExC,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IACrG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,aAAa,EAAE,gBAAgB,EAAE;YAC7E,sBAAsB,EAAE,2BAA2B,CAAC,aAAa;YACjE,OAAO,EAAE,EAAE,OAAO,EAAE,qDAAqD,EAAE,GAAG,eAAe,EAAE;SAChG,CAAC,CAAC;IACL,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,cAAc,CAAC,IAAI,CAA8B,gBAAgB,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IACvG,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE;YACzE,sBAAsB,EAAE,2BAA2B,CAAC,SAAS;YAC7D,OAAO,EAAE,eAAe;SACzB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,+BAA+B,CAC5C,IAAiC,EACjC,gBAAuC,EACvC,KAAmD;IAEnD,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IACrG,MAAM,aAAa,GAAG,6BAA6B,CAAC,IAAI,CAAC,CAAC;IAE1D,gGAAgG;IAChG,6FAA6F;IAC7F,+FAA+F;IAC/F,qCAAqC;IACrC,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,mBAAmB,CACrD,gBAAgB,EAChB,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,EACvC,KAAK,CAAC,cAAc,CACrB,CAAC;IACF,MAAM,IAAI,GAAkC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,MAAkD,CAAC,IAAI,CAAC;IACtI,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,2BAA2B,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,KAAK,UAAU,0BAA0B,CACvC,SAAiH,EACjH,gBAAuC,EACvC,KAAmD;IAEnD,IAAI,CAAC,SAAS,CAAC,IAAI;QAAE,OAAO;IAE5B,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;IACrG,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAA8B,gBAAgB,EAAE;QACvF,cAAc,EAAE,SAAS,CAAC,cAAc;QACxC,YAAY,EAAE,SAAS,CAAC,YAAY,IAAI,IAAI;QAC5C,IAAI,EAAE,SAAS,CAAC,IAAI;KACrB,CAAC,CAAC;IAEH,IAAI,OAAO,IAAI,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;QAChD,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;YACxE,sBAAsB,EAAE,2BAA2B,CAAC,6BAA6B;YACjF,OAAO,EAAE;gBACP,MAAM,EAAE,sCAAsC;gBAC9C,kBAAkB,EAAE,SAAS,CAAC,MAAM;gBACpC,iBAAiB,EAAE,OAAO,CAAC,GAAG;gBAC9B,YAAY,EAAE,SAAS,CAAC,YAAY,IAAI,IAAI;gBAC5C,4FAA4F;gBAC5F,4FAA4F;gBAC5F,gGAAgG;gBAChG,mBAAmB,EAAE,SAAS,CAAC,IAAI;aACpC;SACF,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,yCAAyC;IACvD,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB,EAAE,qBAAqB,CAAC,MAAM;YACjD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,gDAAgD;QAC5D,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBAClF,MAAM,QAAQ,GAAG,KAA0E,CAAC;gBAE5F,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc;uBACzC,gBAAgB,CAAC,oBAAoB,EAAE,CAAC,kCAAkC,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC;uBAC3G,gBAAgB,CAAC,YAAY,EAAE,cAAc,CAAC;gBAEnD,IAAI,CAAC,cAAc,EAAE,CAAC;oBACpB,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE,EAAE,OAAO,EAAE,+DAA+D,EAAE,MAAM,EAAE,mCAAmC,EAAE;qBACnI,CAAC,CAAC;gBACL,CAAC;gBAED,wFAAwF;gBACxF,2FAA2F;gBAC3F,yFAAyF;gBACzF,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY;oBACtC,CAAC,CAAC,MAAM,0BAA0B,CAAC,QAAQ,CAAC,YAAY,EAAE,gBAAgB,EAAE,KAAK,EAAE;wBACjF,MAAM,EAAE,oCAAoC;wBAC5C,YAAY,EAAE,QAAQ,CAAC,YAAY;qBACpC,CAAC;oBACF,CAAC,CAAC,IAAI,CAAC;gBAET,MAAM,0BAA0B,CAC9B,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,EAAE,YAAY,EAAE,QAAQ,CAAC,YAAY,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,EACxF,gBAAgB,EAChB,KAAK,CACN,CAAC;gBAEF,OAAO,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,8BAA8B,CAAC,UAAU,CAAC,EAAE,CAAC;YACxF,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qCAAqC;IACnD,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB,EAAE,qBAAqB,CAAC,MAAM;YACjD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,8CAA8C;QAC1D,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBAClF,MAAM,KAAK,GAAG,KAA2B,CAAC;gBAC1C,mFAAmF;gBACnF,wFAAwF;gBACxF,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAE5E,uFAAuF;gBACvF,0FAA0F;gBAC1F,6FAA6F;gBAC7F,mFAAmF;gBACnF,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE;4BACP,OAAO,EAAE,2EAA2E;4BACpF,MAAM,EAAE,sCAAsC;4BAC9C,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;yBACpD;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,0BAA0B,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACzF,MAAM,EAAE,6BAA6B;oBACrC,kBAAkB;iBACnB,CAAC,CAAC;gBAEH,MAAM,0BAA0B,CAC9B,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EACzH,gBAAgB,EAChB,KAAK,CACN,CAAC;gBAEF,OAAO,KAAK,CAAC;YACf,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,mCAAmC;IACjD,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB,EAAE,2BAA2B,CAAC,IAAI;YACrD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,yBAAyB;QACrC,+FAA+F;QAC/F,6FAA6F;QAC7F,uFAAuF;QACvF,iBAAiB,EAAE,IAAI;QACvB,uBAAuB,EAAE,EAAE;QAC3B,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBAClF,qFAAqF;gBACrF,yFAAyF;gBACzF,mBAAmB;gBACnB,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE;4BACP,OAAO,EAAE,yDAAyD;4BAClE,MAAM,EAAE,oCAAoC;4BAC5C,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;yBACpD;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,SAAS,GAAG,KAAsC,CAAC;gBACzD,MAAM,cAAc,GAAG,SAAS,CAAC,eAAe,KAAK,SAAS,IAAI,SAAS,CAAC,eAAe,KAAK,IAAI,CAAC;gBACrG,IAAI,cAAc,IAAI,CAAC,OAAO,SAAS,CAAC,eAAe,KAAK,QAAQ,IAAI,SAAS,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;oBAChH,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE,EAAE,OAAO,EAAE,0FAA0F,EAAE,MAAM,EAAE,8CAA8C,EAAE;qBACzK,CAAC,CAAC;gBACL,CAAC;gBACD,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAE,SAAS,CAAC,eAA0B,CAAC,CAAC,CAAC,SAAS,CAAC;gBAE3F,MAAM,IAAI,GAAG,MAAM,0BAA0B,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACzF,MAAM,EAAE,6BAA6B;oBACrC,kBAAkB;iBACnB,CAAC,CAAC;gBAEH,IAAI,eAAe,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;oBACjC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;wBACxE,sBAAsB,EAAE,2BAA2B,CAAC,+BAA+B;wBACnF,OAAO,EAAE,EAAE,MAAM,EAAE,kCAAkC,EAAE,kBAAkB,EAAE,IAAI,CAAC,GAAG,EAAE;qBACtF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,aAAa,GAAG,eAAe;oBACnC,CAAC,CAAC,MAAM,0BAA0B,CAAC,eAAe,EAAE,gBAAgB,EAAE,KAAK,EAAE;wBAC3E,MAAM,EAAE,yCAAyC;wBACjD,eAAe;qBAChB,CAAC;oBACF,CAAC,CAAC,IAAI,CAAC;gBAET,0FAA0F;gBAC1F,oFAAoF;gBACpF,IAAI,aAAa,IAAI,2BAA2B,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBACtE,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;wBACxE,sBAAsB,EAAE,2BAA2B,CAAC,+BAA+B;wBACnF,OAAO,EAAE;4BACP,MAAM,EAAE,2CAA2C;4BACnD,kBAAkB,EAAE,IAAI,CAAC,GAAG;4BAC5B,eAAe;yBAChB;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,2FAA2F;gBAC3F,2FAA2F;gBAC3F,0FAA0F;gBAC1F,MAAM,0BAA0B,CAC9B,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,EAAE,eAAe,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EACzG,gBAAgB,EAChB,KAAK,CACN,CAAC;gBAEF,yFAAyF;gBACzF,oFAAoF;gBACpF,MAAM,gBAAgB,GAAG,6BAA6B,CAAC,IAAI,CAAC,CAAC;gBAC7D,MAAM,WAAW,GAAG,8BAA8B,CAAC,aAAa,CAAC,CAAC;gBAClE,MAAM,gBAAgB,GAAG,GAAG,WAAW,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;gBAEtD,MAAM,WAAW,GAAG,MAAM,+BAA+B,CAAC,IAAI,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;gBACzF,MAAM,cAAc,GAAG,KAAK,CAAC,oBAAoB,CAAC,aAAa,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;gBACrG,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,MAAM,cAAc,CAAC,MAAM,CACzB,gBAAgB,EAChB,UAAU,CAAC,GAAG,EACd,EAAE,IAAI,EAAE,0BAA0B,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,EAAS,EAChG,KAAK,CAAC,cAAc,CACrB,CAAC;gBACJ,CAAC;gBAED,yFAAyF;gBACzF,yFAAyF;gBACzF,OAAO,EAAE,YAAY,EAAE,eAAe,IAAI,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;YACtE,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,6CAA6C,CACpD,mBAA8F;IAE9F,MAAM,SAAS,GAAG,mBAAmB,KAAK,2BAA2B,CAAC,OAAO,CAAC;IAE9E,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE,CAC7E,yCAAyC,CAAC;QACxC,aAAa,EAAE;YACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;YACvD,mBAAmB;YACnB,WAAW,EAAE,4BAA4B,CAAC,QAAQ;YAClD,kBAAkB,EAAE,IAAI;SACzB;QACD,UAAU,EAAE,sBAAsB,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,EAAE;QACrE,QAAQ,EAAE;YACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;gBACnF,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;wBAC1E,OAAO,EAAE;4BACP,OAAO,EAAE,qBAAqB,mBAAmB,CAAC,WAAW,EAAE,mCAAmC;4BAClG,MAAM,EAAE,iDAAiD;4BACzD,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;yBACpD;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,0BAA0B,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACzF,MAAM,EAAE,6BAA6B;oBACrC,kBAAkB;iBACnB,CAAC,CAAC;gBAEH,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,KAAK,sBAAsB,CAAC,QAAQ,CAAC;gBACxE,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;oBAClC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;wBACxE,sBAAsB,EAAE,2BAA2B,CAAC,0BAA0B;wBAC9E,OAAO,EAAE;4BACP,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,oCAAoC,CAAC,CAAC,CAAC,gCAAgC;4BAC3F,kBAAkB,EAAE,IAAI,CAAC,GAAG;4BAC5B,aAAa,EAAE,IAAI,CAAC,MAAM;yBAC3B;qBACF,CAAC,CAAC;gBACL,CAAC;gBAED,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,6EAA6E;oBAC7E,KAAK,MAAM,UAAU,IAAI,2BAA2B,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC3D,MAAM,QAAQ,GAAG,MAAM,0BAA0B,CAAC,UAAU,EAAE,gBAAgB,EAAE,KAAK,EAAE;4BACrF,MAAM,EAAE,sCAAsC;4BAC9C,kBAAkB,EAAE,IAAI,CAAC,GAAG;4BAC5B,cAAc,EAAE,UAAU;yBAC3B,CAAC,CAAC;wBACH,IAAI,QAAQ,CAAC,MAAM,KAAK,sBAAsB,CAAC,QAAQ,EAAE,CAAC;4BACxD,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,gBAAgB,EAAE;gCACxE,sBAAsB,EAAE,2BAA2B,CAAC,0BAA0B;gCAC9E,OAAO,EAAE;oCACP,MAAM,EAAE,2CAA2C;oCACnD,kBAAkB,EAAE,IAAI,CAAC,GAAG;oCAC5B,sBAAsB,EAAE,QAAQ,CAAC,GAAG;iCACrC;6BACF,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,8FAA8F;gBAC9F,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC;YACjG,CAAC;SACF;KACF,CAAC,CAAC;IAEL,OAAO,OAAgE,CAAC;AAC1E,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,+CAA+C;IAC7D,OAAO;QACL,6CAA6C,CAAC,2BAA2B,CAAC,OAAO,CAAC;QAClF,6CAA6C,CAAC,2BAA2B,CAAC,OAAO,CAAC;KACnF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oDAAoD;IAClE,MAAM,OAAO,GAAG,CAAC,yBAA0D,EAAE,EAAE;QAC7E,OAAO,yCAAyC,CAAC;YAC/C,aAAa,EAAE;gBACb,kBAAkB,EAAE,gBAAgB,CAAC,kBAAkB;gBACvD,mBAAmB,EAAE,qBAAqB,CAAC,MAAM;gBACjD,WAAW,EAAE,4BAA4B,CAAC,QAAQ;gBAClD,kBAAkB,EAAE,IAAI;aACzB;YACD,QAAQ,EAAE;gBACR,oBAAoB,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE;oBAClF,yFAAyF;oBACzF,yFAAyF;oBACzF,0FAA0F;oBAC1F,4FAA4F;oBAC5F,+BAA+B;oBAC/B,MAAM,kBAAkB,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;oBACvD,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;wBACrC,MAAM,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,gBAAgB,EAAE;4BAC1E,OAAO,EAAE;gCACP,OAAO,EAAE,gFAAgF;gCACzF,YAAY,EAAE,gBAAgB,CAAC,kBAAkB;gCACjD,kBAAkB,EAAE,0BAA0B,CAAC,GAAG,CAAC;6BACpD;yBACF,CAAC,CAAC;oBACL,CAAC;oBAED,MAAM,kCAAkC,CAAC,kBAAkB,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;oBAEtF,kEAAkE;oBAClE,OAAO,KAAK,CAAC;gBACf,CAAC;aACF;SACF,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,OAAO,CAAC,OAAgE,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["/*\n Organization Unit Custom Implementations\n \n DELETE dependents guard: refuses to delete an interior node of the organization tree while\n * child units still hang off it.\n /\n\nimport {\n CoreResourceOperation,\n CoreResourceType,\n ErrorType,\n ErrorCustomMessageReference,\n OrganizationUnitStatus,\n OrganizationUnit_Operations,\n ResourceOperationVariantType,\n coreResourceShared_FieldIdentifier,\n buildOrganizationUnitChildPath,\n isOrganizationUnitInSubtree,\n organizationUnitAncestorIds,\n organizationUnitSubtreePrefix,\n rebaseOrganizationUnitPath,\n type OrganizationUnit,\n} from '@wildo-ai/saas-models';\nimport {\n createResourceCustomServiceImplementation,\n type ResourceCustomServiceImplementationFactory,\n} from '~wildo-backend-lib/base-classes/services/services/resource-operation-custom-implementation.factory.backend';\nimport type { ResourcesRegistryBackendService } from '~wildo-backend-lib/resources/services/resources-registry.backend.service';\nimport type { ResourceOperation_CustomImplementation_Utils } from '~wildo-backend-lib/base-classes/services/services/resource-operation-custom-implementation-base.backend.service';\nimport type { ExecutionContext } from '~wildo-backend-lib/runtime/models/execution-context.backend.schemas';\nimport {\n describeUnaddressableShape,\n resolveSingleSubjectId,\n} from '~wildo-backend-lib/base-classes/utils/single-subject-addressing.backend.utils';\n\n/\n The FK that materializes the organization-unit tree: a unit's parent node.\n \n Typed against {@link OrganizationUnit} so a rename of the field breaks the build here rather\n * than silently degrading the guard into a filter that matches nothing.\n /\nconst PARENT_UNIT_FK_FIELD: Extract<keyof OrganizationUnit, 'parentUnitId'> = 'parentUnitId';\n\n/\n Refuse removal of an organization unit while child units still hang off it.\n \n ## Why this guard exists\n \n `ORGANIZATION_UNITS -> ORGANIZATION_UNITS` (the tree self-edge on `parentUnitId`) is the ONE\n * `ORGANIZATIONS`-family relationship that declares no `onParentDelete` cascade. Deleting an\n * interior node therefore strands its entire subtree: every descendant keeps a `parentUnitId`\n * pointing at a row that no longer exists, and the materialized `path` of the whole branch — a\n * server-computed field (`.excludeFromCreate().excludeFromUpdate()`) that nothing recomputes —\n * silently describes a hierarchy that is no longer real. Neither is recoverable from the\n * remaining data, because the deleted node held the only link between the branch and its\n * grandparent.\n \n Enabling a cascade instead was rejected: the spec's stated policy is that the operator decides\n * where an orphaned branch belongs, and silently hard-deleting an arbitrarily deep subtree behind\n * a single-node DELETE is a far worse default for a `HIGH` risk-level operation than refusing it.\n \n The remedy is MOVE: re-parent each child onto another node, then delete the emptied leaf. MOVE\n * rewrites the materialized `path` of the whole subtree in one transaction, which a raw\n * `parentUnitId` edit never did — which is why `parentUnitId` became `.excludeFromUpdate()` in the\n * same pass that implemented MOVE (plan decision D-B2). Until then the guard's only escape hatch was\n * that raw edit, and it silently left every descendant's path describing a tree that no longer\n * existed.\n \n ## Scope: direct per-unit DELETE only\n \n Deleting the whole ORGANIZATION is a different path and is deliberately NOT affected. That\n * cascade IS enabled (`ORGANIZATIONS -> ORGANIZATION_UNITS`) and removes every unit of the\n * tenant in one pass — depth is irrelevant there because every unit, root or nested, carries the\n * tenant's `organizationId`. It also runs at the REPOSITORY level, which does not execute service\n * custom implementations, so this guard is structurally never consulted on that path. Tearing a\n * tenant down does not require dismantling its org chart leaf-by-leaf first.\n \n ## Why it fails closed\n \n DELETE is `riskLevel: HIGH`, so \"cannot verify\" must never read as \"nothing found\". An\n * unregistered `ORGANIZATION_UNITS` repository raises `CONFIGURATION` rather than being skipped,\n * and any scope-filter failure inside the read propagates instead of being swallowed.\n \n Detection uses `read()` rather than `count()` deliberately: `ORGANIZATION_UNITS` declares no\n * `COUNT` core operation, so `repository.count()` would throw INTERNAL. It does declare `READ`.\n * The read is a single indexed hit on `parentUnitId` (`.isDBIndexed()`), and the guard only needs\n * existence, not a tally.\n \n ## Also covered: unit assignments (since D-B5)\n \n Assigned members block the delete too. This dependent used to be EXCLUDED: unit assignment lived\n * in an embedded `OrganizationMember.organizationUnitsMembership` array, which is not a registered\n * relationship and has no adapter-neutral query — a dot-path filter into a JSONB array resolves to\n * NULL on PostgreSQL (matching nothing) and the LIST summary projection strips the field entirely,\n * so BOTH available scans would have failed OPEN on a guard whose whole purpose is to fail closed.\n * Promoting the assignment to the `ORGANIZATION_UNIT_MEMBERS` junction is exactly what made it\n * checkable, and it is now checked here on the same fail-closed terms as child units.\n \n @param unitId - The unit row about to be deleted.\n * @throws `CONFLICT` (409, `ORGANIZATION_UNIT_HAS_DEPENDENTS`) carrying whichever dependent blocked:\n * `blockingChildUnitId` for a child unit, `blockingUnitMemberId` for a member assignment.\n * @throws `CONFIGURATION` when the organization-units repository is not registered (unverifiable).\n /\nexport async function assertNoOrganizationUnitDependents(\n unitId: string,\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n): Promise<void> {\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n\n // Fail closed: an unregistered repository means we cannot prove the node is a leaf. Skipping\n // would silently downgrade the guard to \"nothing found\".\n if (!unitRepository) {\n throw utils.errorBuilder.buildError(ErrorType.CONFIGURATION, executionContext, {\n customMessageReference: ErrorCustomMessageReference.CONFIGURATION,\n context: {\n message: 'Cannot verify organization-unit dependents: the organization-units repository is not registered',\n organizationUnitId: unitId,\n childResourceType: CoreResourceType.ORGANIZATION_UNITS,\n },\n });\n }\n\n const blockingChildUnit = await unitRepository.read<OrganizationUnit>(executionContext, {\n [PARENT_UNIT_FK_FIELD]: unitId,\n });\n\n if (blockingChildUnit) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_HAS_DEPENDENTS,\n context: {\n organizationUnitId: unitId,\n blockingChildUnitId: blockingChildUnit._id,\n blockingChildUnitName: blockingChildUnit.name,\n },\n });\n }\n\n // Assigned members — checkable since D-B5 promoted unit assignment to a real junction resource.\n // Same fail-closed terms as the child-unit scan above: an unregistered repository means we cannot\n // prove the unit is unassigned, which must never read as \"nothing found\" on a HIGH-risk delete.\n const unitMemberRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNIT_MEMBERS);\n if (!unitMemberRepository) {\n throw utils.errorBuilder.buildError(ErrorType.CONFIGURATION, executionContext, {\n customMessageReference: ErrorCustomMessageReference.CONFIGURATION,\n context: {\n message: 'Cannot verify organization-unit assignments: the organization-unit-members repository is not registered',\n organizationUnitId: unitId,\n childResourceType: CoreResourceType.ORGANIZATION_UNIT_MEMBERS,\n },\n });\n }\n\n const blockingAssignment = await unitMemberRepository.read<{ _id: string; organizationMemberId: string }>(\n executionContext,\n { organizationUnitId: unitId },\n );\n\n if (blockingAssignment) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_HAS_DEPENDENTS,\n context: {\n organizationUnitId: unitId,\n blockingUnitMemberId: blockingAssignment._id,\n blockingOrganizationMemberId: blockingAssignment.organizationMemberId,\n },\n });\n }\n}\n\n/* The unit fields these implementations read; kept narrow so a schema rename breaks the build here. /\ntype OrganizationUnitTreeNodeRow = Pick<OrganizationUnit, '_id' \| 'organizationId' \| 'parentUnitId' \| 'path' \| 'status' \| 'code' \| 'name'>;\n\n/\n Load a unit that MUST exist inside the caller's scope, or fail with 404.\n \n Cross-tenant lookups resolve to \"not found\" rather than a conflict on purpose: the contextual\n * filter scopes the read to the caller's organization, so a unit belonging to another tenant is\n * simply absent. Reporting 409 there would confirm the existence of a row the caller may not see.\n /\nasync function loadScopedOrganizationUnit(\n unitId: string,\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n notFoundContext: Record<string, unknown>,\n): Promise<OrganizationUnitTreeNodeRow> {\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n if (!unitRepository) {\n throw utils.errorBuilder.buildError(ErrorType.CONFIGURATION, executionContext, {\n customMessageReference: ErrorCustomMessageReference.CONFIGURATION,\n context: { message: 'The organization-units repository is not registered', ...notFoundContext },\n });\n }\n\n const unit = await unitRepository.read<OrganizationUnitTreeNodeRow>(executionContext, { _id: unitId });\n if (!unit) {\n throw utils.errorBuilder.buildError(ErrorType.NOT_FOUND, executionContext, {\n customMessageReference: ErrorCustomMessageReference.NOT_FOUND,\n context: notFoundContext,\n });\n }\n return unit;\n}\n\n/\n Every unit strictly below `unit`, found by the materialized-path prefix.\n \n Uses `listForInternalScan` rather than `list`: this is an internal integrity sweep, and the LIST\n * summary projection would strip `path` — the one field the rewrite depends on.\n /\nasync function listOrganizationUnitDescendants(\n unit: OrganizationUnitTreeNodeRow,\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n): Promise<OrganizationUnitTreeNodeRow[]> {\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n const subtreePrefix = organizationUnitSubtreePrefix(unit);\n\n // Filter on the organization, then narrow by prefix in memory. An adapter-neutral \"starts with\"\n // filter does not exist across Mongo and SQL, and inventing one per adapter here would put a\n // query dialect inside a domain rule. Org trees are small (hundreds of nodes), and the scan is\n // already scoped to a single tenant.\n const scoped = await unitRepository.listForInternalScan<OrganizationUnitTreeNodeRow>(\n executionContext,\n { organizationId: unit.organizationId },\n utils.serviceOptions,\n );\n const rows: OrganizationUnitTreeNodeRow[] = Array.isArray(scoped) ? scoped : (scoped as { data: OrganizationUnitTreeNodeRow[] }).data;\n return rows.filter((row) => row._id !== unit._id && isOrganizationUnitInSubtree(row, unit));\n}\n\n/\n Refuse a `code` that is already taken by a sibling under `parentUnitId`.\n \n Sibling-scoped rather than org-wide: two teams called `sales` under different divisions are a\n * legitimate org chart, and `code` is optional so many rows carry none at all. That exact identity\n * — (`organizationId`, `parentUnitId`, `code`), scoped to rows that HAVE a code — is now also the\n * schema's business key, so MongoDB enforces it with a partial compound unique index.\n \n This guard is deliberately KEPT rather than deleted as redundant. Schema-declared uniqueness\n * is emitted for MongoDB only; the SQL planner records it as intent and leaves enforcement\n * migration-owned, so on a SQL adapter this function is the ONLY thing standing between two\n * same-coded siblings. It is a read-then-write and therefore still racy — under concurrency the\n * index is what actually closes the window on Mongo — but a racy check that usually wins is\n * strictly better than no check at all on an adapter that has no index to fall back to.\n \n Both layers raise the SAME reference. The index cannot know which operation was running, so an\n * operation-specific code would make one condition report differently depending on which write won\n * the race — an API client would have to handle both to recognise one situation.\n /\nasync function assertSiblingCodeAvailable(\n candidate: { unitId: string; organizationId: string; parentUnitId: string \| undefined; code: string \| undefined },\n executionContext: ExecutionContext<any>,\n utils: ResourceOperation_CustomImplementation_Utils,\n): Promise<void> {\n if (!candidate.code) return;\n\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n const sibling = await unitRepository.read<OrganizationUnitTreeNodeRow>(executionContext, {\n organizationId: candidate.organizationId,\n parentUnitId: candidate.parentUnitId ?? null,\n code: candidate.code,\n });\n\n if (sibling && sibling._id !== candidate.unitId) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_CODE_EXISTS,\n context: {\n reason: 'organization_unit_sibling_code_taken',\n organizationUnitId: candidate.unitId,\n conflictingUnitId: sibling._id,\n parentUnitId: candidate.parentUnitId ?? null,\n // NOT `code`: that key is the client-facing refusal-code contract (allow-listed, hoisted to\n // `error.code`) and must only ever carry a declared enum value. The user-typed unit code is\n // diagnostic context and stays server-side; `customMessageReference` already names the refusal.\n conflictingUnitCode: candidate.code,\n },\n });\n }\n}\n\n/\n CREATE prefix — materialize `path` on the SAME write that inserts the row.\n \n `path` is `.excludeFromCreate()` and was previously never written by anything, so every unit\n * persisted with an empty hierarchy path (the defect this closes). The prefix's return value is\n * merged into the create payload and passed through the loose repository write, which is how a\n * server-owned field reaches persistence without being client-settable.\n \n The path is derived from the PARENT alone — see the format contract in\n * `organization-units.shared.path.ts` for why it cannot include the new row's own id.\n /\nexport function createOrganizationUnitCreatePathFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: CoreResourceOperation.CREATE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: 'organization-units.create.path-materialization',\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n const authored = input as { parentUnitId?: string; organizationId?: string; code?: string };\n\n const organizationId = authored.organizationId\n ?? executionContext.getContextResourceId?.(coreResourceShared_FieldIdentifier[CoreResourceType.ORGANIZATIONS])\n ?? executionContext.initiatorIds?.organizationId;\n\n if (!organizationId) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: { message: 'An organization scope is required to place a unit in the tree', reason: 'organization_unit_create_unscoped' },\n });\n }\n\n // A parent that was NAMED but cannot be resolved must fail, never silently fall back to\n // root: the scoped read returns nothing for a unit in another tenant, and treating that as\n // \"no parent\" would quietly promote a cross-tenant child to a root of the caller's tree.\n const parentUnit = authored.parentUnitId\n ? await loadScopedOrganizationUnit(authored.parentUnitId, executionContext, utils, {\n reason: 'organization_unit_parent_not_found',\n parentUnitId: authored.parentUnitId,\n })\n : null;\n\n await assertSiblingCodeAvailable(\n { unitId: '', organizationId, parentUnitId: authored.parentUnitId, code: authored.code },\n executionContext,\n utils,\n );\n\n return { ...input, organizationId, path: buildOrganizationUnitChildPath(parentUnit) };\n },\n },\n });\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n\n/\n UPDATE prefix — keep sibling `code` unambiguous on a rename.\n \n Re-parenting is no longer reachable here (`parentUnitId` is `.excludeFromUpdate()` since MOVE\n * shipped — D-B2), so the only structural collision generic UPDATE can still cause is two same-coded\n * siblings under one parent. That is the surviving half of the spec's `ORGANIZATION_UNIT_CONFLICT`\n * scenario; the cycle half now lives entirely under MOVE.\n /\nexport function createOrganizationUnitUpdateFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: CoreResourceOperation.UPDATE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: 'organization-units.update.sibling-code-guard',\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n const patch = input as { code?: unknown };\n // Only a rename can collide. An update that leaves `code` alone cannot introduce a\n // duplicate, and re-checking it would 409 every unrelated edit of an already-valid row.\n if (typeof patch.code !== 'string' \|\| patch.code.length === 0) return input;\n\n // Resolve rather than cast. The former `_id as string` asserted a shape the addressing\n // contract does not guarantee: a filter-addressed rename would have handed an OBJECT to a\n // by-id read, which builds `{ _id: <object> }` and matches nothing — surfacing as a spurious\n // NOT_FOUND while the sibling-code collision it was meant to catch went unchecked.\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: 'Organization unit UPDATE renaming `code` requires a single addressed unit',\n reason: 'organization_unit_rename_unaddressed',\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n const unit = await loadScopedOrganizationUnit(organizationUnitId, executionContext, utils, {\n reason: 'organization_unit_not_found',\n organizationUnitId,\n });\n\n await assertSiblingCodeAvailable(\n { unitId: unit._id, organizationId: unit.organizationId, parentUnitId: unit.parentUnitId ?? undefined, code: patch.code },\n executionContext,\n utils,\n );\n\n return input;\n },\n },\n });\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n\n/\n MOVE — re-parent a unit and re-home its entire subtree.\n \n The descendant rewrite is the part that must never be skipped: leaving it out is exactly the\n * \"materialized field nothing recomputes\" bug that `path` was already an instance of. Because the\n * rewrite spans many rows, the whole operation runs in one transaction — a partial rewrite would\n * leave the tree describing a shape that never existed.\n \n An absent `newParentUnitId` means \"promote to root\", which the request DTO models as optional. A\n * present-but-blank value is malformed and is refused rather than silently read as a promotion.\n \n ⚠️ Cost: the subtree rewrite is a scan plus one `update()` per descendant. `repository.updateMany`\n * is unavailable here — it requires an `UPDATE_MANY` core operation, which this resource does not\n * declare. Acceptable while org charts are small; revisit if deep trees appear.\n /\nexport function createOrganizationUnitMoveFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: OrganizationUnit_Operations.MOVE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: 'organization-units.move',\n // The subtree rewrite spans many ORGANIZATION_UNITS rows plus the moved node itself. A partial\n // rewrite would leave the tree describing a shape that never existed, so they share one unit\n // of work. No OTHER resource participates — the move is entirely within the unit tree.\n transactionalCore: true,\n transactionParticipants: {},\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n // A conditional `{ _id, … }` filter names one unit and is admitted; only a genuinely\n // population-addressed move is refused, since the subtree rewrite below is computed from\n // ONE node's path.\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: 'Organization unit MOVE requires a single addressed unit',\n reason: 'organization_unit_move_unaddressed',\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n const requested = input as { newParentUnitId?: unknown };\n const hasDestination = requested.newParentUnitId !== undefined && requested.newParentUnitId !== null;\n if (hasDestination && (typeof requested.newParentUnitId !== 'string' \|\| requested.newParentUnitId.length === 0)) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: { message: 'newParentUnitId must be a non-empty unit id, or be omitted to promote the unit to a root', reason: 'organization_unit_move_malformed_destination' },\n });\n }\n const newParentUnitId = hasDestination ? (requested.newParentUnitId as string) : undefined;\n\n const unit = await loadScopedOrganizationUnit(organizationUnitId, executionContext, utils, {\n reason: 'organization_unit_not_found',\n organizationUnitId,\n });\n\n if (newParentUnitId === unit._id) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_MOVE_CONFLICT,\n context: { reason: 'organization_unit_move_onto_self', organizationUnitId: unit._id },\n });\n }\n\n const newParentUnit = newParentUnitId\n ? await loadScopedOrganizationUnit(newParentUnitId, executionContext, utils, {\n reason: 'organization_unit_destination_not_found',\n newParentUnitId,\n })\n : null;\n\n // O(1) cycle test — the payoff of the materialized path. Moving a node beneath one of its\n // own descendants would detach the branch: it would have no route back to the root.\n if (newParentUnit && isOrganizationUnitInSubtree(newParentUnit, unit)) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_MOVE_CONFLICT,\n context: {\n reason: 'organization_unit_move_would_create_cycle',\n organizationUnitId: unit._id,\n newParentUnitId,\n },\n });\n }\n\n // Raises ORGANIZATION_UNIT_CODE_EXISTS, not MOVE_CONFLICT: the destination itself is legal\n // here — it is the unit's own `code` that collides — so renaming the unit is a remedy that\n // choosing another destination is not. The two conditions want different client handling.\n await assertSiblingCodeAvailable(\n { unitId: unit._id, organizationId: unit.organizationId, parentUnitId: newParentUnitId, code: unit.code },\n executionContext,\n utils,\n );\n\n // Re-home the branch. Descendants are rewritten BEFORE the node's own update lands, so a\n // failure anywhere rolls the whole move back rather than leaving a half-moved tree.\n const oldSubtreePrefix = organizationUnitSubtreePrefix(unit);\n const newUnitPath = buildOrganizationUnitChildPath(newParentUnit);\n const newSubtreePrefix = `${newUnitPath}${unit._id}/`;\n\n const descendants = await listOrganizationUnitDescendants(unit, executionContext, utils);\n const unitRepository = utils.repositoriesRegistry.getRepository(CoreResourceType.ORGANIZATION_UNITS);\n for (const descendant of descendants) {\n await unitRepository.update(\n executionContext,\n descendant._id,\n { path: rebaseOrganizationUnitPath(descendant.path, oldSubtreePrefix, newSubtreePrefix) } as any,\n utils.serviceOptions,\n );\n }\n\n // The MOVE request DTO names no schema field, so the core UPDATE must be handed the real\n // mutation. `parentUnitId: null` (not `undefined`) is what clears the FK on a promotion.\n return { parentUnitId: newParentUnitId ?? null, path: newUnitPath };\n },\n },\n });\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n\n/\n ARCHIVE / RESTORE — node-only status transitions (plan decision Q-B1).\n \n Archiving a branch marks ONLY the node: descendants keep their own status, which makes ARCHIVE\n * O(1) and keeps restore order explicit. RESTORE pays for that by validating the ancestor chain —\n * restoring a node under a still-archived parent would leave an active unit reachable only through\n * an inactive one, which is the inconsistency the spec's 409 describes.\n /\nfunction createOrganizationUnitStatusTransitionFactory(\n operationIdentifier: OrganizationUnit_Operations.ARCHIVE \| OrganizationUnit_Operations.RESTORE,\n): ResourceCustomServiceImplementationFactory {\n const isArchive = operationIdentifier === OrganizationUnit_Operations.ARCHIVE;\n\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) =>\n createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n debugLabel: `organization-units.${isArchive ? 'archive' : 'restore'}`,\n handlers: {\n prefixCoreOperations: async (_id, _input, executionContext, _operationPath, utils) => {\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: `Organization unit ${operationIdentifier.toUpperCase()} requires a single addressed unit`,\n reason: 'organization_unit_status_transition_unaddressed',\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n const unit = await loadScopedOrganizationUnit(organizationUnitId, executionContext, utils, {\n reason: 'organization_unit_not_found',\n organizationUnitId,\n });\n\n const alreadyArchived = unit.status === OrganizationUnitStatus.ARCHIVED;\n if (isArchive === alreadyArchived) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_CONFLICT,\n context: {\n reason: isArchive ? 'organization_unit_already_archived' : 'organization_unit_not_archived',\n organizationUnitId: unit._id,\n currentStatus: unit.status,\n },\n });\n }\n\n if (!isArchive) {\n // Restore order is explicit: every ancestor must already be out of ARCHIVED.\n for (const ancestorId of organizationUnitAncestorIds(unit)) {\n const ancestor = await loadScopedOrganizationUnit(ancestorId, executionContext, utils, {\n reason: 'organization_unit_ancestor_not_found',\n organizationUnitId: unit._id,\n ancestorUnitId: ancestorId,\n });\n if (ancestor.status === OrganizationUnitStatus.ARCHIVED) {\n throw utils.errorBuilder.buildError(ErrorType.CONFLICT, executionContext, {\n customMessageReference: ErrorCustomMessageReference.ORGANIZATION_UNIT_CONFLICT,\n context: {\n reason: 'organization_unit_ancestor_still_archived',\n organizationUnitId: unit._id,\n blockingAncestorUnitId: ancestor._id,\n },\n });\n }\n }\n }\n\n // As with MOVE, the request DTO carries only `reason`, so the real mutation is supplied here.\n return { status: isArchive ? OrganizationUnitStatus.ARCHIVED : OrganizationUnitStatus.ACTIVE };\n },\n },\n });\n\n return factory as unknown as ResourceCustomServiceImplementationFactory;\n}\n\n/* ARCHIVE + RESTORE implementations. /\nexport function createOrganizationUnitStatusTransitionFactories(): ResourceCustomServiceImplementationFactory[] {\n return [\n createOrganizationUnitStatusTransitionFactory(OrganizationUnit_Operations.ARCHIVE),\n createOrganizationUnitStatusTransitionFactory(OrganizationUnit_Operations.RESTORE),\n ];\n}\n\n/\n Register {@link assertNoOrganizationUnitDependents} as the `ORGANIZATION_UNITS` DELETE prefix.\n \n PREFIX: refuses the delete with 409 `ORGANIZATION_UNIT_HAS_DEPENDENTS` while any child unit\n * still names this node as its parent. There is no CORE replacement — when the guard passes, the\n * standard DELETE proceeds untouched.\n \n Registered on `API_CALL` — the variant the resource configuration actually declares for DELETE.\n * Custom implementations are resolved by an exact operation-path key that embeds `variantType`,\n * so a guard registered under any other variant would never run.\n */\nexport function createOrganizationUnitDeleteDependentsGuardFactories(): ResourceCustomServiceImplementationFactory[] {\n const factory = (_resourcesRegistryService: ResourcesRegistryBackendService) => {\n return createResourceCustomServiceImplementation({\n operationPath: {\n resourceIdentifier: CoreResourceType.ORGANIZATION_UNITS,\n operationIdentifier: CoreResourceOperation.DELETE,\n variantType: ResourceOperationVariantType.API_CALL,\n isOperationDefault: true,\n },\n handlers: {\n prefixCoreOperations: async (_id, input, executionContext, _operationPath, utils) => {\n // Fail closed: the dependent scan filters on a single unit id, so a POPULATION-addressed\n // delete (an ids array or an unpinned filter reaching this path via `doByOperationPath`)\n // must be refused rather than silently producing a filter that matches nothing and waving\n // the delete through. A conditional `{ _id, … }` filter resolves to the one unit the delete\n // can destroy and is admitted.\n const organizationUnitId = resolveSingleSubjectId(_id);\n if (organizationUnitId === undefined) {\n throw utils.errorBuilder.buildError(ErrorType.VALIDATION, executionContext, {\n context: {\n message: 'Organization unit DELETE requires a single addressed unit to verify dependents',\n resourceType: CoreResourceType.ORGANIZATION_UNITS,\n receivedAddressing: describeUnaddressableShape(_id),\n },\n });\n }\n\n await assertNoOrganizationUnitDependents(organizationUnitId, executionContext, utils);\n\n // Guard only — the core DELETE input is passed through unchanged.\n return input;\n },\n },\n });\n };\n\n return [factory as unknown as ResourceCustomServiceImplementationFactory];\n}\n"]}

package/dist/esm/queue/adapters/in-memory-queue-adapter.backend.service.d.ts ADDED Viewed

@@ -0,0 +1,66 @@
+import type { JobPayload, JobResult } from '@wildo-ai/saas-models';
+import { LoggerService } from '../../monitoring/logger/services/logger.service';
+import type { MessageHandler, QueueAdapter } from '../../queue/adapters/queue-adapter.backend.interface';
+import type { PublishOptions, QueueAssertOptions } from '../../queue/adapters/queue-adapter.backend.options';
+export declare class InMemoryQueueAdapterBackendService implements QueueAdapter {
+    private readonly logger;
+    private readonly queues;
+    private readonly pendingDelays;
+    private readonly podId;
+    private replyQueueName;
+    private connected;
+    constructor(logger: LoggerService);
+    connect(): Promise<void>;
+    close(): Promise<void>;
+    isConnected(): boolean;
+    assertQueue(queueName: string, options?: QueueAssertOptions): Promise<void>;
+    publish(queueName: string, payload: JobPayload, options?: PublishOptions): Promise<void>;
+    scheduleDelayedRetry(sourceQueueName: string, job: JobPayload, delayMs: number, options?: PublishOptions): Promise<void>;
+    consume(queueName: string, handler: MessageHandler): Promise<string>;
+    cancelConsumer(queueName: string): Promise<void>;
+    setupReplyQueue(appId: string, onReply: (correlationId: string, result: JobResult) => void): Promise<string>;
+    publishResult(replyTo: string, correlationId: string, result: JobResult): Promise<void>;
+    getReplyQueueName(): string | null;
+    getQueueDepth(queueName: string): Promise<number | null>;
+    getPodId(): string;
+    /** In-flight count for a queue — delivered, not yet settled. Test-facing, and the reason it exists. */
+    getUnsettledCount(queueName: string): number;
+    /**
+     * Every queue this adapter currently knows about.
+     *
+     * Test-facing, and it exists because of a mutation that survived without it: a version that
+     * INVENTED a dead-letter destination when a queue declared none passed a suite asserting only that
+     * the source queue was empty. "The message went nowhere" is a claim about every queue, and it
+     * cannot be checked one queue at a time.
+     */
+    getQueueNames(): readonly string[];
+    /**
+     * Delayed retries still waiting to fire.
+     *
+     * Also mutation-driven: `close()` clearing the queue map makes a late timer harmless by accident,
+     * so a test asserting depth after close passed with the timer cleanup deleted. This exposes the
+     * mechanism itself, which is the thing the cleanup is actually for.
+     */
+    getPendingDelayCount(): number;
+    private buildMessage;
+    private enqueue;
+    /**
+     * Deliver on a microtask, one message at a time, never re-entrantly.
+     *
+     * `draining` is what makes a handler that publishes to its OWN queue terminate: without it the
+     * enqueue inside the handler re-enters the drain and the stack grows until it overflows — a failure
+     * that would appear only under the in-memory adapter and would read as a defect in the consumer.
+     */
+    private scheduleDrain;
+    private drain;
+    private acknowledgerFor;
+    /**
+     * Route a rejected message to the dead-letter destination the source queue DECLARED.
+     *
+     * Only when one was declared. Inventing a destination would make a test pass that proves nothing
+     * about a deployment whose queue was asserted without dead-lettering — the message is dropped there,
+     * and dropping it here is the truthful simulation.
+     */
+    private deadLetter;
+}
+//# sourceMappingURL=in-memory-queue-adapter.backend.service.d.ts.map

package/dist/esm/queue/adapters/in-memory-queue-adapter.backend.service.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"in-memory-queue-adapter.backend.service.d.ts","sourceRoot":"","sources":["../../../../../src/queue/adapters/in-memory-queue-adapter.backend.service.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAInE,OAAO,EAAE,aAAa,EAAE,MAAM,8DAA8D,CAAC;AAE7F,OAAO,KAAK,EACV,cAAc,EACd,YAAY,EAGb,MAAM,mEAAmE,CAAC;AAC3E,OAAO,KAAK,EACV,cAAc,EACd,kBAAkB,EACnB,MAAM,iEAAiE,CAAC;AAsDzE,qBACa,kCAAmC,YAAW,YAAY;IAQhC,OAAO,CAAC,QAAQ,CAAC,MAAM;IAP5D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAoC;IAC3D,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA6B;IAC3D,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+B;IACrD,OAAO,CAAC,cAAc,CAAuB;IAC7C,OAAO,CAAC,SAAS,CAAS;gBAG4B,MAAM,EAAE,aAAa;IAG9D,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAIxB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAU5B,WAAW,IAAI,OAAO;IAIhB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC,IAAI,CAAC;IAU/E,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAE,cAAmB,GAAG,OAAO,CAAC,IAAI,CAAC;IAK5F,oBAAoB,CAC/B,eAAe,EAAE,MAAM,EACvB,GAAG,EAAE,UAAU,EACf,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,cAAmB,GAC3B,OAAO,CAAC,IAAI,CAAC;IAkBH,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC;IASpE,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKhD,eAAe,CAC1B,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,KAAK,IAAI,GAC1D,OAAO,CAAC,MAAM,CAAC;IAcL,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAa7F,iBAAiB,IAAI,MAAM,GAAG,IAAI;IAI5B,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAO9D,QAAQ,IAAI,MAAM;IAIzB,uGAAuG;IAChG,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAInD;;;;;;;OAOG;IACI,aAAa,IAAI,SAAS,MAAM,EAAE;IAIzC;;;;;;OAMG;IACI,oBAAoB,IAAI,MAAM;IAIrC,OAAO,CAAC,YAAY;IAcpB,OAAO,CAAC,OAAO;IAQf;;;;;;OAMG;IACH,OAAO,CAAC,aAAa;YAOP,KAAK;IA6BnB,OAAO,CAAC,eAAe;IAoBvB;;;;;;OAMG;IACH,OAAO,CAAC,UAAU;CAQnB"}

package/dist/esm/queue/adapters/in-memory-queue-adapter.backend.service.js ADDED Viewed

@@ -0,0 +1,257 @@
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+var __metadata = (this && this.__metadata) || function (k, v) {
+    if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(k, v);
+};
+var __param = (this && this.__param) || function (paramIndex, decorator) {
+    return function (target, key) { decorator(target, key, paramIndex); }
+};
+import { randomUUID } from 'node:crypto';
+import { inject, injectable } from 'inversify';
+import { SAAS_SERVICE_TYPES } from '../../inject/models/service-types.js';
+import { LoggerService } from '../../monitoring/logger/services/logger.service.js';
+import { describeCaughtError } from '../../errors/utils/error-log-level-classification.backend.utils.js';
+let InMemoryQueueAdapterBackendService = class InMemoryQueueAdapterBackendService {
+    logger;
+    queues = new Map();
+    pendingDelays = new Set();
+    podId = `in-memory-${randomUUID()}`;
+    replyQueueName = null;
+    connected = false;
+    constructor(logger) {
+        this.logger = logger;
+    }
+    async connect() {
+        this.connected = true;
+    }
+    async close() {
+        // Timers first: a delayed retry firing after close would republish onto a queue nobody is
+        // consuming, and in a test run that surfaces as an unhandled rejection in the NEXT test.
+        for (const timer of this.pendingDelays)
+            clearTimeout(timer);
+        this.pendingDelays.clear();
+        this.queues.clear();
+        this.replyQueueName = null;
+        this.connected = false;
+    }
+    isConnected() {
+        return this.connected;
+    }
+    async assertQueue(queueName, options = {}) {
+        const existing = this.queues.get(queueName);
+        if (existing) {
+            // Idempotent, like the broker's own `assertQueue`. The options of the FIRST assertion win, so a
+            // later assertion cannot silently retune a live queue's dead-lettering.
+            return;
+        }
+        this.queues.set(queueName, { messages: [], options, unsettled: new Set(), draining: false });
+    }
+    async publish(queueName, payload, options = {}) {
+        await this.assertQueue(queueName);
+        this.enqueue(queueName, this.buildMessage(payload, options), 'back');
+    }
+    async scheduleDelayedRetry(sourceQueueName, job, delayMs, options = {}) {
+        await this.assertQueue(sourceQueueName);
+        /*
+         * A timer, where RabbitMQ uses a per-delay queue whose TTL dead-letters back to the source. The
+         * MECHANISM differs and the observable contract does not: the job reappears on its source queue
+         * after `delayMs`. A consumer that depended on the intermediate delay queue existing would be
+         * depending on a RabbitMQ implementation detail, which is exactly what the port exists to stop.
+         */
+        const timer = setTimeout(() => {
+            this.pendingDelays.delete(timer);
+            this.enqueue(sourceQueueName, this.buildMessage(job, options), 'back');
+        }, delayMs);
+        // Never hold the event loop open: a pending retry must not keep a test process (or a shutting-down
+        // runtime) alive past its work.
+        timer.unref?.();
+        this.pendingDelays.add(timer);
+    }
+    async consume(queueName, handler) {
+        await this.assertQueue(queueName);
+        const queue = this.queues.get(queueName);
+        const tag = `in-memory-consumer-${randomUUID()}`;
+        queue.consumer = { tag, handler };
+        this.scheduleDrain(queueName);
+        return tag;
+    }
+    async cancelConsumer(queueName) {
+        const queue = this.queues.get(queueName);
+        if (queue)
+            queue.consumer = undefined;
+    }
+    async setupReplyQueue(appId, onReply) {
+        const queueName = `${appId}.replies.${this.podId}`;
+        await this.assertQueue(queueName, { exclusive: true, autoDelete: true });
+        await this.consume(queueName, async (message, acknowledger) => {
+            const correlationId = message.properties.correlationId;
+            if (typeof correlationId === 'string') {
+                onReply(correlationId, JSON.parse(message.content.toString()));
+            }
+            acknowledger.ack(message);
+        });
+        this.replyQueueName = queueName;
+        return queueName;
+    }
+    async publishResult(replyTo, correlationId, result) {
+        await this.assertQueue(replyTo);
+        this.enqueue(replyTo, {
+            content: Buffer.from(JSON.stringify(result)),
+            fields: { redelivered: false },
+            properties: { correlationId },
+        }, 'back');
+    }
+    getReplyQueueName() {
+        return this.replyQueueName;
+    }
+    async getQueueDepth(queueName) {
+        // A real number, not `null`: this adapter genuinely knows, and monitoring is one of the things a
+        // broker-free lane exists to exercise. `null` is reserved for "cannot say", which would be a lie
+        // here.
+        return this.queues.get(queueName)?.messages.length ?? 0;
+    }
+    getPodId() {
+        return this.podId;
+    }
+    /** In-flight count for a queue — delivered, not yet settled. Test-facing, and the reason it exists. */
+    getUnsettledCount(queueName) {
+        return this.queues.get(queueName)?.unsettled.size ?? 0;
+    }
+    /**
+     * Every queue this adapter currently knows about.
+     *
+     * Test-facing, and it exists because of a mutation that survived without it: a version that
+     * INVENTED a dead-letter destination when a queue declared none passed a suite asserting only that
+     * the source queue was empty. "The message went nowhere" is a claim about every queue, and it
+     * cannot be checked one queue at a time.
+     */
+    getQueueNames() {
+        return [...this.queues.keys()];
+    }
+    /**
+     * Delayed retries still waiting to fire.
+     *
+     * Also mutation-driven: `close()` clearing the queue map makes a late timer harmless by accident,
+     * so a test asserting depth after close passed with the timer cleanup deleted. This exposes the
+     * mechanism itself, which is the thing the cleanup is actually for.
+     */
+    getPendingDelayCount() {
+        return this.pendingDelays.size;
+    }
+    buildMessage(payload, options) {
+        return {
+            content: Buffer.from(JSON.stringify(payload)),
+            fields: { redelivered: false },
+            // Only what the port declares. `priority` and `expiration` are accepted by `PublishOptions`
+            // and are BROKER scheduling hints — this queue has no priority ordering and says so by not
+            // pretending to carry them, rather than storing a value nothing reads.
+            properties: {
+                correlationId: options.correlationId ?? null,
+                replyTo: options.replyTo,
+            },
+        };
+    }
+    enqueue(queueName, message, end) {
+        const queue = this.queues.get(queueName);
+        if (!queue)
+            return;
+        if (end === 'front')
+            queue.messages.unshift(message);
+        else
+            queue.messages.push(message);
+        this.scheduleDrain(queueName);
+    }
+    /**
+     * Deliver on a microtask, one message at a time, never re-entrantly.
+     *
+     * `draining` is what makes a handler that publishes to its OWN queue terminate: without it the
+     * enqueue inside the handler re-enters the drain and the stack grows until it overflows — a failure
+     * that would appear only under the in-memory adapter and would read as a defect in the consumer.
+     */
+    scheduleDrain(queueName) {
+        const queue = this.queues.get(queueName);
+        if (!queue || queue.draining || !queue.consumer)
+            return;
+        queue.draining = true;
+        queueMicrotask(() => void this.drain(queueName));
+    }
+    async drain(queueName) {
+        const queue = this.queues.get(queueName);
+        if (!queue)
+            return;
+        try {
+            while (queue.consumer && queue.messages.length > 0) {
+                const message = queue.messages.shift();
+                queue.unsettled.add(message);
+                try {
+                    await queue.consumer.handler(message, this.acknowledgerFor(queueName));
+                }
+                catch (error) {
+                    /*
+                     * A handler that THROWS has not settled the message, and the broker would hold it in
+                     * flight until the channel closed. Mirrored rather than silently requeued: auto-requeueing
+                     * here would turn a crashing handler into an infinite hot loop that no real deployment
+                     * would produce.
+                     */
+                    this.logger.warn('In-memory queue handler threw; message left unsettled', {
+                        queueName,
+                        error: describeCaughtError(error),
+                    });
+                }
+            }
+        }
+        finally {
+            queue.draining = false;
+            // A message that arrived while we were awaiting a handler needs its own drain.
+            if (queue.consumer && queue.messages.length > 0)
+                this.scheduleDrain(queueName);
+        }
+    }
+    acknowledgerFor(queueName) {
+        return {
+            ack: (message) => {
+                this.queues.get(queueName)?.unsettled.delete(message);
+            },
+            nack: (message, _allUpTo = false, requeue = false) => {
+                const queue = this.queues.get(queueName);
+                if (!queue)
+                    return;
+                queue.unsettled.delete(message);
+                if (requeue) {
+                    // FRONT, and redelivered — the broker's own semantics for a requeue, and the difference a
+                    // retry test can actually observe.
+                    this.enqueue(queueName, { ...message, fields: { ...message.fields, redelivered: true } }, 'front');
+                    return;
+                }
+                this.deadLetter(queue, message);
+            },
+        };
+    }
+    /**
+     * Route a rejected message to the dead-letter destination the source queue DECLARED.
+     *
+     * Only when one was declared. Inventing a destination would make a test pass that proves nothing
+     * about a deployment whose queue was asserted without dead-lettering — the message is dropped there,
+     * and dropping it here is the truthful simulation.
+     */
+    deadLetter(queue, message) {
+        const destination = queue.options.deadLetterRoutingKey ?? queue.options.deadLetterExchange;
+        if (!destination)
+            return;
+        if (!this.queues.has(destination)) {
+            this.queues.set(destination, { messages: [], options: {}, unsettled: new Set(), draining: false });
+        }
+        this.enqueue(destination, message, 'back');
+    }
+};
+InMemoryQueueAdapterBackendService = __decorate([
+    injectable(),
+    __param(0, inject(SAAS_SERVICE_TYPES.Logger)),
+    __metadata("design:paramtypes", [LoggerService])
+], InMemoryQueueAdapterBackendService);
+export { InMemoryQueueAdapterBackendService };
+//# sourceMappingURL=in-memory-queue-adapter.backend.service.js.map

package/dist/esm/queue/adapters/in-memory-queue-adapter.backend.service.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"in-memory-queue-adapter.backend.service.js","sourceRoot":"","sources":["../../../../../src/queue/adapters/in-memory-queue-adapter.backend.service.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,gDAAgD,CAAC;AACpF,OAAO,EAAE,aAAa,EAAE,MAAM,8DAA8D,CAAC;AAC7F,OAAO,EAAE,mBAAmB,EAAE,MAAM,8EAA8E,CAAC;AAiE5G,IAAM,kCAAkC,GAAxC,MAAM,kCAAkC;IAQS;IAPrC,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC1C,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,KAAK,GAAG,aAAa,UAAU,EAAE,EAAE,CAAC;IAC7C,cAAc,GAAkB,IAAI,CAAC;IACrC,SAAS,GAAG,KAAK,CAAC;IAE1B,YACsD,MAAqB;QAArB,WAAM,GAAN,MAAM,CAAe;IACxE,CAAC;IAEG,KAAK,CAAC,OAAO;QAClB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACxB,CAAC;IAEM,KAAK,CAAC,KAAK;QAChB,0FAA0F;QAC1F,yFAAyF;QACzF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa;YAAE,YAAY,CAAC,KAAK,CAAC,CAAC;QAC5D,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAEM,WAAW;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAEM,KAAK,CAAC,WAAW,CAAC,SAAiB,EAAE,UAA8B,EAAE;QAC1E,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,QAAQ,EAAE,CAAC;YACb,gGAAgG;YAChG,wEAAwE;YACxE,OAAO;QACT,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/F,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,SAAiB,EAAE,OAAmB,EAAE,UAA0B,EAAE;QACvF,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;IACvE,CAAC;IAEM,KAAK,CAAC,oBAAoB,CAC/B,eAAuB,EACvB,GAAe,EACf,OAAe,EACf,UAA0B,EAAE;QAE5B,MAAM,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;QACxC;;;;;WAKG;QACH,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YAC5B,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;QACzE,CAAC,EAAE,OAAO,CAAC,CAAC;QACZ,mGAAmG;QACnG,gCAAgC;QAChC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAChB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,SAAiB,EAAE,OAAuB;QAC7D,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAkB,CAAC;QAC1D,MAAM,GAAG,GAAG,sBAAsB,UAAU,EAAE,EAAE,CAAC;QACjD,KAAK,CAAC,QAAQ,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;QAClC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QAC9B,OAAO,GAAG,CAAC;IACb,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,SAAiB;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,KAAK;YAAE,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;IACxC,CAAC;IAEM,KAAK,CAAC,eAAe,CAC1B,KAAa,EACb,OAA2D;QAE3D,MAAM,SAAS,GAAG,GAAG,KAAK,YAAY,IAAI,CAAC,KAAK,EAAE,CAAC;QACnD,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QACzE,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE;YAC5D,MAAM,aAAa,GAAG,OAAO,CAAC,UAAU,CAAC,aAAa,CAAC;YACvD,IAAI,OAAO,aAAa,KAAK,QAAQ,EAAE,CAAC;gBACtC,OAAO,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAc,CAAC,CAAC;YAC9E,CAAC;YACD,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,OAAO,SAAS,CAAC;IACnB,CAAC;IAEM,KAAK,CAAC,aAAa,CAAC,OAAe,EAAE,aAAqB,EAAE,MAAiB;QAClF,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,CACV,OAAO,EACP;YACE,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;YAC9B,UAAU,EAAE,EAAE,aAAa,EAAE;SAC9B,EACD,MAAM,CACP,CAAC;IACJ,CAAC;IAEM,iBAAiB;QACtB,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAEM,KAAK,CAAC,aAAa,CAAC,SAAiB;QAC1C,iGAAiG;QACjG,iGAAiG;QACjG,QAAQ;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC;IAC1D,CAAC;IAEM,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,uGAAuG;IAChG,iBAAiB,CAAC,SAAiB;QACxC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;;OAOG;IACI,aAAa;QAClB,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;IACjC,CAAC;IAEO,YAAY,CAAC,OAA+B,EAAE,OAAuB;QAC3E,OAAO;YACL,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE;YAC9B,4FAA4F;YAC5F,2FAA2F;YAC3F,uEAAuE;YACvE,UAAU,EAAE;gBACV,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,IAAI;gBAC5C,OAAO,EAAE,OAAO,CAAC,OAAO;aACzB;SACF,CAAC;IACJ,CAAC;IAEO,OAAO,CAAC,SAAiB,EAAE,OAA4B,EAAE,GAAqB;QACpF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAI,GAAG,KAAK,OAAO;YAAE,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;;YAChD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACK,aAAa,CAAC,SAAiB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,QAAQ;YAAE,OAAO;QACxD,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,cAAc,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;IACnD,CAAC;IAEO,KAAK,CAAC,KAAK,CAAC,SAAiB;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAI,CAAC;YACH,OAAO,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnD,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAyB,CAAC;gBAC9D,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC7B,IAAI,CAAC;oBACH,MAAM,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;gBACzE,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf;;;;;uBAKG;oBACH,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,uDAAuD,EAAE;wBACxE,SAAS;wBACT,KAAK,EAAE,mBAAmB,CAAC,KAAK,CAAC;qBAClC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;YACvB,+EAA+E;YAC/E,IAAI,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,SAAiB;QACvC,OAAO;YACL,GAAG,EAAE,CAAC,OAAO,EAAE,EAAE;gBACf,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACxD,CAAC;YACD,IAAI,EAAE,CAAC,OAAO,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,GAAG,KAAK,EAAE,EAAE;gBACnD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,CAAC,KAAK;oBAAE,OAAO;gBACnB,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAChC,IAAI,OAAO,EAAE,CAAC;oBACZ,0FAA0F;oBAC1F,mCAAmC;oBACnC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;oBACnG,OAAO;gBACT,CAAC;gBACD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClC,CAAC;SACF,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,UAAU,CAAC,KAAoB,EAAE,OAA4B;QACnE,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC3F,IAAI,CAAC,WAAW;YAAE,OAAO;QACzB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACrG,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;IAC7C,CAAC;CACF,CAAA;AA9PY,kCAAkC;IAD9C,UAAU,EAAE;IASR,WAAA,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAA;qCAA0B,aAAa;GARhE,kCAAkC,CA8P9C","sourcesContent":["import { randomUUID } from 'node:crypto';\n\nimport type { JobPayload, JobResult } from '@wildo-ai/saas-models';\nimport { inject, injectable } from 'inversify';\n\nimport { SAAS_SERVICE_TYPES } from '~wildo-backend-lib/inject/models/service-types';\nimport { LoggerService } from '~wildo-backend-lib/monitoring/logger/services/logger.service';\nimport { describeCaughtError } from '~wildo-backend-lib/errors/utils/error-log-level-classification.backend.utils';\nimport type {\n MessageHandler,\n QueueAdapter,\n QueueConsumeMessage,\n QueueMessageAcknowledger,\n} from '~wildo-backend-lib/queue/adapters/queue-adapter.backend.interface';\nimport type {\n PublishOptions,\n QueueAssertOptions,\n} from '~wildo-backend-lib/queue/adapters/queue-adapter.backend.options';\n\n/**\n * An in-process {@link QueueAdapter}, so background-work BEHAVIOUR can be tested without a broker (#502).\n *\n * ## What this is for, and the bar it had to clear\n *\n * `QueueAdapterType` declared three adapters and one existed. The decision was to build this one and\n * collapse the other two, on a stated justification: *\"a queue that needs no RabbitMQ makes\n * background-work behaviour testable in-process\"*. That justification also sets the bar — an adapter\n * nothing runs against would have been a fourth unreachable thing built to fix three — so this ships\n * with a lane that drives real consumer behaviour through it, and that lane, not this file, is what\n * makes the decision honest.\n *\n * ## It is a QUEUE, not a stub\n *\n * The distinction matters, because a stub proves the caller compiles and a queue proves the caller is\n * right. So this really does what the port promises:\n *\n * - **`nack(requeue: true)` puts the message back**, at the FRONT, and the consumer sees it again.\n * That is the retry loop every job consumer depends on, and a stub that swallowed it would let a\n * broken retry pass.\n * - **`nack(requeue: false)` dead-letters** to the queue named by the source queue's\n * `deadLetterExchange`/`deadLetterRoutingKey` assertion when one was declared, so a test can assert\n * a poison message ARRIVED somewhere rather than merely that it left.\n * - **`scheduleDelayedRetry` really waits**, on a timer, and the delay is observable. RabbitMQ does\n * this with a per-delay TTL queue dead-lettering back to the source; the observable contract — the\n * job reappears on its source queue after `delayMs` — is identical, which is the only part a\n * consumer may depend on.\n * - **An unacknowledged message stays unacknowledged.** Nothing auto-acks. A handler that forgets to\n * settle leaves the message in flight here exactly as it would on a broker, and the count is\n * readable through {@link getQueueDepth}.\n *\n * ## What it deliberately does NOT do\n *\n * No durability, no cross-process visibility, no broker permissions, no exchange topology. Those are\n * the properties a real deployment buys a broker FOR, and simulating them here would produce a second\n * queue implementation whose divergences from RabbitMQ nobody could enumerate. This is for tests and\n * for a single-process runtime that has declared it wants no broker — it is not a smaller RabbitMQ.\n *\n * Delivery is asynchronous (`queueMicrotask`), never synchronous inside `publish`. A synchronous\n * hand-off would let a test pass that deadlocks against a real broker, because the publisher would be\n * holding whatever the handler then waits on.\n */\n\ninterface InMemoryQueue {\n readonly messages: QueueConsumeMessage[];\n readonly options: QueueAssertOptions;\n /** In-flight: delivered and not yet settled. Keyed by the identity handed to the handler. */\n readonly unsettled: Set<QueueConsumeMessage>;\n consumer?: { tag: string; handler: MessageHandler };\n draining: boolean;\n}\n\n@injectable()\nexport class InMemoryQueueAdapterBackendService implements QueueAdapter {\n private readonly queues = new Map<string, InMemoryQueue>();\n private readonly pendingDelays = new Set<NodeJS.Timeout>();\n private readonly podId = `in-memory-${randomUUID()}`;\n private replyQueueName: string | null = null;\n private connected = false;\n\n constructor(\n @inject(SAAS_SERVICE_TYPES.Logger) private readonly logger: LoggerService,\n ) {}\n\n public async connect(): Promise<void> {\n this.connected = true;\n }\n\n public async close(): Promise<void> {\n // Timers first: a delayed retry firing after close would republish onto a queue nobody is\n // consuming, and in a test run that surfaces as an unhandled rejection in the NEXT test.\n for (const timer of this.pendingDelays) clearTimeout(timer);\n this.pendingDelays.clear();\n this.queues.clear();\n this.replyQueueName = null;\n this.connected = false;\n }\n\n public isConnected(): boolean {\n return this.connected;\n }\n\n public async assertQueue(queueName: string, options: QueueAssertOptions = {}): Promise<void> {\n const existing = this.queues.get(queueName);\n if (existing) {\n // Idempotent, like the broker's own `assertQueue`. The options of the FIRST assertion win, so a\n // later assertion cannot silently retune a live queue's dead-lettering.\n return;\n }\n this.queues.set(queueName, { messages: [], options, unsettled: new Set(), draining: false });\n }\n\n public async publish(queueName: string, payload: JobPayload, options: PublishOptions = {}): Promise<void> {\n await this.assertQueue(queueName);\n this.enqueue(queueName, this.buildMessage(payload, options), 'back');\n }\n\n public async scheduleDelayedRetry(\n sourceQueueName: string,\n job: JobPayload,\n delayMs: number,\n options: PublishOptions = {},\n ): Promise<void> {\n await this.assertQueue(sourceQueueName);\n /*\n * A timer, where RabbitMQ uses a per-delay queue whose TTL dead-letters back to the source. The\n * MECHANISM differs and the observable contract does not: the job reappears on its source queue\n * after `delayMs`. A consumer that depended on the intermediate delay queue existing would be\n * depending on a RabbitMQ implementation detail, which is exactly what the port exists to stop.\n */\n const timer = setTimeout(() => {\n this.pendingDelays.delete(timer);\n this.enqueue(sourceQueueName, this.buildMessage(job, options), 'back');\n }, delayMs);\n // Never hold the event loop open: a pending retry must not keep a test process (or a shutting-down\n // runtime) alive past its work.\n timer.unref?.();\n this.pendingDelays.add(timer);\n }\n\n public async consume(queueName: string, handler: MessageHandler): Promise<string> {\n await this.assertQueue(queueName);\n const queue = this.queues.get(queueName) as InMemoryQueue;\n const tag = `in-memory-consumer-${randomUUID()}`;\n queue.consumer = { tag, handler };\n this.scheduleDrain(queueName);\n return tag;\n }\n\n public async cancelConsumer(queueName: string): Promise<void> {\n const queue = this.queues.get(queueName);\n if (queue) queue.consumer = undefined;\n }\n\n public async setupReplyQueue(\n appId: string,\n onReply: (correlationId: string, result: JobResult) => void,\n ): Promise<string> {\n const queueName = `${appId}.replies.${this.podId}`;\n await this.assertQueue(queueName, { exclusive: true, autoDelete: true });\n await this.consume(queueName, async (message, acknowledger) => {\n const correlationId = message.properties.correlationId;\n if (typeof correlationId === 'string') {\n onReply(correlationId, JSON.parse(message.content.toString()) as JobResult);\n }\n acknowledger.ack(message);\n });\n this.replyQueueName = queueName;\n return queueName;\n }\n\n public async publishResult(replyTo: string, correlationId: string, result: JobResult): Promise<void> {\n await this.assertQueue(replyTo);\n this.enqueue(\n replyTo,\n {\n content: Buffer.from(JSON.stringify(result)),\n fields: { redelivered: false },\n properties: { correlationId },\n },\n 'back',\n );\n }\n\n public getReplyQueueName(): string | null {\n return this.replyQueueName;\n }\n\n public async getQueueDepth(queueName: string): Promise<number | null> {\n // A real number, not `null`: this adapter genuinely knows, and monitoring is one of the things a\n // broker-free lane exists to exercise. `null` is reserved for \"cannot say\", which would be a lie\n // here.\n return this.queues.get(queueName)?.messages.length ?? 0;\n }\n\n public getPodId(): string {\n return this.podId;\n }\n\n /** In-flight count for a queue — delivered, not yet settled. Test-facing, and the reason it exists. */\n public getUnsettledCount(queueName: string): number {\n return this.queues.get(queueName)?.unsettled.size ?? 0;\n }\n\n /**\n * Every queue this adapter currently knows about.\n *\n * Test-facing, and it exists because of a mutation that survived without it: a version that\n * INVENTED a dead-letter destination when a queue declared none passed a suite asserting only that\n * the source queue was empty. \"The message went nowhere\" is a claim about every queue, and it\n * cannot be checked one queue at a time.\n */\n public getQueueNames(): readonly string[] {\n return [...this.queues.keys()];\n }\n\n /**\n * Delayed retries still waiting to fire.\n *\n * Also mutation-driven: `close()` clearing the queue map makes a late timer harmless by accident,\n * so a test asserting depth after close passed with the timer cleanup deleted. This exposes the\n * mechanism itself, which is the thing the cleanup is actually for.\n */\n public getPendingDelayCount(): number {\n return this.pendingDelays.size;\n }\n\n private buildMessage(payload: JobPayload | JobResult, options: PublishOptions): QueueConsumeMessage {\n return {\n content: Buffer.from(JSON.stringify(payload)),\n fields: { redelivered: false },\n // Only what the port declares. `priority` and `expiration` are accepted by `PublishOptions`\n // and are BROKER scheduling hints — this queue has no priority ordering and says so by not\n // pretending to carry them, rather than storing a value nothing reads.\n properties: {\n correlationId: options.correlationId ?? null,\n replyTo: options.replyTo,\n },\n };\n }\n\n private enqueue(queueName: string, message: QueueConsumeMessage, end: 'front' | 'back'): void {\n const queue = this.queues.get(queueName);\n if (!queue) return;\n if (end === 'front') queue.messages.unshift(message);\n else queue.messages.push(message);\n this.scheduleDrain(queueName);\n }\n\n /**\n * Deliver on a microtask, one message at a time, never re-entrantly.\n *\n * `draining` is what makes a handler that publishes to its OWN queue terminate: without it the\n * enqueue inside the handler re-enters the drain and the stack grows until it overflows — a failure\n * that would appear only under the in-memory adapter and would read as a defect in the consumer.\n */\n private scheduleDrain(queueName: string): void {\n const queue = this.queues.get(queueName);\n if (!queue || queue.draining || !queue.consumer) return;\n queue.draining = true;\n queueMicrotask(() => void this.drain(queueName));\n }\n\n private async drain(queueName: string): Promise<void> {\n const queue = this.queues.get(queueName);\n if (!queue) return;\n try {\n while (queue.consumer && queue.messages.length > 0) {\n const message = queue.messages.shift() as QueueConsumeMessage;\n queue.unsettled.add(message);\n try {\n await queue.consumer.handler(message, this.acknowledgerFor(queueName));\n } catch (error) {\n /*\n * A handler that THROWS has not settled the message, and the broker would hold it in\n * flight until the channel closed. Mirrored rather than silently requeued: auto-requeueing\n * here would turn a crashing handler into an infinite hot loop that no real deployment\n * would produce.\n */\n this.logger.warn('In-memory queue handler threw; message left unsettled', {\n queueName,\n error: describeCaughtError(error),\n });\n }\n }\n } finally {\n queue.draining = false;\n // A message that arrived while we were awaiting a handler needs its own drain.\n if (queue.consumer && queue.messages.length > 0) this.scheduleDrain(queueName);\n }\n }\n\n private acknowledgerFor(queueName: string): QueueMessageAcknowledger {\n return {\n ack: (message) => {\n this.queues.get(queueName)?.unsettled.delete(message);\n },\n nack: (message, _allUpTo = false, requeue = false) => {\n const queue = this.queues.get(queueName);\n if (!queue) return;\n queue.unsettled.delete(message);\n if (requeue) {\n // FRONT, and redelivered — the broker's own semantics for a requeue, and the difference a\n // retry test can actually observe.\n this.enqueue(queueName, { ...message, fields: { ...message.fields, redelivered: true } }, 'front');\n return;\n }\n this.deadLetter(queue, message);\n },\n };\n }\n\n /**\n * Route a rejected message to the dead-letter destination the source queue DECLARED.\n *\n * Only when one was declared. Inventing a destination would make a test pass that proves nothing\n * about a deployment whose queue was asserted without dead-lettering — the message is dropped there,\n * and dropping it here is the truthful simulation.\n */\n private deadLetter(queue: InMemoryQueue, message: QueueConsumeMessage): void {\n const destination = queue.options.deadLetterRoutingKey ?? queue.options.deadLetterExchange;\n if (!destination) return;\n if (!this.queues.has(destination)) {\n this.queues.set(destination, { messages: [], options: {}, unsettled: new Set(), draining: false });\n }\n this.enqueue(destination, message, 'back');\n }\n}\n"]}

package/dist/esm/queue/adapters/queue-adapter.backend.binding.d.ts ADDED Viewed

@@ -0,0 +1,12 @@
+import type { Container } from 'inversify';
+import { QueueAdapterType } from '@wildo-ai/saas-models';
+/**
+ * Bind the queue adapter a runtime will use.
+ *
+ * Rebinds when the token is already bound, so a test lane can select the in-memory adapter against a
+ * container the framework has already configured — which is the shape every consumer of this
+ * actually needs, and a bind-only version would have forced each of them to build a container from
+ * scratch.
+ */
+export declare function bindQueueAdapter(container: Container, adapterType: QueueAdapterType): void;
+//# sourceMappingURL=queue-adapter.backend.binding.d.ts.map

package/dist/esm/queue/adapters/queue-adapter.backend.binding.d.ts.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"queue-adapter.backend.binding.d.ts","sourceRoot":"","sources":["../../../../../src/queue/adapters/queue-adapter.backend.binding.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAkCzD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,GAAG,IAAI,CAM1F"}