@datatechsolutions/ui 2.7.117 → 2.7.119

package/dist/{chunk-OQAZ2BIC.mjs → chunk-55S2KOTZ.mjs}

@@ -272,5 +272,5 @@ function topologicalSortAgents(graph) {
 }
 
 export { topologicalSortAgents, validateWorkflowGraph };
-//# sourceMappingURL=chunk-OQAZ2BIC.mjs.map
-//# sourceMappingURL=chunk-OQAZ2BIC.mjs.map
+//# sourceMappingURL=chunk-55S2KOTZ.mjs.map
+//# sourceMappingURL=chunk-55S2KOTZ.mjs.map

package/dist/{chunk-OQAZ2BIC.mjs.map → chunk-55S2KOTZ.mjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/workflow/utils/workflow-validator.ts"],"names":[],"mappings":";AA0CO,SAAS,sBAAsB,KAAA,EAAwC;AAC5E,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA0B;AAE9C,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAAA,EAC3B;AAGA,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,OAAO,CAAA;AACrE,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC3B,IAAA,MAAA,CAAO,KAAK,qCAAqC,CAAA;AAAA,EACnD;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,KAAK,CAAA,MAAA,EAAS,IAAA,CAAK,EAAE,CAAA,uCAAA,EAA0C,IAAA,CAAK,MAAM,CAAA,CAAA,CAAG,CAAA;AAAA,IACtF;AACA,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,KAAK,CAAA,MAAA,EAAS,IAAA,CAAK,EAAE,CAAA,uCAAA,EAA0C,IAAA,CAAK,MAAM,CAAA,CAAA,CAAG,CAAA;AAAA,IACtF;AAAA,EACF;AAGA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAY;AACzC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,gBAAA,CAAiB,GAAA,CAAI,KAAK,MAAM,CAAA;AAChC,IAAA,gBAAA,CAAiB,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EAClC;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAE9B,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAClC,MAAA,MAAA,CAAO,IAAA,CAAK,SAAS,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA,GAAA,EAAM,IAAA,CAAK,IAAI,CAAA,oCAAA,CAAsC,CAAA;AAAA,IAC3F;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,IAAI,CAAC,UAAA,IAAc,CAAC,UAAA,EAAY;AAEhC,IAAA,IAAI,UAAA,CAAW,IAAA,KAAS,MAAA,IAAU,UAAA,CAAW,SAAS,OAAA,EAAS;AAC7D,MAAA,MAAA,CAAO,IAAA,CAAK,SAAS,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,uCAAA,EAA0C,UAAA,CAAW,IAAI,CAAA,MAAA,CAAQ,CAAA;AAAA,IAC7G;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,MAAM,CAAA;AACnE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,QAAA,CAAS,EAAE,CAAA;AAC9E,IAAA,MAAM,cAAA,GAAiB,aAAA,CAAc,IAAA,CAAK,CAAC,IAAA,KAAS;AAClD,MAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,MAAA,OAAO,YAAY,IAAA,KAAS,OAAA;AAAA,IAC9B,CAAC,CAAA;AACD,IAAA,IAAI,aAAA,CAAc,MAAA,KAAW,CAAA,IAAK,CAAC,cAAA,EAAgB;AACjD,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,MAAA,EAAS,QAAA,CAAS,IAAA,CAAK,KAAK,CAAA,gDAAA,CAAkD,CAAA;AAAA,IAC5F;AAAA,EACF;AAGA,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,MAAM,UAAA,GAAa,WAAA,CAAY,UAAA,EAAY,KAAA,CAAM,OAAO,OAAO,CAAA;AAC/D,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,MAAA,CAAO,KAAK,UAAU,CAAA;AAAA,IACxB;AAAA,EACF;AAGA,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,OAAO,CAAA;AACrE,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,MAAA,CAAO,KAAK,gCAAgC,CAAA;AAAA,EAC9C;AAGA,EAAA,MAAM,QAAA,GAAW,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,KAAK,CAAA;AACjE,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,MAAA,CAAO,KAAK,8BAA8B,CAAA;AAAA,EAC5C;AAGA,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,SAAA,CAAU,EAAE,CAAA;AAC/E,IAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,MAAA,MAAA,CAAO,KAAK,6CAA6C,CAAA;AAAA,IAC3D;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,OAAA,CAAQ,EAAE,CAAA;AAC7E,IAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,MAAA,MAAA,CAAO,KAAK,2CAA2C,CAAA;AAAA,IACzD;AAAA,EACF;AAGA,EAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,SAAS,CAAA;AACxE,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,MAAA,GAAS,WAAW,IAAA,CAAK,MAAA;AAC/B,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,WAAW,CAAA,EAAG;AAC7C,MAAA,MAAA,CAAO,KAAK,+CAA+C,CAAA;AAAA,IAC7D;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,MAAM,CAAA;AACnE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,MAAA,GAAS,SAAS,IAAA,CAAK,MAAA;AAC7B,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,IAAA,CAAK,MAAK,EAAG;AAClC,MAAA,MAAA,CAAO,KAAK,kCAAkC,CAAA;AAAA,IAChD;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,cAAc,CAAA;AAC3E,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,MAAA,GAAS,SAAS,IAAA,CAAK,MAAA;AAC7B,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,GAAA,CAAI,MAAK,EAAG;AACjC,MAAA,MAAA,CAAO,KAAK,mCAAmC,CAAA;AAAA,IACjD;AAAA,EACF;AAGA,EAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,oBAAoB,CAAA;AACrF,EAAA,KAAA,MAAW,gBAAgB,aAAA,EAAe;AACxC,IAAA,MAAM,MAAA,GAAS,aAAa,IAAA,CAAK,MAAA;AACjC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,QAAA,CAAS,MAAK,EAAG;AACtC,MAAA,MAAA,CAAO,KAAK,0CAA0C,CAAA;AAAA,IACxD;AAAA,EACF;AAGA,EAAA,MAAM,kBAAA,GAAqB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,gBAAgB,CAAA;AACtF,EAAA,KAAA,MAAW,qBAAqB,kBAAA,EAAoB;AAClD,IAAA,MAAM,MAAA,GAAS,kBAAkB,IAAA,CAAK,MAAA;AACtC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,QAAA,CAAS,MAAK,EAAG;AACtC,MAAA,MAAA,CAAO,KAAK,mDAAmD,CAAA;AAAA,IACjE;AAAA,EACF;AAGA,EAAA,MAAM,cAAA,GAAiB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,WAAW,CAAA;AAC7E,EAAA,KAAA,MAAW,iBAAiB,cAAA,EAAgB;AAC1C,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,aAAA,CAAc,EAAE,CAAA;AACnF,IAAA,IAAI,aAAA,CAAc,WAAW,CAAA,EAAG;AAC9B,MAAA,MAAA,CAAO,KAAK,2DAA2D,CAAA;AAAA,IACzE;AAAA,EACF;AAOA,EAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,QAAQ,CAAA;AACvE,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,MAAA,GAAS,WAAW,IAAA,CAAK,MAAA;AAC/B,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,mDAAmD,CAAA;AAAA,IACjE;AAAA,EACF;AAGA,EAAA,MAAM,uBAAA,GAA0B,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,qBAAqB,CAAA;AAChG,EAAA,KAAA,MAAW,0BAA0B,uBAAA,EAAyB;AAC5D,IAAA,MAAM,MAAA,GAAS,uBAAuB,IAAA,CAAK,MAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,SAAS,CAAA,EAAG;AAC3C,MAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,IACxE,CAAA,MAAO;AACL,MAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,UAAA,CAAW,MAAA,CAAO,CAAC,aAAa,CAAC,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,CAAA;AACpF,MAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,QAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,uBAAA,GAA0B,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,qBAAqB,CAAA;AAChG,EAAA,KAAA,MAAW,0BAA0B,uBAAA,EAAyB;AAC5D,IAAA,MAAM,MAAA,GAAS,uBAAuB,IAAA,CAAK,MAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,WAAW,CAAA,EAAG;AAC7C,MAAA,MAAA,CAAO,KAAK,yDAAyD,CAAA;AAAA,IACvE,CAAA,MAAO;AACL,MAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,UAAA,CAAW,MAAA,CAAO,CAAC,cAAc,CAAC,SAAA,CAAU,IAAA,CAAK,IAAA,EAAM,CAAA;AACtF,MAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,QAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,qBAAA,GAAwB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,mBAAmB,CAAA;AAC5F,EAAA,KAAA,MAAW,wBAAwB,qBAAA,EAAuB;AACxD,IAAA,MAAM,MAAA,GAAS,qBAAqB,IAAA,CAAK,MAAA;AACzC,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,WAAA,CAAY,WAAW,CAAA,EAAG;AAC9C,MAAA,MAAA,CAAO,KAAK,wDAAwD,CAAA;AAAA,IACtE;AAAA,EACF;AAGA,EAAA,MAAM,uBAAA,GAA0B,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,qBAAqB,CAAA;AAChG,EAAA,KAAA,MAAW,0BAA0B,uBAAA,EAAyB;AAC5D,IAAA,MAAM,MAAA,GAAS,uBAAuB,IAAA,CAAK,MAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,cAAA,CAAe,WAAW,CAAA,EAAG;AACjD,MAAA,MAAA,CAAO,KAAK,8DAA8D,CAAA;AAAA,IAC5E;AACA,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,gEAAgE,CAAA;AAAA,IAC9E;AAAA,EACF;AAGA,EAAA,MAAM,sBAAA,GAAyB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,oBAAoB,CAAA;AAC9F,EAAA,KAAA,MAAW,yBAAyB,sBAAA,EAAwB;AAC1D,IAAA,MAAM,MAAA,GAAS,sBAAsB,IAAA,CAAK,MAAA;AAC1C,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,+DAA+D,CAAA;AAAA,IAC7E;AAAA,EACF;AAGA,EAAA,MAAM,iBAAA,GAAoB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,eAAe,CAAA;AACpF,EAAA,KAAA,MAAW,oBAAoB,iBAAA,EAAmB;AAChD,IAAA,MAAM,MAAA,GAAS,iBAAiB,IAAA,CAAK,MAAA;AACrC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,aAAA,CAAc,MAAK,EAAG;AAC3C,MAAA,MAAA,CAAO,KAAK,yDAAyD,CAAA;AAAA,IACvE;AACA,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,IACxE;AAAA,EACF;AAGA,EAAA,MAAM,mBAAA,GAAsB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,iBAAiB,CAAA;AACxF,EAAA,KAAA,MAAW,sBAAsB,mBAAA,EAAqB;AACpD,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,kBAAA,CAAmB,EAAE,CAAA;AACxF,IAAA,MAAM,kBAAA,GAAqB,aAAA,CAAc,IAAA,CAAK,CAAC,IAAA,KAAS;AACtD,MAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,MAAA,OAAO,YAAY,IAAA,KAAS,WAAA;AAAA,IAC9B,CAAC,CAAA;AACD,IAAA,IAAI,aAAA,CAAc,MAAA,KAAW,CAAA,IAAK,CAAC,kBAAA,EAAoB;AACrD,MAAA,MAAA,CAAO,KAAK,8EAA8E,CAAA;AAAA,IAC5F;AAAA,EACF;AAIA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,OAAO,MAAA,KAAW,CAAA;AAAA,IACzB;AAAA,GACF;AACF;AAKA,SAAS,WAAA,CACP,UAAA,EACA,KAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAC1D,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAsB;AAEhD,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,aAAA,CAAc,GAAA,CAAI,OAAA,EAAS,EAAE,CAAA;AAAA,EAC/B;AAEA,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,IACE,UAAA,EAAY,IAAA,KAAS,OAAA,IACrB,UAAA,EAAY,SAAS,OAAA,IACrB,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,IACxB,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EACxB;AACA,MAAA,aAAA,CAAc,IAAI,IAAA,CAAK,MAAM,CAAA,CAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,IAClD;AAAA,EACF;AAEA,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,SAAS,YAAY,MAAA,EAAyB;AAC5C,IAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,IAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAElB,IAAA,MAAM,SAAA,GAAY,aAAA,CAAc,GAAA,CAAI,MAAM,KAAK,EAAC;AAChD,IAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,QAAA,IAAI,WAAA,CAAY,QAAQ,CAAA,EAAG,OAAO,IAAA;AAAA,MACpC,CAAA,MAAA,IAAW,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAChC,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,OAAO,MAAM,CAAA;AACrB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AACzB,MAAA,IAAI,WAAA,CAAY,OAAO,CAAA,EAAG;AACxB,QAAA,OAAO,yFAAA;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,IAAA;AACT;AAOO,SAAS,sBAAsB,KAAA,EAAgC;AACpE,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,OAAO,CAAA;AACrE,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAG5D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAsB;AAEhD,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,CAAC,CAAA;AACvB,IAAA,aAAA,CAAc,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AAAA,EAC/B;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,UAAA,CAAW,IAAI,IAAA,CAAK,MAAM,KAAK,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9D,MAAA,aAAA,CAAc,IAAI,IAAA,CAAK,MAAM,CAAA,CAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAChD,MAAA,QAAA,CAAS,GAAA,CAAI,KAAK,MAAA,EAAA,CAAS,QAAA,CAAS,IAAI,IAAA,CAAK,MAAM,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAAA,IAChE;AAAA,EACF;AAGA,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,MAAM,CAAA,IAAK,QAAA,EAAU;AACvC,IAAA,IAAI,MAAA,KAAW,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAAA,EACrC;AAEA,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAEnB,IAAA,KAAA,MAAW,YAAY,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA,IAAK,EAAC,EAAG;AACvD,MAAA,MAAM,SAAA,GAAA,CAAa,QAAA,CAAS,GAAA,CAAI,QAAQ,KAAK,CAAA,IAAK,CAAA;AAClD,MAAA,QAAA,CAAS,GAAA,CAAI,UAAU,SAAS,CAAA;AAChC,MAAA,IAAI,SAAA,KAAc,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,QAAQ,CAAA;AAAA,IAC1C;AAAA,EACF;AAGA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAoB;AACjD,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAA,CAAK,KAAK,QAAQ,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,MAAA,CAAO,IAAI,CAAC,MAAA,KAAW,iBAAiB,GAAA,CAAI,MAAM,KAAK,MAAM,CAAA;AACtE","file":"chunk-OQAZ2BIC.mjs","sourcesContent":["/**\n * Workflow Validator\n * =================\n * Validates the workflow graph before publishing.\n * Ensures the graph forms a valid DAG with proper node connections.\n */\n\nimport type {\n  WorkflowGraph,\n  WorkflowNode,\n  WorkflowEdge,\n  IfElseNodeConfig,\n  CodeNodeConfig,\n  HttpRequestNodeConfig,\n  TemplateTransformNodeConfig,\n  KnowledgeBaseNodeConfig,\n  AnswerNodeConfig,\n  QuestionClassifierNodeConfig,\n  ParameterExtractorNodeConfig,\n  VariableAssignerNodeConfig,\n  VariableAggregatorNodeConfig,\n  DocumentExtractorNodeConfig,\n  ListOperatorNodeConfig,\n} from '../contracts'\n\nexport type ValidationResult = {\n  valid: boolean\n  errors: string[]\n}\n\n/**\n * Validate a workflow graph for publishing.\n * Checks:\n * - At least one agent node exists\n * - All edges have valid source/target nodes\n * - No orphan nodes (every node has at least one connection, except note nodes)\n * - Tool nodes connect to agent nodes only\n * - Agent chain forms a valid DAG (no cycles)\n * - Rule nodes have incoming edges from agents\n * - Logic node constraints (start/end uniqueness, config validation)\n * - New node type validations (answer, question_classifier, parameter_extractor, etc.)\n */\nexport function validateWorkflowGraph(graph: WorkflowGraph): ValidationResult {\n  const errors: string[] = []\n  const nodeMap = new Map<string, WorkflowNode>()\n\n  for (const node of graph.nodes) {\n    nodeMap.set(node.id, node)\n  }\n\n  // 1. At least one agent node\n  const agentNodes = graph.nodes.filter((node) => node.type === 'agent')\n  if (agentNodes.length === 0) {\n    errors.push('At least one agent node is required')\n  }\n\n  // 2. All edges reference valid nodes\n  for (const edge of graph.edges) {\n    if (!nodeMap.has(edge.source)) {\n      errors.push(`Edge \"${edge.id}\" references non-existent source node \"${edge.source}\"`)\n    }\n    if (!nodeMap.has(edge.target)) {\n      errors.push(`Edge \"${edge.id}\" references non-existent target node \"${edge.target}\"`)\n    }\n  }\n\n  // 3. No orphan nodes (every node should have at least one connection, except note nodes)\n  const connectedNodeIds = new Set<string>()\n  for (const edge of graph.edges) {\n    connectedNodeIds.add(edge.source)\n    connectedNodeIds.add(edge.target)\n  }\n\n  for (const node of graph.nodes) {\n    // Note nodes are annotations and not part of execution — skip orphan check\n    if (node.type === 'note') continue\n    if (!connectedNodeIds.has(node.id)) {\n      errors.push(`Node \"${node.data.label}\" (${node.type}) is not connected to any other node`)\n    }\n  }\n\n  // 4. Tool -> Agent only\n  for (const edge of graph.edges) {\n    const sourceNode = nodeMap.get(edge.source)\n    const targetNode = nodeMap.get(edge.target)\n    if (!sourceNode || !targetNode) continue\n\n    if (sourceNode.type === 'tool' && targetNode.type !== 'agent') {\n      errors.push(`Tool \"${sourceNode.data.label}\" can only connect to agent nodes, not ${targetNode.type} nodes`)\n    }\n  }\n\n  // 5. Rule nodes should have incoming edges from agents\n  const ruleNodes = graph.nodes.filter((node) => node.type === 'rule')\n  for (const ruleNode of ruleNodes) {\n    const incomingEdges = graph.edges.filter((edge) => edge.target === ruleNode.id)\n    const hasAgentSource = incomingEdges.some((edge) => {\n      const sourceNode = nodeMap.get(edge.source)\n      return sourceNode?.type === 'agent'\n    })\n    if (incomingEdges.length === 0 || !hasAgentSource) {\n      errors.push(`Rule \"${ruleNode.data.label}\" must have an incoming connection from an agent`)\n    }\n  }\n\n  // 6. No cycles (topological sort of agent nodes)\n  if (agentNodes.length > 1) {\n    const cycleError = detectCycle(agentNodes, graph.edges, nodeMap)\n    if (cycleError) {\n      errors.push(cycleError)\n    }\n  }\n\n  // 7. At most 1 start node\n  const startNodes = graph.nodes.filter((node) => node.type === 'start')\n  if (startNodes.length > 1) {\n    errors.push('Only one Start node is allowed')\n  }\n\n  // 8. At most 1 end node\n  const endNodes = graph.nodes.filter((node) => node.type === 'end')\n  if (endNodes.length > 1) {\n    errors.push('Only one End node is allowed')\n  }\n\n  // 9. Start node has no incoming edges\n  for (const startNode of startNodes) {\n    const incomingEdges = graph.edges.filter((edge) => edge.target === startNode.id)\n    if (incomingEdges.length > 0) {\n      errors.push('Start node cannot have incoming connections')\n    }\n  }\n\n  // 10. End node has no outgoing edges\n  for (const endNode of endNodes) {\n    const outgoingEdges = graph.edges.filter((edge) => edge.source === endNode.id)\n    if (outgoingEdges.length > 0) {\n      errors.push('End node cannot have outgoing connections')\n    }\n  }\n\n  // 11. IF/ELSE has at least 1 condition\n  const ifElseNodes = graph.nodes.filter((node) => node.type === 'if_else')\n  for (const ifElseNode of ifElseNodes) {\n    const config = ifElseNode.data.config as IfElseNodeConfig | undefined\n    if (!config || config.conditions.length === 0) {\n      errors.push('IF/ELSE node must have at least one condition')\n    }\n  }\n\n  // 12. Code node has non-empty code\n  const codeNodes = graph.nodes.filter((node) => node.type === 'code')\n  for (const codeNode of codeNodes) {\n    const config = codeNode.data.config as CodeNodeConfig | undefined\n    if (!config || !config.code.trim()) {\n      errors.push('Code node must have code content')\n    }\n  }\n\n  // 13. HTTP Request has valid URL\n  const httpNodes = graph.nodes.filter((node) => node.type === 'http_request')\n  for (const httpNode of httpNodes) {\n    const config = httpNode.data.config as HttpRequestNodeConfig | undefined\n    if (!config || !config.url.trim()) {\n      errors.push('HTTP Request node must have a URL')\n    }\n  }\n\n  // 14. Template has non-empty template\n  const templateNodes = graph.nodes.filter((node) => node.type === 'template_transform')\n  for (const templateNode of templateNodes) {\n    const config = templateNode.data.config as TemplateTransformNodeConfig | undefined\n    if (!config || !config.template.trim()) {\n      errors.push('Template node must have template content')\n    }\n  }\n\n  // 15. Knowledge Base has source ID\n  const knowledgeBaseNodes = graph.nodes.filter((node) => node.type === 'knowledge_base')\n  for (const knowledgeBaseNode of knowledgeBaseNodes) {\n    const config = knowledgeBaseNode.data.config as KnowledgeBaseNodeConfig | undefined\n    if (!config || !config.sourceId.trim()) {\n      errors.push('Knowledge Base node must have a source configured')\n    }\n  }\n\n  // 16. Iteration has outgoing edge\n  const iterationNodes = graph.nodes.filter((node) => node.type === 'iteration')\n  for (const iterationNode of iterationNodes) {\n    const outgoingEdges = graph.edges.filter((edge) => edge.source === iterationNode.id)\n    if (outgoingEdges.length === 0) {\n      errors.push('Iteration node must have at least one outgoing connection')\n    }\n  }\n\n  // ============================================================================\n  // New node type validations (9 new node types)\n  // ============================================================================\n\n  // 17. Answer node: outputTemplate must be non-empty\n  const answerNodes = graph.nodes.filter((node) => node.type === 'answer')\n  for (const answerNode of answerNodes) {\n    const config = answerNode.data.config as AnswerNodeConfig | undefined\n    if (!config || !config.outputTemplate.trim()) {\n      errors.push('Answer node must have a non-empty output template')\n    }\n  }\n\n  // 18. Question Classifier: must have >= 2 categories with non-empty names\n  const questionClassifierNodes = graph.nodes.filter((node) => node.type === 'question_classifier')\n  for (const questionClassifierNode of questionClassifierNodes) {\n    const config = questionClassifierNode.data.config as QuestionClassifierNodeConfig | undefined\n    if (!config || config.categories.length < 2) {\n      errors.push('Question Classifier node must have at least 2 categories')\n    } else {\n      const emptyCategories = config.categories.filter((category) => !category.name.trim())\n      if (emptyCategories.length > 0) {\n        errors.push('Question Classifier node has categories with empty names')\n      }\n    }\n  }\n\n  // 19. Parameter Extractor: must have >= 1 parameter with non-empty name\n  const parameterExtractorNodes = graph.nodes.filter((node) => node.type === 'parameter_extractor')\n  for (const parameterExtractorNode of parameterExtractorNodes) {\n    const config = parameterExtractorNode.data.config as ParameterExtractorNodeConfig | undefined\n    if (!config || config.parameters.length === 0) {\n      errors.push('Parameter Extractor node must have at least 1 parameter')\n    } else {\n      const emptyParameters = config.parameters.filter((parameter) => !parameter.name.trim())\n      if (emptyParameters.length > 0) {\n        errors.push('Parameter Extractor node has parameters with empty names')\n      }\n    }\n  }\n\n  // 20. Variable Assigner: must have >= 1 assignment\n  const variableAssignerNodes = graph.nodes.filter((node) => node.type === 'variable_assigner')\n  for (const variableAssignerNode of variableAssignerNodes) {\n    const config = variableAssignerNode.data.config as VariableAssignerNodeConfig | undefined\n    if (!config || config.assignments.length === 0) {\n      errors.push('Variable Assigner node must have at least 1 assignment')\n    }\n  }\n\n  // 21. Variable Aggregator: must have >= 1 inputVariable and non-empty outputVariable\n  const variableAggregatorNodes = graph.nodes.filter((node) => node.type === 'variable_aggregator')\n  for (const variableAggregatorNode of variableAggregatorNodes) {\n    const config = variableAggregatorNode.data.config as VariableAggregatorNodeConfig | undefined\n    if (!config || config.inputVariables.length === 0) {\n      errors.push('Variable Aggregator node must have at least 1 input variable')\n    }\n    if (!config || !config.outputVariable.trim()) {\n      errors.push('Variable Aggregator node must have a non-empty output variable')\n    }\n  }\n\n  // 22. Document Extractor: outputVariable must be non-empty\n  const documentExtractorNodes = graph.nodes.filter((node) => node.type === 'document_extractor')\n  for (const documentExtractorNode of documentExtractorNodes) {\n    const config = documentExtractorNode.data.config as DocumentExtractorNodeConfig | undefined\n    if (!config || !config.outputVariable.trim()) {\n      errors.push('Document Extractor node must have a non-empty output variable')\n    }\n  }\n\n  // 23. List Operator: inputVariable and outputVariable must be non-empty\n  const listOperatorNodes = graph.nodes.filter((node) => node.type === 'list_operator')\n  for (const listOperatorNode of listOperatorNodes) {\n    const config = listOperatorNode.data.config as ListOperatorNodeConfig | undefined\n    if (!config || !config.inputVariable.trim()) {\n      errors.push('List Operator node must have a non-empty input variable')\n    }\n    if (!config || !config.outputVariable.trim()) {\n      errors.push('List Operator node must have a non-empty output variable')\n    }\n  }\n\n  // 24. Iteration Start: must follow an Iteration node (incoming edge source must be iteration type)\n  const iterationStartNodes = graph.nodes.filter((node) => node.type === 'iteration_start')\n  for (const iterationStartNode of iterationStartNodes) {\n    const incomingEdges = graph.edges.filter((edge) => edge.target === iterationStartNode.id)\n    const hasIterationSource = incomingEdges.some((edge) => {\n      const sourceNode = nodeMap.get(edge.source)\n      return sourceNode?.type === 'iteration'\n    })\n    if (incomingEdges.length === 0 || !hasIterationSource) {\n      errors.push('Iteration Start node must have an incoming connection from an Iteration node')\n    }\n  }\n\n  // Note: Note nodes skip validation — they are annotations, not part of execution.\n\n  return {\n    valid: errors.length === 0,\n    errors,\n  }\n}\n\n/**\n * Detect cycles in the agent subgraph using DFS.\n */\nfunction detectCycle(\n  agentNodes: WorkflowNode[],\n  edges: WorkflowEdge[],\n  nodeMap: Map<string, WorkflowNode>\n): string | null {\n  const agentIds = new Set(agentNodes.map((node) => node.id))\n  const adjacencyList = new Map<string, string[]>()\n\n  for (const agentId of agentIds) {\n    adjacencyList.set(agentId, [])\n  }\n\n  for (const edge of edges) {\n    const sourceNode = nodeMap.get(edge.source)\n    const targetNode = nodeMap.get(edge.target)\n    if (\n      sourceNode?.type === 'agent' &&\n      targetNode?.type === 'agent' &&\n      agentIds.has(edge.source) &&\n      agentIds.has(edge.target)\n    ) {\n      adjacencyList.get(edge.source)!.push(edge.target)\n    }\n  }\n\n  const visited = new Set<string>()\n  const inStack = new Set<string>()\n\n  function hasCycleDfs(nodeId: string): boolean {\n    visited.add(nodeId)\n    inStack.add(nodeId)\n\n    const neighbors = adjacencyList.get(nodeId) ?? []\n    for (const neighbor of neighbors) {\n      if (!visited.has(neighbor)) {\n        if (hasCycleDfs(neighbor)) return true\n      } else if (inStack.has(neighbor)) {\n        return true\n      }\n    }\n\n    inStack.delete(nodeId)\n    return false\n  }\n\n  for (const agentId of agentIds) {\n    if (!visited.has(agentId)) {\n      if (hasCycleDfs(agentId)) {\n        return 'Cycle detected in agent pipeline — agents must form a directed acyclic graph (DAG)'\n      }\n    }\n  }\n\n  return null\n}\n\n/**\n * Topologically sort agent nodes from the graph edges.\n * Returns agent entityIds in execution order.\n * Logic nodes are skipped — only agent entityIds are returned.\n */\nexport function topologicalSortAgents(graph: WorkflowGraph): string[] {\n  const agentNodes = graph.nodes.filter((node) => node.type === 'agent')\n  const agentIdSet = new Set(agentNodes.map((node) => node.id))\n\n  // Build adjacency list for agent-to-agent edges\n  const inDegree = new Map<string, number>()\n  const adjacencyList = new Map<string, string[]>()\n\n  for (const node of agentNodes) {\n    inDegree.set(node.id, 0)\n    adjacencyList.set(node.id, [])\n  }\n\n  for (const edge of graph.edges) {\n    if (agentIdSet.has(edge.source) && agentIdSet.has(edge.target)) {\n      adjacencyList.get(edge.source)!.push(edge.target)\n      inDegree.set(edge.target, (inDegree.get(edge.target) ?? 0) + 1)\n    }\n  }\n\n  // Kahn's algorithm\n  const queue: string[] = []\n  for (const [nodeId, degree] of inDegree) {\n    if (degree === 0) queue.push(nodeId)\n  }\n\n  const sorted: string[] = []\n  while (queue.length > 0) {\n    const current = queue.shift()!\n    sorted.push(current)\n\n    for (const neighbor of adjacencyList.get(current) ?? []) {\n      const newDegree = (inDegree.get(neighbor) ?? 1) - 1\n      inDegree.set(neighbor, newDegree)\n      if (newDegree === 0) queue.push(neighbor)\n    }\n  }\n\n  // Map node IDs back to entityIds\n  const nodeIdToEntityId = new Map<string, string>()\n  for (const node of agentNodes) {\n    nodeIdToEntityId.set(node.id, node.data.entityId)\n  }\n\n  return sorted.map((nodeId) => nodeIdToEntityId.get(nodeId) ?? nodeId)\n}\n"]}
+{"version":3,"sources":["../src/workflow/utils/workflow-validator.ts"],"names":[],"mappings":";AA0CO,SAAS,sBAAsB,KAAA,EAAwC;AAC5E,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA0B;AAE9C,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AAAA,EAC3B;AAGA,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,OAAO,CAAA;AACrE,EAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AAC3B,IAAA,MAAA,CAAO,KAAK,qCAAqC,CAAA;AAAA,EACnD;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,KAAK,CAAA,MAAA,EAAS,IAAA,CAAK,EAAE,CAAA,uCAAA,EAA0C,IAAA,CAAK,MAAM,CAAA,CAAA,CAAG,CAAA;AAAA,IACtF;AACA,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC7B,MAAA,MAAA,CAAO,KAAK,CAAA,MAAA,EAAS,IAAA,CAAK,EAAE,CAAA,uCAAA,EAA0C,IAAA,CAAK,MAAM,CAAA,CAAA,CAAG,CAAA;AAAA,IACtF;AAAA,EACF;AAGA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAY;AACzC,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,gBAAA,CAAiB,GAAA,CAAI,KAAK,MAAM,CAAA;AAChC,IAAA,gBAAA,CAAiB,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EAClC;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAE9B,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AAC1B,IAAA,IAAI,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAClC,MAAA,MAAA,CAAO,IAAA,CAAK,SAAS,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA,GAAA,EAAM,IAAA,CAAK,IAAI,CAAA,oCAAA,CAAsC,CAAA;AAAA,IAC3F;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,IAAI,CAAC,UAAA,IAAc,CAAC,UAAA,EAAY;AAEhC,IAAA,IAAI,UAAA,CAAW,IAAA,KAAS,MAAA,IAAU,UAAA,CAAW,SAAS,OAAA,EAAS;AAC7D,MAAA,MAAA,CAAO,IAAA,CAAK,SAAS,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,uCAAA,EAA0C,UAAA,CAAW,IAAI,CAAA,MAAA,CAAQ,CAAA;AAAA,IAC7G;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,MAAM,CAAA;AACnE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,QAAA,CAAS,EAAE,CAAA;AAC9E,IAAA,MAAM,cAAA,GAAiB,aAAA,CAAc,IAAA,CAAK,CAAC,IAAA,KAAS;AAClD,MAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,MAAA,OAAO,YAAY,IAAA,KAAS,OAAA;AAAA,IAC9B,CAAC,CAAA;AACD,IAAA,IAAI,aAAA,CAAc,MAAA,KAAW,CAAA,IAAK,CAAC,cAAA,EAAgB;AACjD,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,MAAA,EAAS,QAAA,CAAS,IAAA,CAAK,KAAK,CAAA,gDAAA,CAAkD,CAAA;AAAA,IAC5F;AAAA,EACF;AAGA,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,MAAM,UAAA,GAAa,WAAA,CAAY,UAAA,EAAY,KAAA,CAAM,OAAO,OAAO,CAAA;AAC/D,IAAA,IAAI,UAAA,EAAY;AACd,MAAA,MAAA,CAAO,KAAK,UAAU,CAAA;AAAA,IACxB;AAAA,EACF;AAGA,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,OAAO,CAAA;AACrE,EAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,IAAA,MAAA,CAAO,KAAK,gCAAgC,CAAA;AAAA,EAC9C;AAGA,EAAA,MAAM,QAAA,GAAW,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,KAAK,CAAA;AACjE,EAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,IAAA,MAAA,CAAO,KAAK,8BAA8B,CAAA;AAAA,EAC5C;AAGA,EAAA,KAAA,MAAW,aAAa,UAAA,EAAY;AAClC,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,SAAA,CAAU,EAAE,CAAA;AAC/E,IAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,MAAA,MAAA,CAAO,KAAK,6CAA6C,CAAA;AAAA,IAC3D;AAAA,EACF;AAGA,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,OAAA,CAAQ,EAAE,CAAA;AAC7E,IAAA,IAAI,aAAA,CAAc,SAAS,CAAA,EAAG;AAC5B,MAAA,MAAA,CAAO,KAAK,2CAA2C,CAAA;AAAA,IACzD;AAAA,EACF;AAGA,EAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,SAAS,CAAA;AACxE,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,MAAA,GAAS,WAAW,IAAA,CAAK,MAAA;AAC/B,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,WAAW,CAAA,EAAG;AAC7C,MAAA,MAAA,CAAO,KAAK,+CAA+C,CAAA;AAAA,IAC7D;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,MAAM,CAAA;AACnE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,MAAA,GAAS,SAAS,IAAA,CAAK,MAAA;AAC7B,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,IAAA,CAAK,MAAK,EAAG;AAClC,MAAA,MAAA,CAAO,KAAK,kCAAkC,CAAA;AAAA,IAChD;AAAA,EACF;AAGA,EAAA,MAAM,SAAA,GAAY,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,cAAc,CAAA;AAC3E,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,MAAA,GAAS,SAAS,IAAA,CAAK,MAAA;AAC7B,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,GAAA,CAAI,MAAK,EAAG;AACjC,MAAA,MAAA,CAAO,KAAK,mCAAmC,CAAA;AAAA,IACjD;AAAA,EACF;AAGA,EAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,oBAAoB,CAAA;AACrF,EAAA,KAAA,MAAW,gBAAgB,aAAA,EAAe;AACxC,IAAA,MAAM,MAAA,GAAS,aAAa,IAAA,CAAK,MAAA;AACjC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,QAAA,CAAS,MAAK,EAAG;AACtC,MAAA,MAAA,CAAO,KAAK,0CAA0C,CAAA;AAAA,IACxD;AAAA,EACF;AAGA,EAAA,MAAM,kBAAA,GAAqB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,gBAAgB,CAAA;AACtF,EAAA,KAAA,MAAW,qBAAqB,kBAAA,EAAoB;AAClD,IAAA,MAAM,MAAA,GAAS,kBAAkB,IAAA,CAAK,MAAA;AACtC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,QAAA,CAAS,MAAK,EAAG;AACtC,MAAA,MAAA,CAAO,KAAK,mDAAmD,CAAA;AAAA,IACjE;AAAA,EACF;AAGA,EAAA,MAAM,cAAA,GAAiB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,WAAW,CAAA;AAC7E,EAAA,KAAA,MAAW,iBAAiB,cAAA,EAAgB;AAC1C,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,aAAA,CAAc,EAAE,CAAA;AACnF,IAAA,IAAI,aAAA,CAAc,WAAW,CAAA,EAAG;AAC9B,MAAA,MAAA,CAAO,KAAK,2DAA2D,CAAA;AAAA,IACzE;AAAA,EACF;AAOA,EAAA,MAAM,WAAA,GAAc,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,QAAQ,CAAA;AACvE,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,MAAA,GAAS,WAAW,IAAA,CAAK,MAAA;AAC/B,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,mDAAmD,CAAA;AAAA,IACjE;AAAA,EACF;AAGA,EAAA,MAAM,uBAAA,GAA0B,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,qBAAqB,CAAA;AAChG,EAAA,KAAA,MAAW,0BAA0B,uBAAA,EAAyB;AAC5D,IAAA,MAAM,MAAA,GAAS,uBAAuB,IAAA,CAAK,MAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,SAAS,CAAA,EAAG;AAC3C,MAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,IACxE,CAAA,MAAO;AACL,MAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,UAAA,CAAW,MAAA,CAAO,CAAC,aAAa,CAAC,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,CAAA;AACpF,MAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,QAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,uBAAA,GAA0B,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,qBAAqB,CAAA;AAChG,EAAA,KAAA,MAAW,0BAA0B,uBAAA,EAAyB;AAC5D,IAAA,MAAM,MAAA,GAAS,uBAAuB,IAAA,CAAK,MAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,WAAW,CAAA,EAAG;AAC7C,MAAA,MAAA,CAAO,KAAK,yDAAyD,CAAA;AAAA,IACvE,CAAA,MAAO;AACL,MAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,UAAA,CAAW,MAAA,CAAO,CAAC,cAAc,CAAC,SAAA,CAAU,IAAA,CAAK,IAAA,EAAM,CAAA;AACtF,MAAA,IAAI,eAAA,CAAgB,SAAS,CAAA,EAAG;AAC9B,QAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,MACxE;AAAA,IACF;AAAA,EACF;AAGA,EAAA,MAAM,qBAAA,GAAwB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,mBAAmB,CAAA;AAC5F,EAAA,KAAA,MAAW,wBAAwB,qBAAA,EAAuB;AACxD,IAAA,MAAM,MAAA,GAAS,qBAAqB,IAAA,CAAK,MAAA;AACzC,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,WAAA,CAAY,WAAW,CAAA,EAAG;AAC9C,MAAA,MAAA,CAAO,KAAK,wDAAwD,CAAA;AAAA,IACtE;AAAA,EACF;AAGA,EAAA,MAAM,uBAAA,GAA0B,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,qBAAqB,CAAA;AAChG,EAAA,KAAA,MAAW,0BAA0B,uBAAA,EAAyB;AAC5D,IAAA,MAAM,MAAA,GAAS,uBAAuB,IAAA,CAAK,MAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,MAAA,CAAO,cAAA,CAAe,WAAW,CAAA,EAAG;AACjD,MAAA,MAAA,CAAO,KAAK,8DAA8D,CAAA;AAAA,IAC5E;AACA,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,gEAAgE,CAAA;AAAA,IAC9E;AAAA,EACF;AAGA,EAAA,MAAM,sBAAA,GAAyB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,oBAAoB,CAAA;AAC9F,EAAA,KAAA,MAAW,yBAAyB,sBAAA,EAAwB;AAC1D,IAAA,MAAM,MAAA,GAAS,sBAAsB,IAAA,CAAK,MAAA;AAC1C,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,+DAA+D,CAAA;AAAA,IAC7E;AAAA,EACF;AAGA,EAAA,MAAM,iBAAA,GAAoB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,eAAe,CAAA;AACpF,EAAA,KAAA,MAAW,oBAAoB,iBAAA,EAAmB;AAChD,IAAA,MAAM,MAAA,GAAS,iBAAiB,IAAA,CAAK,MAAA;AACrC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,aAAA,CAAc,MAAK,EAAG;AAC3C,MAAA,MAAA,CAAO,KAAK,yDAAyD,CAAA;AAAA,IACvE;AACA,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,cAAA,CAAe,MAAK,EAAG;AAC5C,MAAA,MAAA,CAAO,KAAK,0DAA0D,CAAA;AAAA,IACxE;AAAA,EACF;AAGA,EAAA,MAAM,mBAAA,GAAsB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,iBAAiB,CAAA;AACxF,EAAA,KAAA,MAAW,sBAAsB,mBAAA,EAAqB;AACpD,IAAA,MAAM,aAAA,GAAgB,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,MAAA,KAAW,kBAAA,CAAmB,EAAE,CAAA;AACxF,IAAA,MAAM,kBAAA,GAAqB,aAAA,CAAc,IAAA,CAAK,CAAC,IAAA,KAAS;AACtD,MAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,MAAA,OAAO,YAAY,IAAA,KAAS,WAAA;AAAA,IAC9B,CAAC,CAAA;AACD,IAAA,IAAI,aAAA,CAAc,MAAA,KAAW,CAAA,IAAK,CAAC,kBAAA,EAAoB;AACrD,MAAA,MAAA,CAAO,KAAK,8EAA8E,CAAA;AAAA,IAC5F;AAAA,EACF;AAIA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,OAAO,MAAA,KAAW,CAAA;AAAA,IACzB;AAAA,GACF;AACF;AAKA,SAAS,WAAA,CACP,UAAA,EACA,KAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAC1D,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAsB;AAEhD,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,aAAA,CAAc,GAAA,CAAI,OAAA,EAAS,EAAE,CAAA;AAAA,EAC/B;AAEA,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AAC1C,IAAA,IACE,UAAA,EAAY,IAAA,KAAS,OAAA,IACrB,UAAA,EAAY,SAAS,OAAA,IACrB,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,IACxB,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EACxB;AACA,MAAA,aAAA,CAAc,IAAI,IAAA,CAAK,MAAM,CAAA,CAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,IAClD;AAAA,EACF;AAEA,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAEhC,EAAA,SAAS,YAAY,MAAA,EAAyB;AAC5C,IAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAClB,IAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAElB,IAAA,MAAM,SAAA,GAAY,aAAA,CAAc,GAAA,CAAI,MAAM,KAAK,EAAC;AAChD,IAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,MAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC1B,QAAA,IAAI,WAAA,CAAY,QAAQ,CAAA,EAAG,OAAO,IAAA;AAAA,MACpC,CAAA,MAAA,IAAW,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA,EAAG;AAChC,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,OAAO,MAAM,CAAA;AACrB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AACzB,MAAA,IAAI,WAAA,CAAY,OAAO,CAAA,EAAG;AACxB,QAAA,OAAO,yFAAA;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,IAAA;AACT;AAOO,SAAS,sBAAsB,KAAA,EAAgC;AACpE,EAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,OAAO,CAAA;AACrE,EAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,UAAA,CAAW,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAG5D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,MAAM,aAAA,uBAAoB,GAAA,EAAsB;AAEhD,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,CAAC,CAAA;AACvB,IAAA,aAAA,CAAc,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AAAA,EAC/B;AAEA,EAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC9B,IAAA,IAAI,UAAA,CAAW,IAAI,IAAA,CAAK,MAAM,KAAK,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC9D,MAAA,aAAA,CAAc,IAAI,IAAA,CAAK,MAAM,CAAA,CAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAChD,MAAA,QAAA,CAAS,GAAA,CAAI,KAAK,MAAA,EAAA,CAAS,QAAA,CAAS,IAAI,IAAA,CAAK,MAAM,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAAA,IAChE;AAAA,EACF;AAGA,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,MAAM,CAAA,IAAK,QAAA,EAAU;AACvC,IAAA,IAAI,MAAA,KAAW,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAAA,EACrC;AAEA,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAEnB,IAAA,KAAA,MAAW,YAAY,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA,IAAK,EAAC,EAAG;AACvD,MAAA,MAAM,SAAA,GAAA,CAAa,QAAA,CAAS,GAAA,CAAI,QAAQ,KAAK,CAAA,IAAK,CAAA;AAClD,MAAA,QAAA,CAAS,GAAA,CAAI,UAAU,SAAS,CAAA;AAChC,MAAA,IAAI,SAAA,KAAc,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,QAAQ,CAAA;AAAA,IAC1C;AAAA,EACF;AAGA,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAoB;AACjD,EAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC7B,IAAA,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAA,CAAK,KAAK,QAAQ,CAAA;AAAA,EAClD;AAEA,EAAA,OAAO,MAAA,CAAO,IAAI,CAAC,MAAA,KAAW,iBAAiB,GAAA,CAAI,MAAM,KAAK,MAAM,CAAA;AACtE","file":"chunk-55S2KOTZ.mjs","sourcesContent":["/**\n * Workflow Validator\n * =================\n * Validates the workflow graph before publishing.\n * Ensures the graph forms a valid DAG with proper node connections.\n */\n\nimport type {\n  WorkflowGraph,\n  WorkflowNode,\n  WorkflowEdge,\n  IfElseNodeConfig,\n  CodeNodeConfig,\n  HttpRequestNodeConfig,\n  TemplateTransformNodeConfig,\n  KnowledgeBaseNodeConfig,\n  AnswerNodeConfig,\n  QuestionClassifierNodeConfig,\n  ParameterExtractorNodeConfig,\n  VariableAssignerNodeConfig,\n  VariableAggregatorNodeConfig,\n  DocumentExtractorNodeConfig,\n  ListOperatorNodeConfig,\n} from '../contracts'\n\nexport type ValidationResult = {\n  valid: boolean\n  errors: string[]\n}\n\n/**\n * Validate a workflow graph for publishing.\n * Checks:\n * - At least one agent node exists\n * - All edges have valid source/target nodes\n * - No orphan nodes (every node has at least one connection, except note nodes)\n * - Tool nodes connect to agent nodes only\n * - Agent chain forms a valid DAG (no cycles)\n * - Rule nodes have incoming edges from agents\n * - Logic node constraints (start/end uniqueness, config validation)\n * - New node type validations (answer, question_classifier, parameter_extractor, etc.)\n */\nexport function validateWorkflowGraph(graph: WorkflowGraph): ValidationResult {\n  const errors: string[] = []\n  const nodeMap = new Map<string, WorkflowNode>()\n\n  for (const node of graph.nodes) {\n    nodeMap.set(node.id, node)\n  }\n\n  // 1. At least one agent node\n  const agentNodes = graph.nodes.filter((node) => node.type === 'agent')\n  if (agentNodes.length === 0) {\n    errors.push('At least one agent node is required')\n  }\n\n  // 2. All edges reference valid nodes\n  for (const edge of graph.edges) {\n    if (!nodeMap.has(edge.source)) {\n      errors.push(`Edge \"${edge.id}\" references non-existent source node \"${edge.source}\"`)\n    }\n    if (!nodeMap.has(edge.target)) {\n      errors.push(`Edge \"${edge.id}\" references non-existent target node \"${edge.target}\"`)\n    }\n  }\n\n  // 3. No orphan nodes (every node should have at least one connection, except note nodes)\n  const connectedNodeIds = new Set<string>()\n  for (const edge of graph.edges) {\n    connectedNodeIds.add(edge.source)\n    connectedNodeIds.add(edge.target)\n  }\n\n  for (const node of graph.nodes) {\n    // Note nodes are annotations and not part of execution — skip orphan check\n    if (node.type === 'note') continue\n    if (!connectedNodeIds.has(node.id)) {\n      errors.push(`Node \"${node.data.label}\" (${node.type}) is not connected to any other node`)\n    }\n  }\n\n  // 4. Tool -> Agent only\n  for (const edge of graph.edges) {\n    const sourceNode = nodeMap.get(edge.source)\n    const targetNode = nodeMap.get(edge.target)\n    if (!sourceNode || !targetNode) continue\n\n    if (sourceNode.type === 'tool' && targetNode.type !== 'agent') {\n      errors.push(`Tool \"${sourceNode.data.label}\" can only connect to agent nodes, not ${targetNode.type} nodes`)\n    }\n  }\n\n  // 5. Rule nodes should have incoming edges from agents\n  const ruleNodes = graph.nodes.filter((node) => node.type === 'rule')\n  for (const ruleNode of ruleNodes) {\n    const incomingEdges = graph.edges.filter((edge) => edge.target === ruleNode.id)\n    const hasAgentSource = incomingEdges.some((edge) => {\n      const sourceNode = nodeMap.get(edge.source)\n      return sourceNode?.type === 'agent'\n    })\n    if (incomingEdges.length === 0 || !hasAgentSource) {\n      errors.push(`Rule \"${ruleNode.data.label}\" must have an incoming connection from an agent`)\n    }\n  }\n\n  // 6. No cycles (topological sort of agent nodes)\n  if (agentNodes.length > 1) {\n    const cycleError = detectCycle(agentNodes, graph.edges, nodeMap)\n    if (cycleError) {\n      errors.push(cycleError)\n    }\n  }\n\n  // 7. At most 1 start node\n  const startNodes = graph.nodes.filter((node) => node.type === 'start')\n  if (startNodes.length > 1) {\n    errors.push('Only one Start node is allowed')\n  }\n\n  // 8. At most 1 end node\n  const endNodes = graph.nodes.filter((node) => node.type === 'end')\n  if (endNodes.length > 1) {\n    errors.push('Only one End node is allowed')\n  }\n\n  // 9. Start node has no incoming edges\n  for (const startNode of startNodes) {\n    const incomingEdges = graph.edges.filter((edge) => edge.target === startNode.id)\n    if (incomingEdges.length > 0) {\n      errors.push('Start node cannot have incoming connections')\n    }\n  }\n\n  // 10. End node has no outgoing edges\n  for (const endNode of endNodes) {\n    const outgoingEdges = graph.edges.filter((edge) => edge.source === endNode.id)\n    if (outgoingEdges.length > 0) {\n      errors.push('End node cannot have outgoing connections')\n    }\n  }\n\n  // 11. IF/ELSE has at least 1 condition\n  const ifElseNodes = graph.nodes.filter((node) => node.type === 'if_else')\n  for (const ifElseNode of ifElseNodes) {\n    const config = ifElseNode.data.config as IfElseNodeConfig | undefined\n    if (!config || config.conditions.length === 0) {\n      errors.push('IF/ELSE node must have at least one condition')\n    }\n  }\n\n  // 12. Code node has non-empty code\n  const codeNodes = graph.nodes.filter((node) => node.type === 'code')\n  for (const codeNode of codeNodes) {\n    const config = codeNode.data.config as CodeNodeConfig | undefined\n    if (!config || !config.code.trim()) {\n      errors.push('Code node must have code content')\n    }\n  }\n\n  // 13. HTTP Request has valid URL\n  const httpNodes = graph.nodes.filter((node) => node.type === 'http_request')\n  for (const httpNode of httpNodes) {\n    const config = httpNode.data.config as HttpRequestNodeConfig | undefined\n    if (!config || !config.url.trim()) {\n      errors.push('HTTP Request node must have a URL')\n    }\n  }\n\n  // 14. Template has non-empty template\n  const templateNodes = graph.nodes.filter((node) => node.type === 'template_transform')\n  for (const templateNode of templateNodes) {\n    const config = templateNode.data.config as TemplateTransformNodeConfig | undefined\n    if (!config || !config.template.trim()) {\n      errors.push('Template node must have template content')\n    }\n  }\n\n  // 15. Knowledge Base has source ID\n  const knowledgeBaseNodes = graph.nodes.filter((node) => node.type === 'knowledge_base')\n  for (const knowledgeBaseNode of knowledgeBaseNodes) {\n    const config = knowledgeBaseNode.data.config as KnowledgeBaseNodeConfig | undefined\n    if (!config || !config.sourceId.trim()) {\n      errors.push('Knowledge Base node must have a source configured')\n    }\n  }\n\n  // 16. Iteration has outgoing edge\n  const iterationNodes = graph.nodes.filter((node) => node.type === 'iteration')\n  for (const iterationNode of iterationNodes) {\n    const outgoingEdges = graph.edges.filter((edge) => edge.source === iterationNode.id)\n    if (outgoingEdges.length === 0) {\n      errors.push('Iteration node must have at least one outgoing connection')\n    }\n  }\n\n  // ============================================================================\n  // New node type validations (9 new node types)\n  // ============================================================================\n\n  // 17. Answer node: outputTemplate must be non-empty\n  const answerNodes = graph.nodes.filter((node) => node.type === 'answer')\n  for (const answerNode of answerNodes) {\n    const config = answerNode.data.config as AnswerNodeConfig | undefined\n    if (!config || !config.outputTemplate.trim()) {\n      errors.push('Answer node must have a non-empty output template')\n    }\n  }\n\n  // 18. Question Classifier: must have >= 2 categories with non-empty names\n  const questionClassifierNodes = graph.nodes.filter((node) => node.type === 'question_classifier')\n  for (const questionClassifierNode of questionClassifierNodes) {\n    const config = questionClassifierNode.data.config as QuestionClassifierNodeConfig | undefined\n    if (!config || config.categories.length < 2) {\n      errors.push('Question Classifier node must have at least 2 categories')\n    } else {\n      const emptyCategories = config.categories.filter((category) => !category.name.trim())\n      if (emptyCategories.length > 0) {\n        errors.push('Question Classifier node has categories with empty names')\n      }\n    }\n  }\n\n  // 19. Parameter Extractor: must have >= 1 parameter with non-empty name\n  const parameterExtractorNodes = graph.nodes.filter((node) => node.type === 'parameter_extractor')\n  for (const parameterExtractorNode of parameterExtractorNodes) {\n    const config = parameterExtractorNode.data.config as ParameterExtractorNodeConfig | undefined\n    if (!config || config.parameters.length === 0) {\n      errors.push('Parameter Extractor node must have at least 1 parameter')\n    } else {\n      const emptyParameters = config.parameters.filter((parameter) => !parameter.name.trim())\n      if (emptyParameters.length > 0) {\n        errors.push('Parameter Extractor node has parameters with empty names')\n      }\n    }\n  }\n\n  // 20. Variable Assigner: must have >= 1 assignment\n  const variableAssignerNodes = graph.nodes.filter((node) => node.type === 'variable_assigner')\n  for (const variableAssignerNode of variableAssignerNodes) {\n    const config = variableAssignerNode.data.config as VariableAssignerNodeConfig | undefined\n    if (!config || config.assignments.length === 0) {\n      errors.push('Variable Assigner node must have at least 1 assignment')\n    }\n  }\n\n  // 21. Variable Aggregator: must have >= 1 inputVariable and non-empty outputVariable\n  const variableAggregatorNodes = graph.nodes.filter((node) => node.type === 'variable_aggregator')\n  for (const variableAggregatorNode of variableAggregatorNodes) {\n    const config = variableAggregatorNode.data.config as VariableAggregatorNodeConfig | undefined\n    if (!config || config.inputVariables.length === 0) {\n      errors.push('Variable Aggregator node must have at least 1 input variable')\n    }\n    if (!config || !config.outputVariable.trim()) {\n      errors.push('Variable Aggregator node must have a non-empty output variable')\n    }\n  }\n\n  // 22. Document Extractor: outputVariable must be non-empty\n  const documentExtractorNodes = graph.nodes.filter((node) => node.type === 'document_extractor')\n  for (const documentExtractorNode of documentExtractorNodes) {\n    const config = documentExtractorNode.data.config as DocumentExtractorNodeConfig | undefined\n    if (!config || !config.outputVariable.trim()) {\n      errors.push('Document Extractor node must have a non-empty output variable')\n    }\n  }\n\n  // 23. List Operator: inputVariable and outputVariable must be non-empty\n  const listOperatorNodes = graph.nodes.filter((node) => node.type === 'list_operator')\n  for (const listOperatorNode of listOperatorNodes) {\n    const config = listOperatorNode.data.config as ListOperatorNodeConfig | undefined\n    if (!config || !config.inputVariable.trim()) {\n      errors.push('List Operator node must have a non-empty input variable')\n    }\n    if (!config || !config.outputVariable.trim()) {\n      errors.push('List Operator node must have a non-empty output variable')\n    }\n  }\n\n  // 24. Iteration Start: must follow an Iteration node (incoming edge source must be iteration type)\n  const iterationStartNodes = graph.nodes.filter((node) => node.type === 'iteration_start')\n  for (const iterationStartNode of iterationStartNodes) {\n    const incomingEdges = graph.edges.filter((edge) => edge.target === iterationStartNode.id)\n    const hasIterationSource = incomingEdges.some((edge) => {\n      const sourceNode = nodeMap.get(edge.source)\n      return sourceNode?.type === 'iteration'\n    })\n    if (incomingEdges.length === 0 || !hasIterationSource) {\n      errors.push('Iteration Start node must have an incoming connection from an Iteration node')\n    }\n  }\n\n  // Note: Note nodes skip validation — they are annotations, not part of execution.\n\n  return {\n    valid: errors.length === 0,\n    errors,\n  }\n}\n\n/**\n * Detect cycles in the agent subgraph using DFS.\n */\nfunction detectCycle(\n  agentNodes: WorkflowNode[],\n  edges: WorkflowEdge[],\n  nodeMap: Map<string, WorkflowNode>\n): string | null {\n  const agentIds = new Set(agentNodes.map((node) => node.id))\n  const adjacencyList = new Map<string, string[]>()\n\n  for (const agentId of agentIds) {\n    adjacencyList.set(agentId, [])\n  }\n\n  for (const edge of edges) {\n    const sourceNode = nodeMap.get(edge.source)\n    const targetNode = nodeMap.get(edge.target)\n    if (\n      sourceNode?.type === 'agent' &&\n      targetNode?.type === 'agent' &&\n      agentIds.has(edge.source) &&\n      agentIds.has(edge.target)\n    ) {\n      adjacencyList.get(edge.source)!.push(edge.target)\n    }\n  }\n\n  const visited = new Set<string>()\n  const inStack = new Set<string>()\n\n  function hasCycleDfs(nodeId: string): boolean {\n    visited.add(nodeId)\n    inStack.add(nodeId)\n\n    const neighbors = adjacencyList.get(nodeId) ?? []\n    for (const neighbor of neighbors) {\n      if (!visited.has(neighbor)) {\n        if (hasCycleDfs(neighbor)) return true\n      } else if (inStack.has(neighbor)) {\n        return true\n      }\n    }\n\n    inStack.delete(nodeId)\n    return false\n  }\n\n  for (const agentId of agentIds) {\n    if (!visited.has(agentId)) {\n      if (hasCycleDfs(agentId)) {\n        return 'Cycle detected in agent pipeline — agents must form a directed acyclic graph (DAG)'\n      }\n    }\n  }\n\n  return null\n}\n\n/**\n * Topologically sort agent nodes from the graph edges.\n * Returns agent entityIds in execution order.\n * Logic nodes are skipped — only agent entityIds are returned.\n */\nexport function topologicalSortAgents(graph: WorkflowGraph): string[] {\n  const agentNodes = graph.nodes.filter((node) => node.type === 'agent')\n  const agentIdSet = new Set(agentNodes.map((node) => node.id))\n\n  // Build adjacency list for agent-to-agent edges\n  const inDegree = new Map<string, number>()\n  const adjacencyList = new Map<string, string[]>()\n\n  for (const node of agentNodes) {\n    inDegree.set(node.id, 0)\n    adjacencyList.set(node.id, [])\n  }\n\n  for (const edge of graph.edges) {\n    if (agentIdSet.has(edge.source) && agentIdSet.has(edge.target)) {\n      adjacencyList.get(edge.source)!.push(edge.target)\n      inDegree.set(edge.target, (inDegree.get(edge.target) ?? 0) + 1)\n    }\n  }\n\n  // Kahn's algorithm\n  const queue: string[] = []\n  for (const [nodeId, degree] of inDegree) {\n    if (degree === 0) queue.push(nodeId)\n  }\n\n  const sorted: string[] = []\n  while (queue.length > 0) {\n    const current = queue.shift()!\n    sorted.push(current)\n\n    for (const neighbor of adjacencyList.get(current) ?? []) {\n      const newDegree = (inDegree.get(neighbor) ?? 1) - 1\n      inDegree.set(neighbor, newDegree)\n      if (newDegree === 0) queue.push(neighbor)\n    }\n  }\n\n  // Map node IDs back to entityIds\n  const nodeIdToEntityId = new Map<string, string>()\n  for (const node of agentNodes) {\n    nodeIdToEntityId.set(node.id, node.data.entityId)\n  }\n\n  return sorted.map((nodeId) => nodeIdToEntityId.get(nodeId) ?? nodeId)\n}\n"]}

package/dist/{chunk-MGR7H5X2.mjs → chunk-6KYBGBI4.mjs}

@@ -158,6 +158,21 @@ function applyDagreLayout(nodes, edges, direction) {
   });
 }
 
-export { applyDagreLayout, createDefaultLogicNodeConfig };
-//# sourceMappingURL=chunk-MGR7H5X2.mjs.map
-//# sourceMappingURL=chunk-MGR7H5X2.mjs.map
+// src/workflow/utils/agent-tier.ts
+var TIERS = [
+  { maxElo: 1200, tier: { key: "beginner", pillColor: "bg-cyan-100 text-cyan-700 dark:bg-cyan-900/30 dark:text-cyan-400" } },
+  { maxElo: 1600, tier: { key: "intermediate", pillColor: "bg-pink-100 text-pink-700 dark:bg-pink-900/30 dark:text-pink-400" } },
+  { maxElo: 2e3, tier: { key: "advanced", pillColor: "bg-amber-100 text-amber-700 dark:bg-amber-900/30 dark:text-amber-400" } },
+  { maxElo: Infinity, tier: { key: "expert", pillColor: "bg-emerald-100 text-emerald-700 dark:bg-emerald-900/30 dark:text-emerald-400" } }
+];
+function getAgentTier(elo) {
+  const eloValue = elo ?? 0;
+  for (const { maxElo, tier } of TIERS) {
+    if (eloValue < maxElo) return tier;
+  }
+  return TIERS[TIERS.length - 1].tier;
+}
+
+export { applyDagreLayout, createDefaultLogicNodeConfig, getAgentTier };
+//# sourceMappingURL=chunk-6KYBGBI4.mjs.map
+//# sourceMappingURL=chunk-6KYBGBI4.mjs.map

package/dist/chunk-6KYBGBI4.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/workflow/utils/logic-node-defaults.ts","../src/workflow/utils/layout-engine.ts","../src/workflow/utils/agent-tier.ts"],"names":[],"mappings":";;;AAQO,SAAS,6BAA6B,QAAA,EAAoD;AAC/F,EAAA,QAAQ,QAAA;AAAU,IAChB,KAAK,OAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,cAAA,EAAgB,EAAC,EAAE;AAAA,IAC7C,KAAK,KAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,eAAA,EAAiB,EAAC,EAAE;AAAA,IAC5C,KAAK,SAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,SAAA;AAAA,QACN,UAAA,EAAY,CAAC,EAAE,QAAA,EAAU,IAAI,QAAA,EAAU,QAAA,EAAU,KAAA,EAAO,EAAA,EAAI,CAAA;AAAA,QAC5D,eAAA,EAAiB;AAAA,OACnB;AAAA,IACF,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,QAAA,EAAU,YAAA,EAAc,MAAM,EAAA,EAAG;AAAA,IAC1D,KAAK,cAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,cAAA;AAAA,QACN,MAAA,EAAQ,KAAA;AAAA,QACR,GAAA,EAAK,EAAA;AAAA,QACL,SAAS,EAAC;AAAA,QACV,IAAA,EAAM,EAAA;AAAA,QACN,SAAA,EAAW;AAAA,OACb;AAAA,IACF,KAAK,oBAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,oBAAA,EAAsB,QAAA,EAAU,EAAA,EAAI,gBAAgB,EAAA,EAAG;AAAA,IACxE,KAAK,WAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,WAAA,EAAa,gBAAA,EAAkB,EAAA,EAAI,eAAe,GAAA,EAAI;AAAA,IACvE,KAAK,gBAAA;AACH,MAAA,OAAO,EAAE,MAAM,gBAAA,EAAkB,QAAA,EAAU,IAAI,IAAA,EAAM,CAAA,EAAG,qBAAqB,GAAA,EAAI;AAAA,IACnF,KAAK,QAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,QAAA,EAAU,gBAAgB,EAAA,EAAI,eAAA,EAAiB,EAAC,EAAE;AAAA,IACnE,KAAK,qBAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,qBAAA;AAAA,QACN,OAAA,EAAS,EAAA;AAAA,QACT,YAAA,EAAc,EAAA;AAAA,QACd,UAAA,EAAY;AAAA,UACV,EAAE,IAAI,MAAA,CAAO,UAAA,IAAc,IAAA,EAAM,EAAA,EAAI,aAAa,EAAA,EAAG;AAAA,UACrD,EAAE,IAAI,MAAA,CAAO,UAAA,IAAc,IAAA,EAAM,EAAA,EAAI,aAAa,EAAA;AAAG;AACvD,OACF;AAAA,IACF,KAAK,qBAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,qBAAA;AAAA,QACN,OAAA,EAAS,EAAA;AAAA,QACT,UAAA,EAAY,CAAC,EAAE,IAAA,EAAM,EAAA,EAAI,IAAA,EAAM,QAAA,EAAU,WAAA,EAAa,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM;AAAA,OAC5E;AAAA,IACF,KAAK,mBAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,mBAAA;AAAA,QACN,aAAa,CAAC,EAAE,QAAQ,EAAA,EAAI,MAAA,EAAQ,IAAI;AAAA,OAC1C;AAAA,IACF,KAAK,qBAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,qBAAA;AAAA,QACN,gBAAgB,EAAC;AAAA,QACjB,cAAA,EAAgB,EAAA;AAAA,QAChB,eAAA,EAAiB;AAAA,OACnB;AAAA,IACF,KAAK,oBAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,oBAAA;AAAA,QACN,cAAA,EAAgB,MAAA;AAAA,QAChB,cAAA,EAAgB;AAAA,OAClB;AAAA,IACF,KAAK,eAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,eAAA;AAAA,QACN,SAAA,EAAW,QAAA;AAAA,QACX,aAAA,EAAe,EAAA;AAAA,QACf,cAAA,EAAgB,EAAA;AAAA,QAChB,SAAA,EAAW;AAAA,OACb;AAAA,IACF,KAAK,iBAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,iBAAA;AAAA,QACN,gBAAA,EAAkB,EAAA;AAAA,QAClB,YAAA,EAAc,MAAA;AAAA,QACd,aAAA,EAAe;AAAA,OACjB;AAAA,IACF,KAAK,MAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,MAAA;AAAA,QACN,IAAA,EAAM,EAAA;AAAA,QACN,KAAA,EAAO,QAAA;AAAA,QACP,KAAA,EAAO,GAAA;AAAA,QACP,MAAA,EAAQ;AAAA,OACV;AAAA,IACF,KAAK,OAAA;AACH,MAAA,OAAO;AAAA,QACL,IAAA,EAAM,OAAA;AAAA,QACN,KAAA,EAAO,OAAA;AAAA,QACP,KAAA,EAAO,OAAA;AAAA,QACP,UAAA,EAAY,IAAA;AAAA,QACZ,KAAA,EAAO,GAAA;AAAA,QACP,MAAA,EAAQ,GAAA;AAAA,QACR,cAAA,EAAgB,GAAA;AAAA,QAChB,eAAA,EAAiB;AAAA,OACnB;AAAA,IACF;AACE,MAAA,OAAO,IAAA;AAAA;AAEb;ACjGA,IAAM,kBAAA,GAAqB,GAAA;AAC3B,IAAM,mBAAA,GAAsB,EAAA;AAE5B,SAAS,YAAY,IAAA,EAA+C;AAClE,EAAA,MAAM,WAAW,IAAA,CAAK,QAAA;AACtB,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,UAAU,KAAA,IAAS,kBAAA;AAAA,IAC1B,MAAA,EAAQ,UAAU,MAAA,IAAU;AAAA,GAC9B;AACF;AAOO,SAAS,gBAAA,CACd,KAAA,EACA,KAAA,EACA,SAAA,EACQ;AACR,EAAA,MAAM,qBAAA,GAAwB,EAAA;AAC9B,EAAA,MAAM,mBAAA,GAAsB,EAAA;AAG5B,EAAA,MAAM,cAAc,KAAA,CAAM,MAAA;AAAA,IACxB,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,QAAA,IAAY,KAAK,IAAA,KAAS;AAAA,GAC5C;AAGA,EAAA,MAAM,UAAA,GAAa,IAAI,KAAA,CAAM,QAAA,CAAS,MAAM,EAAE,QAAA,EAAU,MAAM,CAAA;AAC9D,EAAA,UAAA,CAAW,mBAAA,CAAoB,OAAO,EAAC,CAAE,CAAA;AAEzC,EAAA,MAAM,eAAe,SAAA,KAAc,IAAA;AACnC,EAAA,UAAA,CAAW,QAAA,CAAS;AAAA,IAClB,OAAA,EAAS,SAAA;AAAA,IACT,OAAA,EAAS,eAAe,mBAAA,GAAsB,qBAAA;AAAA,IAC9C,OAAA,EAAS,eAAe,qBAAA,GAAwB,mBAAA;AAAA,IAChD,OAAA,EAAS,EAAA;AAAA,IACT,OAAA,EAAS;AAAA,GACV,CAAA;AAED,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,WAAA,CAAY,IAAI,CAAC,IAAA,KAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAEhE,EAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC9B,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,YAAY,IAAI,CAAA;AAC1C,IAAA,UAAA,CAAW,QAAQ,IAAA,CAAK,EAAA,EAAI,EAAE,KAAA,EAAO,QAAQ,CAAA;AAAA,EAC/C;AAEA,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,aAAA,CAAc,IAAI,IAAA,CAAK,MAAM,KAAK,aAAA,CAAc,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AACpE,MAAA,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,MAAA,EAAQ,IAAA,CAAK,MAAM,CAAA;AAAA,IAC7C;AAAA,EACF;AAEA,EAAA,KAAA,CAAM,OAAO,UAAU,CAAA;AAGvB,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAsC;AAC9D,EAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC9B,IAAA,MAAM,SAAA,GAAY,UAAA,CAAW,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA;AACzC,IAAA,IAAI,CAAC,SAAA,EAAW;AAChB,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,YAAY,IAAI,CAAA;AAC1C,IAAA,WAAA,CAAY,GAAA,CAAI,KAAK,EAAA,EAAI;AAAA,MACvB,CAAA,EAAG,SAAA,CAAU,CAAA,GAAI,KAAA,GAAQ,CAAA;AAAA,MACzB,CAAA,EAAG,SAAA,CAAU,CAAA,GAAI,MAAA,GAAS;AAAA,KAC3B,CAAA;AAAA,EACH;AAGA,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,MAAM,WAAA,GAAc,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC3C,IAAA,IAAI,CAAC,aAAa,OAAO,IAAA;AACzB,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,WAAA,EAAY;AAAA,EAC1C,CAAC,CAAA;AACH;;;AC5EA,IAAM,KAAA,GAAoD;AAAA,EACxD,EAAE,QAAQ,IAAA,EAAM,IAAA,EAAM,EAAE,GAAA,EAAK,UAAA,EAAY,SAAA,EAAW,kEAAA,EAAmE,EAAE;AAAA,EACzH,EAAE,QAAQ,IAAA,EAAM,IAAA,EAAM,EAAE,GAAA,EAAK,cAAA,EAAgB,SAAA,EAAW,kEAAA,EAAmE,EAAE;AAAA,EAC7H,EAAE,QAAQ,GAAA,EAAM,IAAA,EAAM,EAAE,GAAA,EAAK,UAAA,EAAY,SAAA,EAAW,sEAAA,EAAuE,EAAE;AAAA,EAC7H,EAAE,QAAQ,QAAA,EAAU,IAAA,EAAM,EAAE,GAAA,EAAK,QAAA,EAAU,SAAA,EAAW,8EAAA,EAA+E;AACvI,CAAA;AAEO,SAAS,aAAa,GAAA,EAAoC;AAC/D,EAAA,MAAM,WAAW,GAAA,IAAO,CAAA;AACxB,EAAA,KAAA,MAAW,EAAE,MAAA,EAAQ,IAAA,EAAK,IAAK,KAAA,EAAO;AACpC,IAAA,IAAI,QAAA,GAAW,QAAQ,OAAO,IAAA;AAAA,EAChC;AACA,EAAA,OAAO,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA,CAAE,IAAA;AACjC","file":"chunk-6KYBGBI4.mjs","sourcesContent":["/**\n * Logic Node Default Configs\n * ==========================\n * Factory function to create default configs for each logic node type.\n */\n\nimport type { WorkflowNodeType, LogicNodeConfig } from '../contracts'\n\nexport function createDefaultLogicNodeConfig(nodeType: WorkflowNodeType): LogicNodeConfig | null {\n  switch (nodeType) {\n    case 'start':\n      return { type: 'start', inputVariables: [] }\n    case 'end':\n      return { type: 'end', outputVariables: [] }\n    case 'if_else':\n      return {\n        type: 'if_else',\n        conditions: [{ variable: '', operator: 'equals', value: '' }],\n        logicalOperator: 'and',\n      }\n    case 'code':\n      return { type: 'code', language: 'javascript', code: '' }\n    case 'http_request':\n      return {\n        type: 'http_request',\n        method: 'GET',\n        url: '',\n        headers: {},\n        body: '',\n        timeoutMs: 10000,\n      }\n    case 'template_transform':\n      return { type: 'template_transform', template: '', outputVariable: '' }\n    case 'iteration':\n      return { type: 'iteration', iteratorVariable: '', maxIterations: 100 }\n    case 'knowledge_base':\n      return { type: 'knowledge_base', sourceId: '', topK: 5, similarityThreshold: 0.7 }\n    case 'answer':\n      return { type: 'answer', outputTemplate: '', outputVariables: [] }\n    case 'question_classifier':\n      return {\n        type: 'question_classifier',\n        modelId: '',\n        instructions: '',\n        categories: [\n          { id: crypto.randomUUID(), name: '', description: '' },\n          { id: crypto.randomUUID(), name: '', description: '' },\n        ],\n      }\n    case 'parameter_extractor':\n      return {\n        type: 'parameter_extractor',\n        modelId: '',\n        parameters: [{ name: '', type: 'string', description: '', required: true }],\n      }\n    case 'variable_assigner':\n      return {\n        type: 'variable_assigner',\n        assignments: [{ target: '', source: '' }],\n      }\n    case 'variable_aggregator':\n      return {\n        type: 'variable_aggregator',\n        inputVariables: [],\n        outputVariable: '',\n        aggregationMode: 'array',\n      }\n    case 'document_extractor':\n      return {\n        type: 'document_extractor',\n        extractionMode: 'text',\n        outputVariable: '',\n      }\n    case 'list_operator':\n      return {\n        type: 'list_operator',\n        operation: 'filter',\n        inputVariable: '',\n        outputVariable: '',\n        condition: '',\n      }\n    case 'iteration_start':\n      return {\n        type: 'iteration_start',\n        iteratorVariable: '',\n        itemVariable: 'item',\n        indexVariable: 'index',\n      }\n    case 'note':\n      return {\n        type: 'note',\n        text: '',\n        color: 'yellow',\n        width: 200,\n        height: 150,\n      }\n    case 'group':\n      return {\n        type: 'group',\n        label: 'Group',\n        color: 'slate',\n        isExpanded: true,\n        width: 400,\n        height: 300,\n        collapsedWidth: 260,\n        collapsedHeight: 60,\n      }\n    default:\n      return null\n  }\n}\n","/**\n * Layout Engine\n * =============\n * Auto-layout for workflow graphs using @dagrejs/dagre.\n * Pure utility — no React dependencies.\n */\n\nimport Dagre from '@dagrejs/dagre'\nimport type { Node, Edge } from '@xyflow/react'\n\n/** Layout direction: free means no auto-layout is applied. */\nexport type LayoutDirection = 'free' | 'LR' | 'TB'\n\nconst DEFAULT_NODE_WIDTH = 260\nconst DEFAULT_NODE_HEIGHT = 70\n\nfunction getNodeSize(node: Node): { width: number; height: number } {\n  const measured = node.measured as { width?: number; height?: number } | undefined\n  return {\n    width: measured?.width ?? DEFAULT_NODE_WIDTH,\n    height: measured?.height ?? DEFAULT_NODE_HEIGHT,\n  }\n}\n\n/**\n * Apply dagre layout to the given nodes and edges.\n * Returns a new array of nodes with updated positions.\n * Group child nodes (parentId set) and note nodes are excluded from layout.\n */\nexport function applyDagreLayout(\n  nodes: Node[],\n  edges: Edge[],\n  direction: Exclude<LayoutDirection, 'free'>,\n): Node[] {\n  const nodeSpacingHorizontal = 80\n  const nodeSpacingVertical = 50\n\n  // Separate layoutable nodes from excluded ones\n  const layoutNodes = nodes.filter(\n    (node) => !node.parentId && node.type !== 'note',\n  )\n\n  // Build dagre graph\n  const dagreGraph = new Dagre.graphlib.Graph({ directed: true })\n  dagreGraph.setDefaultEdgeLabel(() => ({}))\n\n  const isHorizontal = direction === 'LR'\n  dagreGraph.setGraph({\n    rankdir: direction,\n    nodesep: isHorizontal ? nodeSpacingVertical : nodeSpacingHorizontal,\n    ranksep: isHorizontal ? nodeSpacingHorizontal : nodeSpacingVertical,\n    marginx: 40,\n    marginy: 40,\n  })\n\n  const layoutNodeIds = new Set(layoutNodes.map((node) => node.id))\n\n  for (const node of layoutNodes) {\n    const { width, height } = getNodeSize(node)\n    dagreGraph.setNode(node.id, { width, height })\n  }\n\n  for (const edge of edges) {\n    if (layoutNodeIds.has(edge.source) && layoutNodeIds.has(edge.target)) {\n      dagreGraph.setEdge(edge.source, edge.target)\n    }\n  }\n\n  Dagre.layout(dagreGraph)\n\n  // Build position map — dagre returns center coords, React Flow uses top-left\n  const positionMap = new Map<string, { x: number; y: number }>()\n  for (const node of layoutNodes) {\n    const dagreNode = dagreGraph.node(node.id)\n    if (!dagreNode) continue\n    const { width, height } = getNodeSize(node)\n    positionMap.set(node.id, {\n      x: dagreNode.x - width / 2,\n      y: dagreNode.y - height / 2,\n    })\n  }\n\n  // Return all nodes with updated positions for layout-participating nodes\n  return nodes.map((node) => {\n    const newPosition = positionMap.get(node.id)\n    if (!newPosition) return node\n    return { ...node, position: newPosition }\n  })\n}\n","/**\n * Agent ELO Tier\n * ==============\n * Derives difficulty tier from agent ELO rating.\n * Used in node palette, agent flow node, and agent drawer.\n */\n\nexport type AgentTier = {\n  key: 'beginner' | 'intermediate' | 'advanced' | 'expert'\n  pillColor: string\n}\n\nconst TIERS: Array<{ maxElo: number; tier: AgentTier }> = [\n  { maxElo: 1200, tier: { key: 'beginner', pillColor: 'bg-cyan-100 text-cyan-700 dark:bg-cyan-900/30 dark:text-cyan-400' } },\n  { maxElo: 1600, tier: { key: 'intermediate', pillColor: 'bg-pink-100 text-pink-700 dark:bg-pink-900/30 dark:text-pink-400' } },\n  { maxElo: 2000, tier: { key: 'advanced', pillColor: 'bg-amber-100 text-amber-700 dark:bg-amber-900/30 dark:text-amber-400' } },\n  { maxElo: Infinity, tier: { key: 'expert', pillColor: 'bg-emerald-100 text-emerald-700 dark:bg-emerald-900/30 dark:text-emerald-400' } },\n]\n\nexport function getAgentTier(elo: number | undefined): AgentTier {\n  const eloValue = elo ?? 0\n  for (const { maxElo, tier } of TIERS) {\n    if (eloValue < maxElo) return tier\n  }\n  return TIERS[TIERS.length - 1].tier\n}\n"]}

package/dist/{chunk-UZHWA7CM.js → chunk-DOO5ICHD.js}

@@ -3,7 +3,7 @@
 
 var chunkYRY7HFKG_js = require('./chunk-YRY7HFKG.js');
 var chunkNJ6PBGQM_js = require('./chunk-NJ6PBGQM.js');
-var chunkFAAXHLWI_js = require('./chunk-FAAXHLWI.js');
+var chunkF4FMGGHO_js = require('./chunk-F4FMGGHO.js');
 var react = require('react');
 var nextIntl = require('next-intl');
 var dynamic = require('next/dynamic.js');
@@ -1366,6 +1366,10 @@ var AgentFlowNode = react.memo(function AgentFlowNode2({ id, data, selected }) {
       ] }),
       /* @__PURE__ */ jsxRuntime.jsx(NodeCardMeta, { compact: isCompact, children: /* @__PURE__ */ jsxRuntime.jsxs("div", { className: "flex flex-wrap items-center gap-1.5", children: [
         /* @__PURE__ */ jsxRuntime.jsx(NodeCardBadge, { className: "rounded-full bg-indigo-100 px-2 py-0.5 text-[10px] font-semibold text-indigo-700 dark:bg-indigo-500/20 dark:text-indigo-300", children: "Agent" }),
+        (() => {
+          const tier = chunkF4FMGGHO_js.getAgentTier(Number(data.agent.elo ?? 0));
+          return /* @__PURE__ */ jsxRuntime.jsx(NodeCardBadge, { className: `rounded-full px-2 py-0.5 text-[10px] font-bold ${tier.pillColor}`, children: tier.key });
+        })(),
         /* @__PURE__ */ jsxRuntime.jsxs(NodeCardBadge, { className: `inline-flex items-center gap-1 rounded-full px-2 py-0.5 text-[10px] font-medium ${frameworkMeta.badgeColor}`, children: [
           /* @__PURE__ */ jsxRuntime.jsx(frameworkMeta.IconComponent, { className: "h-3 w-3" }),
           frameworkMeta.label
@@ -5026,6 +5030,7 @@ function WorkflowCanvasInner({
   agents,
   models,
   tools,
+  agentTools = [],
   rules,
   entities = [],
   initialGraph,
@@ -5119,6 +5124,13 @@ function WorkflowCanvasInner({
     }
     return map;
   }, [allTools]);
+  const agentToolMap = react.useMemo(() => {
+    const map = /* @__PURE__ */ new Map();
+    for (const at of agentTools) {
+      map.set(at.agentToolId, at);
+    }
+    return map;
+  }, [agentTools]);
   const ruleMap = react.useMemo(() => {
     const map = /* @__PURE__ */ new Map();
     for (const rule of allRules) {
@@ -5299,7 +5311,7 @@ function WorkflowCanvasInner({
           };
         }
         if (isLogicNodeType(savedNode.type)) {
-          const config = savedNode.data.config ?? chunkFAAXHLWI_js.createDefaultLogicNodeConfig(savedNode.type);
+          const config = savedNode.data.config ?? chunkF4FMGGHO_js.createDefaultLogicNodeConfig(savedNode.type);
           if (config) {
             const baseNode = {
               id: savedNode.id,
@@ -5468,7 +5480,7 @@ function WorkflowCanvasInner({
       }
       storeTakeSnapshot();
       const isTB = direction === "TB";
-      const repositionedNodes = chunkFAAXHLWI_js.applyDagreLayout(nodes, edges, direction).map((node) => ({
+      const repositionedNodes = chunkF4FMGGHO_js.applyDagreLayout(nodes, edges, direction).map((node) => ({
         ...node,
         sourcePosition: isTB ? react$1.Position.Bottom : react$1.Position.Right,
         targetPosition: isTB ? react$1.Position.Top : react$1.Position.Left
@@ -5597,7 +5609,7 @@ function WorkflowCanvasInner({
   }, [storePaste]);
   const contextMenuAddNote = react.useCallback((flowPosition) => {
     storeTakeSnapshot();
-    const noteConfig = chunkFAAXHLWI_js.createDefaultLogicNodeConfig("note");
+    const noteConfig = chunkF4FMGGHO_js.createDefaultLogicNodeConfig("note");
     const noteNode = {
       id: crypto.randomUUID(),
       type: "note",
@@ -6052,6 +6064,20 @@ function WorkflowCanvasInner({
           }
         };
         setNodes((currentNodes) => [...currentNodes, newNode]);
+      } else if (nodeType === "agent_tool") {
+        const agentTool = agentToolMap.get(entityId);
+        if (!agentTool) return;
+        const newNode = {
+          id: newNodeId,
+          type: "agent_tool",
+          position,
+          data: {
+            agentTool,
+            order: 0,
+            onRemoveFromCanvas: handleRemoveNodeFromCanvas
+          }
+        };
+        setNodes((currentNodes) => [...currentNodes, newNode]);
       } else if (nodeType === "rule") {
         const rule = ruleMap.get(entityId);
         if (!rule) return;
@@ -6086,7 +6112,7 @@ function WorkflowCanvasInner({
         };
         setNodes((currentNodes) => [...currentNodes, newNode]);
       } else if (nodeType === "group") {
-        const groupConfig = configRaw ? JSON.parse(configRaw) : chunkFAAXHLWI_js.createDefaultLogicNodeConfig("group");
+        const groupConfig = configRaw ? JSON.parse(configRaw) : chunkF4FMGGHO_js.createDefaultLogicNodeConfig("group");
         if (!groupConfig) return;
         const newNode = {
           id: newNodeId,
@@ -6103,7 +6129,7 @@ function WorkflowCanvasInner({
         };
         setNodes((currentNodes) => [...currentNodes, newNode]);
       } else if (isLogicNodeType(nodeType)) {
-        const config = configRaw ? JSON.parse(configRaw) : chunkFAAXHLWI_js.createDefaultLogicNodeConfig(nodeType);
+        const config = configRaw ? JSON.parse(configRaw) : chunkF4FMGGHO_js.createDefaultLogicNodeConfig(nodeType);
         if (!config) return;
         const newNode = {
           id: newNodeId,
@@ -6220,7 +6246,7 @@ function WorkflowCanvasInner({
     (edgeId, nodeType, position) => {
       if (!isLogicNodeType(nodeType)) return;
       storeTakeSnapshot();
-      const config = chunkFAAXHLWI_js.createDefaultLogicNodeConfig(nodeType);
+      const config = chunkF4FMGGHO_js.createDefaultLogicNodeConfig(nodeType);
       if (!config) return;
       const newNodeId = crypto.randomUUID();
       const newNode = {
@@ -6710,5 +6736,5 @@ exports.useDrawerStore = useDrawerStore;
 exports.useWorkflowBuilderClient = useWorkflowBuilderClient;
 exports.useWorkflowBuilderClientOptional = useWorkflowBuilderClientOptional;
 exports.useWorkflowStore = useWorkflowStore;
-//# sourceMappingURL=chunk-UZHWA7CM.js.map
-//# sourceMappingURL=chunk-UZHWA7CM.js.map
+//# sourceMappingURL=chunk-DOO5ICHD.js.map
+//# sourceMappingURL=chunk-DOO5ICHD.js.map