@qodo/sdk 0.13.4 → 2.0.0-next.1

package/dist/client/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../../src/client/errors.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;;GAIG;AACH,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChD,0CAA0C;IAC1B,IAAI,GAAG,yBAAyB,CAAC;IACjD,yEAAyE;IACzD,GAAG,CAAS;IAC5B,sCAAsC;IACtB,MAAM,CAAS;IAE/B,YAAY,GAAW,EAAE,MAAc;QACrC,KAAK,CACH,GAAG,GAAG,4FAA4F,MAAM,0BAA0B,CACnI,CAAC;QACF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/B,IAAI,GAAG,wBAAwB,CAAC;IAChD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/B,IAAI,GAAG,wBAAwB,CAAC;IAChC,MAAM,CAAS;IACf,IAAI,CAAuC;IAE3D,YACE,IAA0C,EAC1C,MAAc,EACd,MAAgB;QAEhB,MAAM,SAAS,GACb,MAAM,KAAK,SAAS;YAClB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,MAAM,YAAY,KAAK;gBACvB,CAAC,CAAC,KAAK,MAAM,CAAC,OAAO,EAAE;gBACvB,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9B,MAAM,OAAO,GACX,IAAI,KAAK,aAAa;YACpB,CAAC,CAAC,gBAAgB,MAAM,wCAAwC;gBAC9D,mCAAmC,SAAS,wBAAwB;gBACpE,kDAAkD;YACpD,CAAC,CAAC,gBAAgB,MAAM,0CAA0C;gBAChE,2BAA2B,SAAS,6BAA6B;gBACjE,gEAAgE;gBAChE,4DAA4D,CAAC;QACnE,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7B,IAAI,GAAG,sBAAsB,CAAC;IAC9B,IAAI,CAAuB;IAC3B,SAAS,CAAS;IAElC,YAAY,IAA0B,EAAE,SAAiB;QACvD,uDAAuD;QACvD,8DAA8D;QAC9D,sEAAsE;QACtE,gEAAgE;QAChE,+BAA+B;QAC/B,MAAM,OAAO,GACX,IAAI,KAAK,MAAM;YACb,CAAC,CAAC,mDAAmD;YACrD,CAAC,CAAC,eAAe,CAAC;QACtB,KAAK,CACH,4BAA4B,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,cAAc,IAAI,SAAS,IAAI;YACtF,2EAA2E;YAC3E,mBAAmB,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,YAAY;YAChF,4EAA4E;YAC5E,0CAA0C,OAAO,GAAG,CACvD,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,iCAAkC,SAAQ,KAAK;IAC1C,IAAI,GAAG,mCAAmC,CAAC;IAC3C,MAAM,CAA4C;IAClD,UAAU,CAAS;IAEnC,YAAY,MAAiD,EAAE,UAAkB;QAC/E,MAAM,QAAQ,GAAkC;YAC9C,SAAS,EACP,gEAAgE;gBAChE,uEAAuE;YACzE,QAAQ,EACN,8DAA8D,UAAU,IAAI;gBAC5E,4EAA4E;YAC9E,YAAY,EACV,oEAAoE,UAAU,GAAG;gBACjF,yCAAyC;SAC5C,CAAC;QACF,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/B,IAAI,GAAG,wBAAwB,CAAC;IAChC,cAAc,CAAS;IAEvC,YAAY,cAAsB;QAChC,KAAK,CACH,qEAAqE;YACnE,mBAAmB,cAAc,yCAAyC;YAC1E,uEAAuE;YACvE,eAAe,CAClB,CAAC;QACF,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IAC3B,IAAI,GAAG,oBAAoB,CAAC;IAC5C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9B,IAAI,GAAG,uBAAuB,CAAC;IAC/C,+BAA+B;IACf,IAAI,GAAG,uBAAuB,CAAC;IAC/C,0EAA0E;IAC1D,SAAS,CAAS;IAClC,0BAA0B;IACV,QAAQ,CAAS;IAEjC,YAAY,SAAiB,EAAE,QAAgB;QAC7C,KAAK,CACH,6EAA6E;YAC3E,IAAI,SAAS,IAAI,QAAQ,kDAAkD;YAC3E,wCAAwC,CAC3C,CAAC;QACF,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChC,IAAI,GAAG,yBAAyB,CAAC;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClC,IAAI,GAAG,2BAA2B,CAAC;IACnD,6CAA6C;IAC7B,MAAM,CAA0B;IAChD,6CAA6C;IAC7B,SAAS,CAAS;IAElC,YAAY,MAA+B,EAAE,SAAiB,EAAE,OAAe;QAC7E,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AA0BD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChC,IAAI,GAAW,yBAAyB,CAAC;IACzD,kDAAkD;IAClC,OAAO,CAAwB;IAE/C,YAAY,OAAe,EAAE,UAAiC,EAAE,KAAK,EAAE,UAAU,EAAE;QACjF,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED,8EAA8E;AAC9E,2EAA2E;AAC3E,qEAAqE;AACrE,6EAA6E;AAC7E,kDAAkD;AAClD,EAAE;AACF,6EAA6E;AAC7E,6EAA6E;AAC7E,8EAA8E;AAC9E,8EAA8E;AAC9E,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,OAAO,mBAAoB,SAAQ,uBAAuB;IACrC,IAAI,GAAG,qBAAqB,CAAC;IACtD,mFAAmF;IACnE,QAAQ,CAAoB;IAE5C,YAAY,QAA2B;QACrC,KAAK,CACH,wCAAwC,QAAQ,CAAC,MAAM,oBAAoB;YACzE,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YACxF,6EAA6E;YAC7E,yBAAyB,EAC3B,EAAE,KAAK,EAAE,UAAU,EAAE,CACtB,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,uBAAwB,SAAQ,uBAAuB;IACzC,IAAI,GAAG,yBAAyB,CAAC;IAC1D,oFAAoF;IACpE,WAAW,CAAoB;IAE/C,YAAY,WAA8B;QACxC,KAAK,CACH,2DAA2D,WAAW,CAAC,MAAM,GAAG;YAC9E,OAAO,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,gCAAgC;YAC1E,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YAClD,uEAAuE;YACvE,kDAAkD,EACpD,EAAE,KAAK,EAAE,UAAU,EAAE,CACtB,CAAC;QACF,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,uBAAwB,SAAQ,uBAAuB;IACzC,IAAI,GAAG,yBAAyB,CAAC;IAC1D,gGAAgG;IAChF,QAAQ,CAAoB;IAE5C,YAAY,QAA2B;QACrC,KAAK,CACH,GAAG,QAAQ,CAAC,MAAM,kBAAkB,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG;YACrE,iEAAiE;YACjE,4BAA4B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YACxE,yDAAyD;YACzD,mDAAmD,EACrD,EAAE,KAAK,EAAE,UAAU,EAAE,CACtB,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAiBD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,OAAO,8BAA+B,SAAQ,KAAK;IACvC,IAAI,GAAG,gCAAgC,CAAC;IACxD,wEAAwE;IACxD,QAAQ,CAA0C;IAElE,YAAY,QAAiD;QAC3D,KAAK,CACH,2BAA2B,QAAQ,CAAC,MAAM,+BAA+B,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI;YAC3G,QAAQ;iBACL,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;iBAChF,IAAI,CAAC,IAAI,CAAC,CAChB,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AA4BD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,8BAA+B,SAAQ,KAAK;IACvC,IAAI,GAAG,gCAAgC,CAAC;IACxD,oDAAoD;IACpC,MAAM,CAAkC;IAExD,YAAY,MAAuC;QACjD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,OAAO,GACX,IAAI,KAAK,SAAS;YAChB,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,MAAM,IAAI,CAAC,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC,OAAO,EAAE;YAC/D,CAAC,CAAC,gDAAgD,CAAC;QACvD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACtE,KAAK,CAAC,yCAAyC,OAAO,GAAG,IAAI,EAAE,CAAC,CAAC;QACjE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,0BAA2B,SAAQ,KAAK;IACnC,IAAI,GAAG,4BAA4B,CAAC;IACpD,+BAA+B;IACf,IAAI,GAAG,qBAAqB,CAAC;IAC7C,oDAAoD;IACpC,MAAM,CAAkC;IACxD,iFAAiF;IACjE,OAAO,CAAS;IAChC,8EAA8E;IAC9D,IAAI,CAAS;IAE7B,YAAY,MAAuC,EAAE,OAAgB;QACnE,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,IAAI,SAAS,CACjB,6EAA6E,CAC9E,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,GAAG,OAAO,CAAC,OAAO,MAAM,OAAO,CAAC,IAAI,IAAI,QAAQ,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC;QACvF,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QACtE,KAAK,CAAC,OAAO,IAAI,yCAAyC,OAAO,GAAG,IAAI,EAAE,CAAC,CAAC;QAC5E,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAuBD;;;;;;;;;;GAUG;AACH,MAAM,OAAO,eAAgB,SAAQ,KAAK;IACxC,sDAAsD;IACtC,IAAI,CAAS;IAC7B;;;OAGG;IACa,MAAM,CAA8B;IACpD,8EAA8E;IAC9D,kBAAkB,CAAU;IAE5C;;;;;;OAMG;IACH,YACE,IAAY,EACZ,IAAY,EACZ,OAAe,EACf,SAAsC,EAAE,EACxC,kBAA2B;QAE3B,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,kBAAkB,KAAK,SAAS;YAAE,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QACnF,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED,oEAAoE;AACpE,MAAM,OAAO,4BAA6B,SAAQ,eAAe;IAC/C,IAAI,GAAG,8BAA8B,CAAC;IACtD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,8BAA8B,EAAE,uBAAuB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACtG,CAAC;CACF;AAED,8DAA8D;AAC9D,MAAM,OAAO,qBAAsB,SAAQ,eAAe;IACxC,IAAI,GAAG,uBAAuB,CAAC;IAC/C,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,uBAAuB,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;CACF;AAED,yEAAyE;AACzE,MAAM,OAAO,qBAAsB,SAAQ,eAAe;IACxC,IAAI,GAAG,uBAAuB,CAAC;IAC/C,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,uBAAuB,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACxF,CAAC;CACF;AAED,+EAA+E;AAC/E,MAAM,OAAO,uBAAwB,SAAQ,eAAe;IAC1C,IAAI,GAAG,yBAAyB,CAAC;IACjD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,yBAAyB,EAAE,kBAAkB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC5F,CAAC;CACF;AAED,gEAAgE;AAChE,MAAM,OAAO,kCAAmC,SAAQ,eAAe;IACrD,IAAI,GAAG,oCAAoC,CAAC;IAC5D,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,oCAAoC,EAAE,6BAA6B,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAClH,CAAC;CACF;AAED,+DAA+D;AAC/D,MAAM,OAAO,8BAA+B,SAAQ,eAAe;IACjD,IAAI,GAAG,gCAAgC,CAAC;IACxD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,gCAAgC,EAAE,0BAA0B,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC3G,CAAC;CACF;AAED,sEAAsE;AACtE,MAAM,OAAO,+BAAgC,SAAQ,eAAe;IAClD,IAAI,GAAG,iCAAiC,CAAC;IACzD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,iCAAiC,EAAE,0BAA0B,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC5G,CAAC;CACF;AAED,4DAA4D;AAC5D,MAAM,OAAO,iCAAkC,SAAQ,eAAe;IACpD,IAAI,GAAG,mCAAmC,CAAC;IAC3D,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,mCAAmC,EAAE,6BAA6B,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACjH,CAAC;CACF;AAED,gFAAgF;AAChF,MAAM,OAAO,0BAA2B,SAAQ,eAAe;IAC7C,IAAI,GAAG,4BAA4B,CAAC;IACpD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,4BAA4B,EAAE,qBAAqB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAClG,CAAC;CACF;AAED,yEAAyE;AACzE,MAAM,OAAO,iCAAkC,SAAQ,eAAe;IACpD,IAAI,GAAG,mCAAmC,CAAC;IAC3D,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,mCAAmC,EAAE,4BAA4B,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAChH,CAAC;CACF;AAED,8DAA8D;AAC9D,MAAM,OAAO,6BAA8B,SAAQ,eAAe;IAChD,IAAI,GAAG,+BAA+B,CAAC;IACvD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,+BAA+B,EAAE,uBAAuB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACvG,CAAC;CACF;AAED,6EAA6E;AAC7E,MAAM,OAAO,0BAA2B,SAAQ,eAAe;IAC7C,IAAI,GAAG,4BAA4B,CAAC;IACpD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,4BAA4B,EAAE,oBAAoB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACjG,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,0BAA2B,SAAQ,eAAe;IAC7C,IAAI,GAAG,4BAA4B,CAAC;IACpD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,4BAA4B,EAAE,qBAAqB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAClG,CAAC;CACF;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,wBAAyB,SAAQ,eAAe;IAC3C,IAAI,GAAG,0BAA0B,CAAC;IAClD,YAAY,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC5F,KAAK,CAAC,0BAA0B,EAAE,kBAAkB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC7F,CAAC;CACF;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,yBAA0B,SAAQ,eAAe;IAC5C,IAAI,GAAG,2BAA2B,CAAC;IACnD;;;;;;;;OAQG;IACI,SAAS,CAAU;IAC1B,YACE,OAAe,EACf,MAAoC,EACpC,kBAA2B;QAE3B,KAAK,CAAC,2BAA2B,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC/F,CAAC;IACD,iFAAiF;IAC1E,eAAe,CAAC,SAAiB;QACtC,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC/D,CAAC;CACF;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAC/B,IAAI,GAAG,wBAAwB,CAAC;IAChD,YAAY,OAAgB;QAC1B,KAAK,CACH,OAAO;YACL,6EAA6E;gBAC3E,gFAAgF,CACrF,CAAC;QACF,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClC,IAAI,GAAG,2BAA2B,CAAC;IACnD,qEAAqE;IACrD,SAAS,CAAS;IAClC,8EAA8E;IAC9D,QAAQ,CAAS;IACjC,iEAAiE;IACjD,SAAS,CAAU;IAEnC,YAAY,SAAiB,EAAE,QAAgB,EAAE,SAAkB;QACjE,KAAK,CACH,+DAA+D,SAAS,KAAK;YAC3E,UAAU,QAAQ,4DAA4D;YAC9E,+DAA+D,CAClE,CAAC;QACF,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,SAAS,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QACxD,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;GASG;AACH,MAAM,OAAO,sBAAuB,SAAQ,eAAe;IACzC,IAAI,GAAG,wBAAwB,CAAC;IAChD,YAAY,IAAY,EAAE,OAAe,EAAE,MAAoC,EAAE,kBAA2B;QAC1G,KAAK,CAAC,wBAAwB,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC7E,CAAC;CACF;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,uBAAuB,CACrC,IAAY;IAMZ,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,uBAAuB;YAC1B,OAAO,4BAA4B,CAAC;QACtC,KAAK,eAAe;YAClB,OAAO,qBAAqB,CAAC;QAC/B,KAAK,gBAAgB;YACnB,OAAO,qBAAqB,CAAC;QAC/B,KAAK,kBAAkB;YACrB,OAAO,uBAAuB,CAAC;QACjC,KAAK,6BAA6B;YAChC,OAAO,kCAAkC,CAAC;QAC5C,KAAK,0BAA0B;YAC7B,OAAO,8BAA8B,CAAC;QACxC,KAAK,0BAA0B;YAC7B,OAAO,+BAA+B,CAAC;QACzC,KAAK,6BAA6B;YAChC,OAAO,iCAAiC,CAAC;QAC3C,KAAK,qBAAqB;YACxB,OAAO,0BAA0B,CAAC;QACpC,KAAK,4BAA4B;YAC/B,OAAO,iCAAiC,CAAC;QAC3C,KAAK,uBAAuB;YAC1B,OAAO,6BAA6B,CAAC;QACvC,KAAK,oBAAoB;YACvB,OAAO,0BAA0B,CAAC;QACpC,KAAK,qBAAqB;YACxB,OAAO,0BAA0B,CAAC;QACpC,KAAK,mBAAmB;YACtB,kEAAkE;YAClE,mEAAmE;YACnE,mEAAmE;YACnE,sDAAsD;YACtD,kEAAkE;YAClE,gBAAgB;YAChB,OAAO,yBAAyB,CAAC;QACnC,KAAK,kBAAkB;YACrB,0DAA0D;YAC1D,gEAAgE;YAChE,2DAA2D;YAC3D,iEAAiE;YACjE,gEAAgE;YAChE,kEAAkE;YAClE,gEAAgE;YAChE,0DAA0D;YAC1D,gCAAgC;YAChC,OAAO,wBAAwB,CAAC;QAClC;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IAC3B,IAAI,GAAG,oBAAoB,CAAC;IAC5C,6EAA6E;IAC7D,OAAO,CAAS;IAChC,uDAAuD;IACvC,SAAS,CAAS;IAElC,YAAY,OAAe,EAAE,SAAiB,EAAE,OAAe,EAAE,KAAe;QAC9E,KAAK,CAAC,OAAO,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC5D,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACzB,IAAI,GAAG,kBAAkB,CAAC;IAC1C,6EAA6E;IAC7D,OAAO,CAAS;IAChC,8EAA8E;IAC9D,QAAQ,CAAS;IACjC;;;OAGG;IACa,SAAS,CAAwE;IAEjG,YACE,OAAe,EACf,QAAgB,EAChB,OAAe,EACf,IAA8H;QAE9H,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC9E,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,IAAI,EAAE,SAAS,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACnE,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,eAAgB,SAAQ,KAAK;IACxB,IAAI,GAAG,iBAAiB,CAAC;IACzC,YAAY,MAAc;QACxB,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;CACF"}

package/dist/client/index.d.ts

@@ -0,0 +1,26 @@
+/**
+ * SDK 2.0 client surface — public re-exports.
+ */
+export { QodoClient } from './QodoClient.js';
+export { TaskClient } from './TaskClient.js';
+export { ToolClient } from './ToolClient.js';
+export type { InfoClient } from './InfoClient.js';
+export { PipelineClient, PipelineBuilder } from './PipelineClient.js';
+export { BulletinClient } from './BulletinClient.js';
+export { ArtifactsClient } from './ArtifactsClient.js';
+export { StateClient } from './StateClient.js';
+export { AgentsClient } from './AgentsClient.js';
+export { QodoNotImplementedError, QodoClientOptionsError, QodoBackpressureError, QodoServerError, QodoCancelRoutingFailedError, QodoCancelFailedError, QodoTaskNotFoundError, QodoTaskNotWaitingError, QodoAgentReconstructionFailedError, QodoCrossPodResumeAbortedError, QodoDepsConstructionFailedError, QodoMessageHistoryLoadFailedError, QodoHitlPersistFailedError, QodoHitlSubstrateUnavailableError, QodoUnauthorizedResolverError, QodoInvalidResolutionError, QodoGraphSpecRejectedError, QodoUnknownServerError, QodoIdempotencyKeyValidationError, QodoAdmissionStalledError, QodoAdmissionTimeoutError, QodoStreamAbortedError, QodoSessionMismatchError, classForServerErrorCode, } from './errors.js';
+export type { ServerErrorEntry } from './errors.js';
+export type { ClientOptions, ClientAuth, ClientReconnectOptions, ClientBackpressureOptions, TaskOptions, ResubscribeOptions, } from './options.js';
+export type { ToolRequestHandler, Subscription } from './ToolClient.js';
+export type { TaskCancelResult } from './TaskClient.js';
+export type { EventSubscription } from './observers.js';
+export type { BulletinFilter, BulletinHandler } from './BulletinClient.js';
+export type { ArtifactFilter, ArtifactHandler } from './ArtifactsClient.js';
+export type { StateFilter, StateHandler } from './StateClient.js';
+export type { AgentSpawnFilter, AgentSpawnHandler } from './AgentsClient.js';
+export type { WSTransport, WSTransportFactory, WSTransportFactoryArgs, WSEventHandlers, } from './transport.js';
+export { defaultTransportFactory } from './transport.js';
+export type { PipelineStepFn, PipelineStepContext, PipelineGateFn, PipelineErrorStrategy, PipelineResult, PipelineStepLog, PipelineStepError, } from './PipelineClient.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/client/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/client/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAG7C,YAAY,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EACL,uBAAuB,EACvB,sBAAsB,EACtB,qBAAqB,EAErB,eAAe,EACf,4BAA4B,EAC5B,qBAAqB,EACrB,qBAAqB,EACrB,uBAAuB,EACvB,kCAAkC,EAClC,8BAA8B,EAC9B,+BAA+B,EAC/B,iCAAiC,EACjC,0BAA0B,EAC1B,iCAAiC,EACjC,6BAA6B,EAC7B,0BAA0B,EAC1B,0BAA0B,EAC1B,sBAAsB,EAEtB,iCAAiC,EACjC,yBAAyB,EACzB,yBAAyB,EACzB,sBAAsB,EAEtB,wBAAwB,EACxB,uBAAuB,GACxB,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEpD,YAAY,EACV,aAAa,EACb,UAAU,EACV,sBAAsB,EACtB,yBAAyB,EACzB,WAAW,EACX,kBAAkB,GACnB,MAAM,cAAc,CAAC;AAEtB,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACxE,YAAY,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACxD,YAAY,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxD,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAC3E,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAC5E,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAClE,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAC7E,YAAY,EACV,WAAW,EACX,kBAAkB,EAClB,sBAAsB,EACtB,eAAe,GAChB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AAEzD,YAAY,EACV,cAAc,EACd,mBAAmB,EACnB,cAAc,EACd,qBAAqB,EACrB,cAAc,EACd,eAAe,EACf,iBAAiB,GAClB,MAAM,qBAAqB,CAAC"}

package/dist/client/index.js

@@ -0,0 +1,20 @@
+/**
+ * SDK 2.0 client surface — public re-exports.
+ */
+export { QodoClient } from './QodoClient.js';
+export { TaskClient } from './TaskClient.js';
+export { ToolClient } from './ToolClient.js';
+export { PipelineClient, PipelineBuilder } from './PipelineClient.js';
+export { BulletinClient } from './BulletinClient.js';
+export { ArtifactsClient } from './ArtifactsClient.js';
+export { StateClient } from './StateClient.js';
+export { AgentsClient } from './AgentsClient.js';
+export { QodoNotImplementedError, QodoClientOptionsError, QodoBackpressureError, 
+// Typed server-error family.
+QodoServerError, QodoCancelRoutingFailedError, QodoCancelFailedError, QodoTaskNotFoundError, QodoTaskNotWaitingError, QodoAgentReconstructionFailedError, QodoCrossPodResumeAbortedError, QodoDepsConstructionFailedError, QodoMessageHistoryLoadFailedError, QodoHitlPersistFailedError, QodoHitlSubstrateUnavailableError, QodoUnauthorizedResolverError, QodoInvalidResolutionError, QodoGraphSpecRejectedError, QodoUnknownServerError, 
+// Admission / idempotency-key error family.
+QodoIdempotencyKeyValidationError, QodoAdmissionStalledError, QodoAdmissionTimeoutError, QodoStreamAbortedError, 
+// Session-id wire mismatch typed error.
+QodoSessionMismatchError, classForServerErrorCode, } from './errors.js';
+export { defaultTransportFactory } from './transport.js';
+//# sourceMappingURL=index.js.map

package/dist/client/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/client/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAI7C,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EACL,uBAAuB,EACvB,sBAAsB,EACtB,qBAAqB;AACrB,6BAA6B;AAC7B,eAAe,EACf,4BAA4B,EAC5B,qBAAqB,EACrB,qBAAqB,EACrB,uBAAuB,EACvB,kCAAkC,EAClC,8BAA8B,EAC9B,+BAA+B,EAC/B,iCAAiC,EACjC,0BAA0B,EAC1B,iCAAiC,EACjC,6BAA6B,EAC7B,0BAA0B,EAC1B,0BAA0B,EAC1B,sBAAsB;AACtB,4CAA4C;AAC5C,iCAAiC,EACjC,yBAAyB,EACzB,yBAAyB,EACzB,sBAAsB;AACtB,wCAAwC;AACxC,wBAAwB,EACxB,uBAAuB,GACxB,MAAM,aAAa,CAAC;AAyBrB,OAAO,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/client/inlineGraph.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Pre-wire validator for inline `InlineGraphSpec` payloads — walks the
+ * dict-keyed QAR-native shape.
+ *
+ * Runs synchronously inside `client.tasks.startWithGraph(...)` so a malformed
+ * graph is rejected before it crosses the WebSocket. The check set mirrors
+ * the SDK-enforceable subset of QAR's wire rules — anything requiring
+ * server-side state (model registry, tenant catalog, AgentSpec
+ * composition against the live agent table, transitive budget caps) is left
+ * to QAR's `task.start` validator or the opt-in
+ * `client.specs.validate(...)` pre-flight.
+ *
+ * Output: a `QodoInlineGraphValidationError` carrying every failure observed,
+ * with the same `{ rule_id, path, message }` shape as `SpecValidationError`
+ * so consumers can route SDK-side and server-side rejections through the same
+ * branch logic.
+ */
+import type { InlineGraphEdge, InlineGraphSpec } from '../qar/specs.js';
+/**
+ * Default cap for graph depth (longest acyclic path from entry).
+ *
+ * Matches QAR's `MAX_GRAPH_DEPTH` operator default (4). Operators running a
+ * higher-limit deployment can raise this per-call via the
+ * `maxDepth` option; the pre-flight `client.specs.validate(...)` is
+ * the path for non-default deployment caps.
+ */
+export declare const DEFAULT_INLINE_GRAPH_MAX_DEPTH = 4;
+/** Options accepted by `validateInlineGraphSpec`. */
+export interface InlineGraphValidationOptions {
+    /** Override the depth cap. Default `DEFAULT_INLINE_GRAPH_MAX_DEPTH`. */
+    readonly maxDepth?: number;
+}
+/**
+ * Validate `graph` against the SDK-side rule subset. Throws
+ * `QodoInlineGraphValidationError` when any rule fails — every failure is
+ * carried on `.failures`, in stable depth-first order. Returns void on
+ * success.
+ *
+ * Stable order matters: consumers gating CI on a sorted failure dump don't
+ * want spurious diffs from set / map iteration nondeterminism. Object key
+ * iteration in JS follows insertion order for non-integer string keys, so
+ * agent traversal mirrors the consumer's source-text order.
+ */
+export declare function validateInlineGraphSpec(graph: InlineGraphSpec, opts?: InlineGraphValidationOptions): void;
+/**
+ * Compute the longest acyclic path length (edge count) starting at `entry`.
+ *
+ * Exported so `TaskClient` can reuse the same impl for the `qar.graph.depth`
+ * OTel span attr — keeping one implementation prevents the two copies from
+ * drifting on cycle-handling semantics.
+ *
+ * Iterative postorder DFS with a visited stack — addresses two failure modes:
+ *
+ *   1. Cycles through undeclared endpoints. `findCycle` only walks
+ *      declared-node cycles, so an edge to/from an undeclared node could
+ *      shape a cycle that slipped past R6/R7. The `onStack` set short-
+ *      circuits any back-edge before it re-enters an in-flight node — the
+ *      back-edge contributes `0` so the longest-path search still
+ *      terminates.
+ *   2. Stack overflow on deeply nested chains. Recursive DFS blows the
+ *      JS stack when an operator raises `maxDepth` and supplies a deep
+ *      graph. Iterative postorder (enter / exit phases on an explicit
+ *      stack) keeps the heap bounded by graph size instead of call depth.
+ */
+export declare function longestPathFrom(entry: string, edges: readonly InlineGraphEdge[]): number;
+//# sourceMappingURL=inlineGraph.d.ts.map

package/dist/client/inlineGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inlineGraph.d.ts","sourceRoot":"","sources":["../../src/client/inlineGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAMH,OAAO,KAAK,EAEV,eAAe,EACf,eAAe,EAChB,MAAM,iBAAiB,CAAC;AAEzB;;;;;;;GAOG;AACH,eAAO,MAAM,8BAA8B,IAAI,CAAC;AAEhD,qDAAqD;AACrD,MAAM,WAAW,4BAA4B;IAC3C,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,eAAe,EACtB,IAAI,CAAC,EAAE,4BAA4B,GAClC,IAAI,CAUN;AAwQD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,eAAe,EAAE,GAChC,MAAM,CA2CR"}

package/dist/client/inlineGraph.js

@@ -0,0 +1,500 @@
+/**
+ * Pre-wire validator for inline `InlineGraphSpec` payloads — walks the
+ * dict-keyed QAR-native shape.
+ *
+ * Runs synchronously inside `client.tasks.startWithGraph(...)` so a malformed
+ * graph is rejected before it crosses the WebSocket. The check set mirrors
+ * the SDK-enforceable subset of QAR's wire rules — anything requiring
+ * server-side state (model registry, tenant catalog, AgentSpec
+ * composition against the live agent table, transitive budget caps) is left
+ * to QAR's `task.start` validator or the opt-in
+ * `client.specs.validate(...)` pre-flight.
+ *
+ * Output: a `QodoInlineGraphValidationError` carrying every failure observed,
+ * with the same `{ rule_id, path, message }` shape as `SpecValidationError`
+ * so consumers can route SDK-side and server-side rejections through the same
+ * branch logic.
+ */
+import { QodoInlineGraphValidationError, } from './errors.js';
+/**
+ * Default cap for graph depth (longest acyclic path from entry).
+ *
+ * Matches QAR's `MAX_GRAPH_DEPTH` operator default (4). Operators running a
+ * higher-limit deployment can raise this per-call via the
+ * `maxDepth` option; the pre-flight `client.specs.validate(...)` is
+ * the path for non-default deployment caps.
+ */
+export const DEFAULT_INLINE_GRAPH_MAX_DEPTH = 4;
+/**
+ * Validate `graph` against the SDK-side rule subset. Throws
+ * `QodoInlineGraphValidationError` when any rule fails — every failure is
+ * carried on `.failures`, in stable depth-first order. Returns void on
+ * success.
+ *
+ * Stable order matters: consumers gating CI on a sorted failure dump don't
+ * want spurious diffs from set / map iteration nondeterminism. Object key
+ * iteration in JS follows insertion order for non-integer string keys, so
+ * agent traversal mirrors the consumer's source-text order.
+ */
+export function validateInlineGraphSpec(graph, opts) {
+    // Track every `InlineGraphSpec` object reference we've entered during the
+    // recursive walk. Object-graph cycles (the same outer graph reachable
+    // from one of its nested nodes via shared in-memory reference) would
+    // otherwise blow the stack — a JS-callable client-side DoS surface, even
+    // though `JSON.stringify` on a cyclic object would reject the eventual
+    // wire write. Defense in depth: catch cycles in the validator so a hostile
+    // or buggy consumer payload crashes cleanly with a typed failure, not
+    // `RangeError: Maximum call stack size exceeded`.
+    validateInlineGraphSpecImpl(graph, opts, new WeakSet());
+}
+function validateInlineGraphSpecImpl(graph, opts, visited) {
+    const failures = [];
+    // Object-cycle guard. `WeakSet` keeps refs without holding them alive
+    // beyond the walk; `Object.add` returns the set for chaining. We register
+    // the *current* graph before recursing so a self-reference is caught.
+    if (visited.has(graph)) {
+        throw new QodoInlineGraphValidationError([
+            {
+                rule_id: 'D13-Rcycle',
+                path: '',
+                message: 'graph contains a recursive object-reference cycle — a nested ' +
+                    'InlineGraphSpec node shares the same in-memory object as an ancestor',
+            },
+        ]);
+    }
+    visited.add(graph);
+    // The SDK type marks `limits` as required, but JS-side callers can pass
+    // anything. Coalesce defensively so a malformed input throws with a typed
+    // failure instead of a `TypeError: Cannot read properties of undefined`.
+    const specMaxDepth = graph.limits?.max_depth;
+    const optsMaxDepth = opts?.maxDepth;
+    // Effective cap policy:
+    //   - When the spec declares `limits.max_depth`, that's a hard ceiling
+    //     the SDK enforces locally — `opts.maxDepth` can lower it but not
+    //     raise it. Mirrors QAR's wire validator (`D13-R2` clamps spec-declared
+    //     max_depth against the deployment's effective cap).
+    //   - When the spec doesn't declare a cap, `opts.maxDepth` is the
+    //     override; absent both, the operator default.
+    const maxDepth = specMaxDepth !== undefined && optsMaxDepth !== undefined
+        ? Math.min(specMaxDepth, optsMaxDepth)
+        : (specMaxDepth ?? optsMaxDepth ?? DEFAULT_INLINE_GRAPH_MAX_DEPTH);
+    const agents = graph.agents ?? {};
+    const edges = graph.edges ?? [];
+    // Runtime well-formedness: the SDK type forbids it, but a JS caller (or a
+    // consumer porting from an older array-shape SDK) can pass an array
+    // here. Catch it explicitly so the diagnostic is helpful instead of the
+    // validator quietly walking `agents[0] = …` as if `'0'` were a node name.
+    if (Array.isArray(agents)) {
+        throw new QodoInlineGraphValidationError([
+            {
+                rule_id: 'D11-R2',
+                path: '/agents',
+                message: 'agents must be a mapping (dict) keyed by node name, not an array — ' +
+                    'array-shape agents are the legacy SDK shape that QAR rejects',
+            },
+        ]);
+    }
+    const agentNames = Object.keys(agents);
+    const declaredNames = new Set(agentNames);
+    // D11-R2 — agents must be a non-empty mapping.
+    if (agentNames.length === 0) {
+        failures.push({
+            rule_id: 'D11-R2',
+            path: '/agents',
+            message: 'agents must be a non-empty mapping',
+        });
+    }
+    // Well-formedness: termination must be a non-empty list. QAR's Pydantic
+    // model has no `min_length` constraint on `termination`, but a graph with
+    // zero termination conditions has no exit — the supervisor would loop
+    // forever (or until `max_steps`). Flagging this client-side surfaces the
+    // authoring mistake before it reaches QAR.
+    if (!Array.isArray(graph.termination) || graph.termination.length === 0) {
+        failures.push({
+            rule_id: 'D11-R1',
+            path: '/termination',
+            message: 'termination must be a non-empty list of TerminationCondition entries',
+        });
+    }
+    // D11-R1 — entry is required.
+    if (graph.entry === undefined || graph.entry === '') {
+        failures.push({
+            rule_id: 'D11-R1',
+            path: '/entry',
+            message: 'entry is required',
+        });
+    }
+    // D11-R3 (well-formedness): node keys must be non-empty. Dict-key
+    // uniqueness gives us R3-style "names must be unique" for free — the JSON
+    // shape simply cannot carry two agents under the same key.
+    for (const name of agentNames) {
+        if (name === '') {
+            failures.push({
+                rule_id: 'D11-R3',
+                path: '/agents',
+                message: 'agent name (mapping key) must be a non-empty string',
+            });
+        }
+    }
+    // D11-R8 — entry references a declared agent.
+    if (graph.entry !== undefined &&
+        graph.entry !== '' &&
+        !declaredNames.has(graph.entry)) {
+        failures.push({
+            rule_id: 'D11-R8',
+            path: '/entry',
+            message: `entry '${graph.entry}' is not a declared agent name`,
+        });
+    }
+    // D11-R6/R7 — edges must reference declared agents (both endpoints + any
+    // `on_error.route_to` recovery target).
+    edges.forEach((edge, idx) => {
+        if (!declaredNames.has(edge.from)) {
+            failures.push({
+                rule_id: 'D11-R6',
+                path: `/edges/${idx}/from`,
+                message: `edge.from '${edge.from}' is not a declared agent name`,
+            });
+        }
+        if (!declaredNames.has(edge.to)) {
+            failures.push({
+                rule_id: 'D11-R7',
+                path: `/edges/${idx}/to`,
+                message: `edge.to '${edge.to}' is not a declared agent name`,
+            });
+        }
+        // D11-R7 (extended): `on_error.route_to` is also a node reference and
+        // must resolve. The `{ abort: true }` arm has no target so it's fine.
+        if (edge.on_error !== undefined &&
+            edge.on_error !== null &&
+            'route_to' in edge.on_error &&
+            !declaredNames.has(edge.on_error.route_to)) {
+            failures.push({
+                rule_id: 'D11-R7',
+                path: `/edges/${idx}/on_error/route_to`,
+                message: `edge.on_error.route_to '${edge.on_error.route_to}' is not a declared agent name`,
+            });
+        }
+    });
+    // D11-R9 — `evaluate` edges only target evaluator-role nodes.
+    // D11-R11 — evaluator nodes have no outbound edges (they're leaves).
+    edges.forEach((edge, idx) => {
+        if (!declaredNames.has(edge.to))
+            return; // already flagged above
+        const toRole = agents[edge.to]?.role;
+        if (edge.kind === 'evaluate' && toRole !== 'evaluator') {
+            failures.push({
+                rule_id: 'D11-R9',
+                path: `/edges/${idx}`,
+                message: `evaluate-kind edge targets non-evaluator node '${edge.to}' (role ${toRole ?? '<undeclared>'})`,
+            });
+        }
+        if (declaredNames.has(edge.from) && agents[edge.from]?.role === 'evaluator') {
+            failures.push({
+                rule_id: 'D11-R11',
+                path: `/edges/${idx}/from`,
+                message: `evaluator node '${edge.from}' has an outbound edge — evaluators must be leaves`,
+            });
+        }
+    });
+    // D11-R12 — evaluator nodes with an inline AgentSpec must declare an
+    // output_schema shaped like VerdictResult (object schema with a `verdict`
+    // property whose enum is the closed three-arm set). Server-side
+    // (`agent_id`) evaluators are validated by QAR — we can't probe the
+    // remote spec from the client. Nested `InlineGraphSpec` evaluator nodes
+    // are unusual but legal; we skip the fingerprint check there
+    // since the inner graph's output_schema lives one layer deeper.
+    for (const name of agentNames) {
+        const agent = agents[name];
+        if (agent.role !== 'evaluator')
+            continue;
+        const inner = agent.spec;
+        if (!isInlineAgentSpec(inner))
+            continue;
+        if (!isVerdictResultSchema(inner.output_schema)) {
+            failures.push({
+                rule_id: 'D11-R12',
+                path: `/agents/${name}/spec/output_schema`,
+                message: `evaluator node '${name}' output_schema must be shaped like VerdictResult ` +
+                    `(object schema with a 'verdict' property restricted to ['pass', 'fail', 'needs_revision'])`,
+            });
+        }
+    }
+    // D11-Rcycle — acyclicity. Iterative DFS from every node so disconnected
+    // components are scanned. The cycle finder runs over the post-edge graph
+    // regardless of edge kind; the wire validator forbids cycles across all kinds.
+    if (declaredNames.size > 0) {
+        const cycle = findCycle(declaredNames, edges);
+        if (cycle !== null) {
+            failures.push({
+                rule_id: 'D11-Rcycle',
+                path: '',
+                message: `graph contains a cycle: ${cycle.join(' -> ')}`,
+            });
+        }
+    }
+    // D11-R10 — graph depth (longest acyclic walk from entry) ≤ maxDepth.
+    // Skip when the structure is already broken (no entry, or entry isn't
+    // declared) — the longest-path search has no anchor.
+    if (graph.entry !== undefined &&
+        declaredNames.has(graph.entry) &&
+        failures.every((f) => f.rule_id !== 'D11-Rcycle')) {
+        const depth = longestPathFrom(graph.entry, edges);
+        if (depth > maxDepth) {
+            failures.push({
+                rule_id: 'D11-R10',
+                path: '',
+                message: `graph depth ${depth} exceeds configured maximum ${maxDepth}`,
+            });
+        }
+    }
+    // D13-R1 — nested `InlineGraphSpec` nodes recursively respect the depth
+    // cap. The deeper rule set (transitive AgentSpec / GraphSpec propagation)
+    // lives in QAR's compose-time validator; we only do the local check here
+    // so a malformed inner graph fails fast. `visited` is threaded so an
+    // object-reference cycle terminates with a typed `D13-Rcycle` failure
+    // instead of unbounded recursion.
+    for (const name of agentNames) {
+        const agent = agents[name];
+        const inner = agent.spec;
+        if (!isInlineGraphSpec(inner))
+            continue;
+        try {
+            validateInlineGraphSpecImpl(inner, opts, visited);
+        }
+        catch (err) {
+            if (err instanceof QodoInlineGraphValidationError) {
+                for (const innerFailure of err.failures) {
+                    failures.push({
+                        rule_id: innerFailure.rule_id,
+                        path: `/agents/${name}/spec${innerFailure.path}`,
+                        message: innerFailure.message,
+                    });
+                }
+            }
+            else {
+                throw err;
+            }
+        }
+    }
+    if (failures.length > 0) {
+        throw new QodoInlineGraphValidationError(failures);
+    }
+}
+/**
+ * Compute the longest acyclic path length (edge count) starting at `entry`.
+ *
+ * Exported so `TaskClient` can reuse the same impl for the `qar.graph.depth`
+ * OTel span attr — keeping one implementation prevents the two copies from
+ * drifting on cycle-handling semantics.
+ *
+ * Iterative postorder DFS with a visited stack — addresses two failure modes:
+ *
+ *   1. Cycles through undeclared endpoints. `findCycle` only walks
+ *      declared-node cycles, so an edge to/from an undeclared node could
+ *      shape a cycle that slipped past R6/R7. The `onStack` set short-
+ *      circuits any back-edge before it re-enters an in-flight node — the
+ *      back-edge contributes `0` so the longest-path search still
+ *      terminates.
+ *   2. Stack overflow on deeply nested chains. Recursive DFS blows the
+ *      JS stack when an operator raises `maxDepth` and supplies a deep
+ *      graph. Iterative postorder (enter / exit phases on an explicit
+ *      stack) keeps the heap bounded by graph size instead of call depth.
+ */
+export function longestPathFrom(entry, edges) {
+    const adjacency = new Map();
+    for (const edge of edges) {
+        const targets = adjacency.get(edge.from) ?? [];
+        targets.push(edge.to);
+        adjacency.set(edge.from, targets);
+    }
+    const memo = new Map();
+    const onStack = new Set();
+    const stack = [{ node: entry, phase: 'enter' }];
+    while (stack.length > 0) {
+        const frame = stack.pop();
+        if (frame.phase === 'enter') {
+            if (memo.has(frame.node))
+                continue;
+            if (onStack.has(frame.node))
+                continue; // back-edge — contributes 0
+            onStack.add(frame.node);
+            // Schedule the exit phase to run AFTER all children resolve their memo.
+            // Pushing exit before children means the exit pops last.
+            stack.push({ node: frame.node, phase: 'exit' });
+            const outs = adjacency.get(frame.node) ?? [];
+            for (const target of outs) {
+                if (memo.has(target) || onStack.has(target))
+                    continue;
+                stack.push({ node: target, phase: 'enter' });
+            }
+        }
+        else {
+            const outs = adjacency.get(frame.node) ?? [];
+            let best = 0;
+            for (const target of outs) {
+                const cached = memo.get(target);
+                // `cached === undefined` means the target is on the current DFS
+                // path (back-edge) — it contributes 0 and never gets a memo entry
+                // because we short-circuited the enter phase above. Targets we
+                // resolved sit in `memo`.
+                if (cached === undefined)
+                    continue;
+                const sub = cached + 1;
+                if (sub > best)
+                    best = sub;
+            }
+            memo.set(frame.node, best);
+            onStack.delete(frame.node);
+        }
+    }
+    return memo.get(entry) ?? 0;
+}
+/**
+ * Detect a cycle via iterative DFS over every declared node. Returns the
+ * cycle as `['a', 'b', 'a']` (closed loop) the moment one is found, or `null`
+ * when the graph is acyclic. Stable: walks node names in their declaration
+ * order, edges in their declaration order — same input gives same diagnostic.
+ */
+function findCycle(declared, edges) {
+    const adjacency = new Map();
+    for (const edge of edges) {
+        if (!declared.has(edge.from) || !declared.has(edge.to))
+            continue;
+        const targets = adjacency.get(edge.from) ?? [];
+        targets.push(edge.to);
+        adjacency.set(edge.from, targets);
+    }
+    const WHITE = 0;
+    const GRAY = 1;
+    const BLACK = 2;
+    const color = new Map();
+    for (const name of declared)
+        color.set(name, WHITE);
+    const parent = new Map();
+    // Build a closed-loop diagnostic for a back-edge `end -> start`. We walk
+    // the parent chain from `end` back to `start` (inclusive), reverse so the
+    // path reads in forward order, then append `start` again so the loop
+    // visibly closes. Example: a back-edge from `c` (current node) to `a`
+    // (its ancestor on the DFS stack) produces `['a', 'b', 'c', 'a']` — the
+    // shape consumers expect from `cycle.join(' -> ')`. Appending `end`
+    // instead of `start` would produce `a -> b -> c -> c` — a non-closing
+    // path that's misleading to debuggers.
+    const buildCycle = (start, end) => {
+        const path = [end];
+        let cursor = end;
+        while (cursor !== undefined && cursor !== start) {
+            cursor = parent.get(cursor);
+            if (cursor === undefined)
+                break;
+            path.push(cursor);
+        }
+        path.reverse();
+        path.push(start);
+        return path;
+    };
+    for (const root of declared) {
+        if (color.get(root) !== WHITE)
+            continue;
+        const stack = [{ node: root, idx: 0 }];
+        color.set(root, GRAY);
+        while (stack.length > 0) {
+            const top = stack[stack.length - 1];
+            const outs = adjacency.get(top.node) ?? [];
+            if (top.idx >= outs.length) {
+                color.set(top.node, BLACK);
+                stack.pop();
+                continue;
+            }
+            const next = outs[top.idx];
+            top.idx += 1;
+            const c = color.get(next);
+            if (c === GRAY) {
+                return buildCycle(next, top.node);
+            }
+            if (c === WHITE) {
+                color.set(next, GRAY);
+                parent.set(next, top.node);
+                stack.push({ node: next, idx: 0 });
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Discriminate the `InlineGraphAgent.spec` union arms at runtime. The wire
+ * type carries `kind: 'AgentSpec' | 'GraphSpec'` on the two spec arms; the
+ * static-ref arm carries `agent_id` and no `kind`.
+ */
+function isInlineAgentSpec(spec) {
+    return (typeof spec === 'object' &&
+        spec !== null &&
+        'kind' in spec &&
+        spec.kind === 'AgentSpec');
+}
+function isInlineGraphSpec(spec) {
+    return (typeof spec === 'object' &&
+        spec !== null &&
+        'kind' in spec &&
+        spec.kind === 'GraphSpec');
+}
+/**
+ * Heuristic check that an output_schema is shaped like `VerdictResult`.
+ *
+ * Rather than running a full JSON Schema validator (we don't ship one), we
+ * spot-check the structural fingerprint that distinguishes a verdict schema
+ * from a generic object schema:
+ *
+ *   - It's a JSON object.
+ *   - It has `type: "object"` (the dominant convention; absent is tolerated
+ *     for schemas that compose via `allOf` / `anyOf`).
+ *   - `properties.verdict` exists and restricts to the closed three-arm enum
+ *     `["pass", "fail", "needs_revision"]` — order doesn't matter, but the
+ *     set must match exactly.
+ *
+ * The wire shape is wrapped:
+ * `output_schema = { json_schema: { name, schema, strict? } }` (matches
+ * the OpenAI strict-mode envelope). This helper unwraps the
+ * `json_schema.schema` field before fingerprinting. The bare-schema
+ * fallback path is kept for back-compat with consumers carrying older
+ * unwrapped shapes.
+ *
+ * The QAR validator runs a full Pydantic shape check on dispatch; this
+ * client-side gate catches the most common authoring mistake (forgot
+ * the schema, or the verdict enum is wrong) without dragging in a JSON
+ * Schema runtime dep.
+ */
+function isVerdictResultSchema(schema) {
+    if (typeof schema !== 'object' || schema === null)
+        return false;
+    // Unwrap the `OutputSchemaSpec` wrapper if present so the
+    // structural fingerprint check runs on the inner JSON Schema.
+    const top = schema;
+    const wrapped = top.json_schema;
+    const inner = wrapped !== undefined && wrapped !== null
+        ? wrapped.schema
+        : schema;
+    if (typeof inner !== 'object' || inner === null)
+        return false;
+    const obj = inner;
+    if (obj.type !== undefined && obj.type !== 'object')
+        return false;
+    const props = obj.properties;
+    if (typeof props !== 'object' || props === null)
+        return false;
+    const verdict = props.verdict;
+    if (typeof verdict !== 'object' || verdict === null)
+        return false;
+    const enumField = verdict.enum;
+    if (!Array.isArray(enumField))
+        return false;
+    const required = new Set(['pass', 'fail', 'needs_revision']);
+    if (enumField.length !== required.size)
+        return false;
+    for (const value of enumField) {
+        if (typeof value !== 'string' || !required.has(value))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=inlineGraph.js.map