@evalops/maestro 0.10.51 → 0.10.53

package/dist/node_modules/@evalops/tui/dist/mermaid-renderer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mermaid-renderer.js","sourceRoot":"","sources":["../src/mermaid-renderer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,OAAO,KAAK,MAAM,OAAO,CAAC;AAE1B;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,GAAG;IAClB,OAAO;IACP,MAAM;IACN,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;CACN,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,MAAM,UAAU,GAAG,CAAC,CAAC;AACrB,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,SAAS,GAAG,EAAE,CAAC;AAoDrB;;;;;;;;;;;;GAYG;AACH,MAAM,YAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;AAExD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,oBAAoB,CACnC,MAAc,EACd,KAAa;IAEb,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;IACtC,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAChC,OAAO,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;IAC3C,CAAC;IAED,+DAA+D;IAC/D,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM,EAAE,CAAC;QACb,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;IAChC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,oBAAoB;IACzB,YACkB,OAAsB,EAC/B,KAAa;QADJ,YAAO,GAAP,OAAO,CAAe;QAC/B,UAAK,GAAL,KAAK,CAAQ;IACnB,CAAC;IAEJ;;;;;OAKG;IACH,MAAM;QACL,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC;QACb,CAAC;QACD,iCAAiC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAClC,IAAI,MAAM,EAAE,CAAC;YACZ,OAAO,MAAM,CAAC;QACf,CAAC;QACD,gEAAgE;QAChE,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;OAUG;IACK,WAAW;QAClB,uEAAuE;QACvE,wDAAwD;QACxD,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACb,CAAC;QAED,wEAAwE;QACxE,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1D,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAEtE,0EAA0E;QAC1E,yDAAyD;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;QACpD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACb,CAAC;QAED,uCAAuC;QACvC,iDAAiD;QACjD,uDAAuD;QACvD,MAAM,YAAY,GACjB,YAAY,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QACrE,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC;QACzC,MAAM,YAAY,GACjB,kBAAkB,GAAG,UAAU;YAC/B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,kBAAkB,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QAEjD,kEAAkE;QAClE,8EAA8E;QAC9E,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,CACxD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAC/C,CAAC;QAEF,mEAAmE;QACnE,2DAA2D;QAC3D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoC,CAAC;QAClE,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;YACpC,8CAA8C;YAC9C,MAAM,IAAI,GAAG,UAAU,GAAG,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;YACnD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE;gBACjC,gDAAgD;gBAChD,MAAM,IAAI,GAAG,SAAS,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;gBAChD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,2DAA2D;QAC3D,4EAA4E;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QAErE,sEAAsE;QACtE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CACjC,qBAAqB,IAAI,CAAC,OAAO,CAAC,WAAW,MAAM,CACnD,CAAC;QACF,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,kCAAkC,CAAC,CAAC;QACxE,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM;YACvC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,OAAO,EAAE,CAAC,CAAC;YAC5D,CAAC,CAAC,EAAE,CAAC;QAEN,OAAO;YACN,KAAK;YACL,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM;YACN,GAAG,YAAY;SACf,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACK,eAAe,CAAC,YAAoB;QAC3C,yEAAyE;QACzE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC5B,SAAS,EACT,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAChE,CAAC;QAEF,kEAAkE;QAClE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QAE/D,iDAAiD;QACjD,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAE5D,gDAAgD;QAChD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QAE/D,sDAAsD;QACtD,MAAM,SAAS,GAAG,eAAe,GAAG,YAAY,CAAC;QAEjD,sCAAsC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC;QAEpD,2EAA2E;QAC3E,IAAI,MAAM,GAAG,aAAa,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC;QACb,CAAC;QAED,+DAA+D;QAC/D,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACK,OAAO,CACd,MAAkB,EAClB,CAAS,EACT,CAAS,EACT,QAAgB,EAChB,KAAa;QAEb,2DAA2D;QAC3D,MAAM,UAAU,GAAG,QAAQ,GAAG,CAAC,CAAC;QAEhC,gEAAgE;QAChE,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACnD,MAAM,WAAW,GAAG,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAEtD,mEAAmE;QACnE,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC;QAC1C,MAAM,GAAG,GAAG,IAAI,WAAW,GAAG,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC;QAE7C,wDAAwD;QACxD,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;YAC3C,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAC/B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACV,OAAO;YACR,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACvB,CAAC;QACF,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACK,SAAS,CAChB,MAAkB,EAClB,aAAoD,EACpD,QAAgB;QAEhB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEtC,wEAAwE;YACxE,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;gBAClB,QAAQ,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;gBACxE,SAAS;YACV,CAAC;YAED,6EAA6E;YAC7E,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,IAAI,CACZ,gBAAgB,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,+BAA+B,CACtE,CAAC;gBACF,SAAS;YACV,CAAC;YAED,8CAA8C;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,wBAAwB;YAC5D,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC7C,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,wBAAwB;YAE/C,wCAAwC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAE7C,qDAAqD;YACrD,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YACjC,CAAC;YAED,4DAA4D;YAC5D,MAAM,QAAQ,GAAG,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YAExC,8DAA8D;YAC9D,MAAM,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACzE,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,CAAC;YAED,sCAAsC;YACtC,MAAM,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAC1C,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YAEpC,wDAAwD;YACxD,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAC/B,CAAC;YAED,mDAAmD;YACnD,MAAM,SAAS,GAAG,GAAG,CAAC;YACtB,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;YAEvC,6DAA6D;YAC7D,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChB,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YAC7D,CAAC;QACF,CAAC;QAED,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,UAAU,CACjB,MAAkB,EAClB,KAAa,EACb,MAAc,EACd,IAAY,EACZ,CAAS;QAET,0CAA0C;QAC1C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACX,OAAO;QACR,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAEpC,mEAAmE;QACnE,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;YACrB,OAAO;QACR,CAAC;QAED,wDAAwD;QACxD,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAEnD,gEAAgE;QAChE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,OAAO,CAAC,MAAM,EAAE,WAAW,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAC/C,CAAC;IACF,CAAC;IAED;;;;;;;;;;OAUG;IACK,aAAa;QACpB,MAAM,KAAK,GAAG;YACb,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC;YAC7B,KAAK,CAAC,GAAG,CAAC,yBAAyB,CAAC;YACpC,QAAQ;YACR,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YACrE,QAAQ;YACR,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;gBAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,OAAO,OAAO,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC;YAClD,CAAC,CAAC;SACF,CAAC;QACF,OAAO,KAAK,CAAC;IACd,CAAC;CACD;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAS,YAAY,CAAC,OAAsB;IAC3C,uEAAuE;IACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QAClC,gDAAgD;QAChD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC3B,SAAS;QACV,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,KAAK,GAAkB,EAAE,CAAC;IAEhC,8CAA8C;IAC9C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;IACF,CAAC;IAED,iDAAiD;IACjD,iDAAiD;IACjD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAE,CAAC;QAC5B,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAEhD,4CAA4C;QAC5C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBAC3B,SAAS;YACV,CAAC;YAED,wDAAwD;YACxD,mDAAmD;YACnD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YACzE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YAEjC,kEAAkE;YAClE,MAAM,YAAY,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACtD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;YACpC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnE,IAAI,QAAQ,EAAE,CAAC;oBACd,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtB,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,oEAAoE;IACpE,iDAAiD;IACjD,IAAI,QAAQ,CAAC,IAAI,KAAK,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5C,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;QACvB,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBACjC,SAAS,IAAI,CAAC,CAAC;YAChB,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CACpB,KAAoB,EACpB,QAA6B;IAE7B,MAAM,MAAM,GAAoB,EAAE,CAAC;IAEnC,sCAAsC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;QACD,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,mEAAmE;IACnE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACvE,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,YAAY,CAAC,MAAc;IACnC,uEAAuE;IACvE,MAAM,YAAY,GAAG,MAAM;SACzB,KAAK,CAAC,OAAO,CAAC;SACd,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;SAC/C,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEpC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC;IACb,CAAC;IAED,IAAI,WAAW,GAAgB,IAAI,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,4CAA4C;IAE3D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QACjC,0CAA0C;QAC1C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5C,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC;YACpD,SAAS;QACV,CAAC;QAED,wDAAwD;QACxD,IAAI,iDAAiD,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClE,SAAS;QACV,CAAC;QAED,0DAA0D;QAC1D,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,SAAS,EAAE,CAAC;YACf,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACpE,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YAEvC,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,SAAS;YACV,CAAC;YAED,+CAA+C;YAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;YACpD,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAElD,qDAAqD;YACrD,UAAU,CACT,KAAK,EACL,IAAI,EACJ,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAC5C,KAAK,EAAE,CACP,CAAC;YACF,UAAU,CACT,KAAK,EACL,EAAE,EACF,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,EAC5C,KAAK,EAAE,CACP,CAAC;YAEF,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YAChC,SAAS;QACV,CAAC;QAED,gDAAgD;QAChD,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,KAAK,EAAE,CAAC;YACX,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QACnD,CAAC;IACF,CAAC;IAED,6CAA6C;IAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,kEAAkE;IAClE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACjD,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO;QACN,WAAW;QACX,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK;KACL,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,UAAU,CAClB,KAA+B,EAC/B,EAAU,EACV,KAAa,EACb,KAAa;IAEb,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACpB,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IACrC,CAAC;AACF,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAY;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;IACtD,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAiB,CAAC;IAC9C,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,aAAa,CAAC,IAAY;IAClC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YAChB,OAAO,KAAK,CAAC;QACd,CAAC;IACF,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,SAAS,CACjB,IAAY,EACZ,SAAiB;IAOjB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACpC,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAEnC,kDAAkD;IAClD,IAAI,KAAyB,CAAC;IAC9B,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACtC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YACjB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;YACvC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzC,CAAC;IACF,CAAC;IAED,qDAAqD;IACrD,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC3C,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,cAAc,CAAC,KAAa;IACpC,2DAA2D;IAC3D,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAChD,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAEhD,uCAAuC;IACvC,IAAI,CAAC,SAAS,EAAE,CAAC;QAChB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAC1B,CAAC;IAED,yCAAyC;IACzC,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CACjC,kDAAkD,CAClD,CAAC;IACF,IAAI,UAAU,EAAE,CAAC;QAChB,6CAA6C;QAC7C,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QACvE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;IAC5C,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,aAAa,CAAC,KAAa,EAAE,KAAa;IAClD,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,oCAAoC;IACpC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;AACxC,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,KAAa;IAC9C,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC;IACb,CAAC;IACD,MAAM,YAAY,GAAG,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,YAAY,GAAG,IAAI,CAAC;IAClC,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;AACzD,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,OAAO,CAAC,MAAkB,EAAE,CAAS,EAAE,CAAS,EAAE,IAAY;IACtE,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO;IACR,CAAC;IACD,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AACf,CAAC","sourcesContent":["/**\n * @fileoverview Mermaid Diagram ASCII Renderer\n *\n * This module provides a complete ASCII/Unicode rendering pipeline for Mermaid\n * graph diagrams in terminal environments. It parses Mermaid syntax and produces\n * a visual representation using box-drawing characters.\n *\n * ## Architecture Overview\n *\n * The rendering pipeline consists of three main phases:\n *\n * 1. **Parsing Phase** (parseMermaid):\n *    - Tokenizes Mermaid syntax into nodes and edges\n *    - Handles various connector types (arrows, dashed lines, etc.)\n *    - Extracts labels and edge annotations\n *\n * 2. **Layout Phase** (assignLayers, groupByLayer):\n *    - Uses a modified topological sort to assign vertical layers\n *    - Implements Kahn's algorithm for DAG processing\n *    - Handles cycles gracefully by placing remaining nodes at the bottom\n *\n * 3. **Rendering Phase** (MermaidAsciiRenderer):\n *    - Allocates a 2D character canvas\n *    - Draws boxes with Unicode box-drawing characters\n *    - Routes edges between nodes using L-shaped connectors\n *\n * ## Coordinate System\n *\n * The canvas uses a standard screen coordinate system:\n * - Origin (0,0) is at the top-left\n * - X increases rightward (columns)\n * - Y increases downward (rows)\n *\n * ## Caching Strategy\n *\n * Results are cached using a composite key of width and source to avoid\n * redundant parsing and rendering. This is essential for smooth scrolling\n * in terminal UIs where diagrams may be re-rendered frequently.\n */\nimport chalk from \"chalk\";\n\n/**\n * Mermaid edge connector tokens, ordered by specificity.\n *\n * The order matters because we use first-match semantics during parsing.\n * More specific/longer connectors must appear before shorter ones to prevent\n * partial matches (e.g., \"<-.-> \" must be checked before \"-->\").\n *\n * Connector types:\n * - Bidirectional: <-.->, <-->, <=>\n * - Reverse direction: <-- (arrow points left)\n * - Dashed: -.->\n * - Solid: -->, ---\n * - Thick: ==>, <=>\n * - Special endings: --x (cross), --o (circle)\n */\nconst CONNECTORS = [\n\t\"<-.->\",\n\t\"<-->\",\n\t\"<--\",\n\t\"<==>\",\n\t\"<=>\",\n\t\"-.->\",\n\t\"-->\",\n\t\"---\",\n\t\"==>\",\n\t\"--x\",\n\t\"--o\",\n\t\"-x->\",\n\t\"-o->\",\n];\n\n/**\n * Layout constants for the ASCII rendering.\n *\n * These values control the visual appearance and spacing of the diagram:\n *\n * MIN_BOX_WIDTH: Minimum width for a node box (ensures readability)\n * MAX_BOX_WIDTH: Maximum width to prevent overly wide boxes\n * BOX_HEIGHT: Fixed height of 3 lines (top border, label, bottom border)\n * H_SPACING: Horizontal gap between adjacent nodes in the same layer\n * V_SPACING: Vertical gap between layers (allows space for edge routing)\n * MAX_LABEL: Maximum label length before truncation with ellipsis\n */\nconst MIN_BOX_WIDTH = 6;\nconst MAX_BOX_WIDTH = 28;\nconst BOX_HEIGHT = 3;\nconst H_SPACING = 4;\nconst V_SPACING = 2;\nconst MAX_LABEL = 36;\n\n/**\n * Mermaid graph orientation types.\n *\n * Currently the renderer primarily handles TD/TB (top-down) layouts.\n * Other orientations are parsed but may not render optimally:\n * - TD/TB: Top to Bottom (default, fully supported)\n * - BT: Bottom to Top\n * - LR: Left to Right\n * - RL: Right to Left\n */\ntype Orientation = \"TD\" | \"TB\" | \"BT\" | \"LR\" | \"RL\";\n\n/**\n * Represents a node in the Mermaid graph.\n *\n * @property id - Unique identifier used for edge connections\n * @property label - Display text shown inside the node box\n * @property order - Parse order, used to maintain stable positioning\n */\ninterface MermaidNode {\n\tid: string;\n\tlabel: string;\n\torder: number;\n}\n\n/**\n * Represents a directed edge between two nodes.\n *\n * @property from - Source node ID\n * @property to - Target node ID\n * @property label - Optional edge annotation (displayed along the edge path)\n */\ninterface MermaidEdge {\n\tfrom: string;\n\tto: string;\n\tlabel?: string;\n}\n\n/**\n * Complete parsed representation of a Mermaid diagram.\n *\n * This intermediate representation decouples parsing from rendering,\n * allowing the same parsed structure to be rendered at different widths.\n */\ninterface ParsedMermaid {\n\torientation: Orientation;\n\tnodes: MermaidNode[];\n\tedges: MermaidEdge[];\n}\n\n/**\n * Global cache for rendered diagrams.\n *\n * Cache key format: `${width}:${source}`\n *\n * This cache is unbounded, which is acceptable because:\n * 1. In practice, only a few diagrams are active at any time\n * 2. Width changes are infrequent (usually only on terminal resize)\n * 3. The cache naturally clears on process restart\n *\n * For long-running processes with many unique diagrams, consider\n * implementing an LRU eviction policy.\n */\nconst diagramCache = new Map<string, string[] | null>();\n\n/**\n * Main entry point for rendering Mermaid diagrams to ASCII art.\n *\n * This function handles caching and orchestrates the parsing and rendering\n * pipeline. It returns null for diagrams that cannot be rendered (invalid\n * syntax, unsupported features, or insufficient width).\n *\n * @param source - Raw Mermaid diagram source code\n * @param width - Available terminal width in characters\n * @returns Array of rendered lines, or null if rendering fails\n *\n * @example\n * ```typescript\n * const lines = renderMermaidDiagram(`\n *   graph TD\n *   A[Start] --> B[Process]\n *   B --> C[End]\n * `, 80);\n * if (lines) {\n *   lines.forEach(line => console.log(line));\n * }\n * ```\n */\nexport function renderMermaidDiagram(\n\tsource: string,\n\twidth: number,\n): string[] | null {\n\t// Use composite cache key to handle width-dependent rendering\n\tconst cacheKey = `${width}:${source}`;\n\tif (diagramCache.has(cacheKey)) {\n\t\treturn diagramCache.get(cacheKey) ?? null;\n\t}\n\n\t// Parse the Mermaid source into an intermediate representation\n\tconst parsed = parseMermaid(source);\n\tif (!parsed) {\n\t\tdiagramCache.set(cacheKey, null);\n\t\treturn null;\n\t}\n\n\t// Render the parsed diagram to ASCII lines\n\tconst renderer = new MermaidAsciiRenderer(parsed, width);\n\tconst lines = renderer.render();\n\tdiagramCache.set(cacheKey, lines);\n\treturn lines;\n}\n\n/**\n * ASCII renderer for Mermaid diagrams.\n *\n * This class implements the core rendering logic, transforming a parsed\n * Mermaid diagram into an array of ANSI-styled terminal lines.\n *\n * ## Rendering Strategy\n *\n * 1. **Layer Assignment**: Nodes are assigned to horizontal layers based on\n *    their dependency depth (distance from source nodes)\n *\n * 2. **Box Sizing**: Box width is calculated to fit all labels while\n *    respecting terminal width constraints\n *\n * 3. **Canvas Allocation**: A 2D character array is created with dimensions\n *    based on layer count and maximum layer width\n *\n * 4. **Box Drawing**: Each node is rendered as a Unicode box at its\n *    calculated position\n *\n * 5. **Edge Routing**: Edges are drawn using L-shaped paths with arrowheads\n *\n * ## Fallback Mode\n *\n * If the diagram cannot be rendered graphically (e.g., too wide, contains\n * cycles, or uses unsupported features), a textual fallback is provided\n * listing nodes and edges.\n */\nclass MermaidAsciiRenderer {\n\tconstructor(\n\t\tprivate readonly diagram: ParsedMermaid,\n\t\tprivate width: number,\n\t) {}\n\n\t/**\n\t * Renders the diagram, falling back to text mode if graphical\n\t * rendering fails.\n\t *\n\t * @returns Array of styled terminal lines, or null if diagram is empty\n\t */\n\trender(): string[] | null {\n\t\tif (this.diagram.nodes.length === 0) {\n\t\t\treturn null;\n\t\t}\n\t\t// Attempt graphical layout first\n\t\tconst layout = this.buildLayout();\n\t\tif (layout) {\n\t\t\treturn layout;\n\t\t}\n\t\t// Fall back to textual summary for complex/unsupported diagrams\n\t\treturn this.buildFallback();\n\t}\n\n\t/**\n\t * Attempts to build a graphical ASCII layout of the diagram.\n\t *\n\t * This method orchestrates the full graphical rendering pipeline:\n\t * 1. Assign nodes to vertical layers using topological sort\n\t * 2. Calculate optimal box width for the terminal\n\t * 3. Create a character canvas and render boxes\n\t * 4. Draw connecting edges with arrowheads\n\t *\n\t * @returns Rendered lines if successful, null if layout is impossible\n\t */\n\tprivate buildLayout(): string[] | null {\n\t\t// Phase 1: Assign each node to a vertical layer using topological sort\n\t\t// This ensures parent nodes appear above their children\n\t\tconst layerMap = assignLayers(this.diagram);\n\t\tif (!layerMap) {\n\t\t\treturn null;\n\t\t}\n\n\t\t// Phase 2: Group nodes by their assigned layer for row-by-row rendering\n\t\tconst layers = groupByLayer(this.diagram.nodes, layerMap);\n\t\tconst maxLayerSize = Math.max(...layers.map((layer) => layer.length));\n\n\t\t// Phase 3: Calculate box width that fits all labels within terminal width\n\t\t// Returns null if boxes cannot fit even at minimum width\n\t\tconst boxWidth = this.computeBoxWidth(maxLayerSize);\n\t\tif (!boxWidth) {\n\t\t\treturn null;\n\t\t}\n\n\t\t// Phase 4: Calculate canvas dimensions\n\t\t// Width: boxes + horizontal spacing between them\n\t\t// Height: box rows + vertical spacing for edge routing\n\t\tconst diagramWidth =\n\t\t\tmaxLayerSize * boxWidth + Math.max(0, maxLayerSize - 1) * H_SPACING;\n\t\tconst verticalLayerCount = layers.length;\n\t\tconst canvasHeight =\n\t\t\tverticalLayerCount * BOX_HEIGHT +\n\t\t\tMath.max(0, verticalLayerCount - 1) * V_SPACING;\n\n\t\t// Phase 5: Create the 2D character canvas initialized with spaces\n\t\t// Each cell holds a single character that will be assembled into output lines\n\t\tconst canvas = Array.from({ length: canvasHeight }, () =>\n\t\t\tArray.from({ length: diagramWidth }, () => \" \"),\n\t\t);\n\n\t\t// Phase 6: Render boxes and track their positions for edge routing\n\t\t// nodePositions maps node ID -> top-left corner of its box\n\t\tconst nodePositions = new Map<string, { x: number; y: number }>();\n\t\tlayers.forEach((layer, layerIndex) => {\n\t\t\t// Calculate Y coordinate for this layer's row\n\t\t\tconst rowY = layerIndex * (BOX_HEIGHT + V_SPACING);\n\t\t\tlayer.forEach((node, nodeIndex) => {\n\t\t\t\t// Calculate X coordinate for this node's column\n\t\t\t\tconst boxX = nodeIndex * (boxWidth + H_SPACING);\n\t\t\t\tthis.drawBox(canvas, boxX, rowY, boxWidth, node.label);\n\t\t\t\tnodePositions.set(node.id, { x: boxX, y: rowY });\n\t\t\t});\n\t\t});\n\n\t\t// Phase 7: Draw edges connecting nodes with L-shaped paths\n\t\t// Collect warnings for edges that couldn't be drawn (missing nodes, cycles)\n\t\tconst edgeWarnings = this.drawEdges(canvas, nodePositions, boxWidth);\n\n\t\t// Phase 8: Assemble final output with title, canvas, and any warnings\n\t\tconst title = chalk.hex(\"#a855f7\")(\n\t\t\t`╭─ mermaid graph (${this.diagram.orientation}) ─╮`,\n\t\t);\n\t\tconst footer = chalk.hex(\"#a855f7\")(\"╰──────────────────────────────╯\");\n\t\tconst warningLines = edgeWarnings.length\n\t\t\t? edgeWarnings.map((warning) => chalk.dim(`[!] ${warning}`))\n\t\t\t: [];\n\n\t\treturn [\n\t\t\ttitle,\n\t\t\t...canvas.map((row) => row.join(\"\")),\n\t\t\tfooter,\n\t\t\t...warningLines,\n\t\t];\n\t}\n\n\t/**\n\t * Computes the optimal box width for the diagram.\n\t *\n\t * The algorithm balances several constraints:\n\t * 1. Boxes must be wide enough to fit labels (with some truncation allowed)\n\t * 2. All boxes in a row must fit within the terminal width\n\t * 3. There must be spacing between boxes for visual separation\n\t *\n\t * @param maxLayerSize - Maximum number of nodes in any single layer\n\t * @returns Optimal box width, or null if layout is impossible\n\t */\n\tprivate computeBoxWidth(maxLayerSize: number): number | null {\n\t\t// Find the longest label (capped at MAX_LABEL to prevent extreme widths)\n\t\tconst longestLabel = Math.min(\n\t\t\tMAX_LABEL,\n\t\t\tMath.max(...this.diagram.nodes.map((node) => node.label.length)),\n\t\t);\n\n\t\t// Natural width: label + 2 chars for box borders (│ on each side)\n\t\tconst naturalWidth = Math.max(MIN_BOX_WIDTH, longestLabel + 2);\n\n\t\t// Maximum width considering terminal constraints\n\t\tconst maxAllowedWidth = Math.min(MAX_BOX_WIDTH, this.width);\n\n\t\t// Calculate space needed for gaps between boxes\n\t\tconst spacingWidth = Math.max(0, maxLayerSize - 1) * H_SPACING;\n\n\t\t// Available width for boxes after subtracting spacing\n\t\tconst available = maxAllowedWidth - spacingWidth;\n\n\t\t// Width per box if distributed evenly\n\t\tconst perBox = Math.floor(available / maxLayerSize);\n\n\t\t// If boxes can't even fit at minimum width, graphical layout is impossible\n\t\tif (perBox < MIN_BOX_WIDTH) {\n\t\t\treturn null;\n\t\t}\n\n\t\t// Use the smaller of natural width and available per-box width\n\t\treturn Math.min(naturalWidth, perBox);\n\t}\n\n\t/**\n\t * Draws a single node box on the canvas.\n\t *\n\t * Box structure (3 lines):\n\t * ```\n\t * ┌────────┐  <- top border\n\t * │ Label  │  <- label (centered, may be truncated)\n\t * └────────┘  <- bottom border\n\t * ```\n\t *\n\t * @param canvas - 2D character array to draw on\n\t * @param x - Left edge X coordinate\n\t * @param y - Top edge Y coordinate\n\t * @param boxWidth - Total box width including borders\n\t * @param label - Text to display inside the box\n\t */\n\tprivate drawBox(\n\t\tcanvas: string[][],\n\t\tx: number,\n\t\ty: number,\n\t\tboxWidth: number,\n\t\tlabel: string,\n\t): void {\n\t\t// Inner width is box width minus the two border characters\n\t\tconst innerWidth = boxWidth - 2;\n\n\t\t// Truncate label if needed and center it within the inner width\n\t\tconst truncated = truncateLabel(label, innerWidth);\n\t\tconst paddedLabel = centerText(truncated, innerWidth);\n\n\t\t// Build the three lines of the box using Unicode box-drawing chars\n\t\tconst top = `┌${\"─\".repeat(innerWidth)}┐`;\n\t\tconst mid = `│${paddedLabel}│`;\n\t\tconst bottom = `└${\"─\".repeat(innerWidth)}┘`;\n\n\t\t// Write each line to the canvas, character by character\n\t\t[top, mid, bottom].forEach((line, offset) => {\n\t\t\tconst row = canvas[y + offset];\n\t\t\tif (!row) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfor (let i = 0; i < boxWidth; i++) {\n\t\t\t\trow[x + i] = line[i]!;\n\t\t\t}\n\t\t});\n\t}\n\n\t/**\n\t * Draws edges between nodes using L-shaped routing.\n\t *\n\t * Edge routing strategy:\n\t * 1. Exit from bottom center of source box\n\t * 2. Go down to midpoint between layers\n\t * 3. Turn horizontally toward target\n\t * 4. Go to position above target\n\t * 5. Turn down and draw arrowhead\n\t *\n\t * Visual example:\n\t * ```\n\t * ┌──────┐\n\t * │Source│\n\t * └──────┘\n\t *     │      <- vertical segment from source\n\t *     └────┐ <- L-turn at midpoint\n\t *          │ <- vertical segment to target\n\t *          ▼ <- arrowhead\n\t * ┌────────┐\n\t * │ Target │\n\t * └────────┘\n\t * ```\n\t *\n\t * @param canvas - 2D character array to draw on\n\t * @param nodePositions - Map of node ID to box top-left coordinates\n\t * @param boxWidth - Width of each box (for center calculation)\n\t * @returns Array of warning messages for edges that couldn't be drawn\n\t */\n\tprivate drawEdges(\n\t\tcanvas: string[][],\n\t\tnodePositions: Map<string, { x: number; y: number }>,\n\t\tboxWidth: number,\n\t): string[] {\n\t\tconst warnings: string[] = [];\n\n\t\tfor (const edge of this.diagram.edges) {\n\t\t\tconst from = nodePositions.get(edge.from);\n\t\t\tconst to = nodePositions.get(edge.to);\n\n\t\t\t// Skip edges with missing endpoints (shouldn't happen with valid input)\n\t\t\tif (!from || !to) {\n\t\t\t\twarnings.push(`Skipped edge ${edge.from} -> ${edge.to} (node missing)`);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Only draw forward (downward) edges; back-edges would create visual clutter\n\t\t\tif (to.y <= from.y) {\n\t\t\t\twarnings.push(\n\t\t\t\t\t`Skipped edge ${edge.from} -> ${edge.to} (non-forward edge not drawn)`,\n\t\t\t\t);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Calculate edge endpoints at center of boxes\n\t\t\tconst startX = from.x + Math.floor(boxWidth / 2);\n\t\t\tconst startY = from.y + BOX_HEIGHT; // Just below source box\n\t\t\tconst endX = to.x + Math.floor(boxWidth / 2);\n\t\t\tconst endY = to.y - 1; // Just above target box\n\n\t\t\t// Midpoint Y for the horizontal segment\n\t\t\tconst midY = Math.floor((startY + endY) / 2);\n\n\t\t\t// Draw vertical segment from source down to midpoint\n\t\t\tfor (let y = startY; y < midY; y++) {\n\t\t\t\tsetChar(canvas, startX, y, \"│\");\n\t\t\t}\n\n\t\t\t// Draw the L-turn at midpoint (corner depends on direction)\n\t\t\tconst turnChar = startX <= endX ? \"└\" : \"┘\";\n\t\t\tsetChar(canvas, startX, midY, turnChar);\n\n\t\t\t// Draw horizontal segment from source column to target column\n\t\t\tconst step = startX <= endX ? 1 : -1;\n\t\t\tfor (let x = startX + step; step === 1 ? x < endX : x > endX; x += step) {\n\t\t\t\tsetChar(canvas, x, midY, \"─\");\n\t\t\t}\n\n\t\t\t// Draw the second L-turn above target\n\t\t\tconst corner = startX <= endX ? \"┐\" : \"┌\";\n\t\t\tsetChar(canvas, endX, midY, corner);\n\n\t\t\t// Draw vertical segment from midpoint down to arrowhead\n\t\t\tfor (let y = midY + 1; y < endY; y++) {\n\t\t\t\tsetChar(canvas, endX, y, \"│\");\n\t\t\t}\n\n\t\t\t// Draw the arrowhead pointing down into target box\n\t\t\tconst arrowHead = \"▼\";\n\t\t\tsetChar(canvas, endX, endY, arrowHead);\n\n\t\t\t// If edge has a label, write it along the horizontal segment\n\t\t\tif (edge.label) {\n\t\t\t\tthis.writeLabel(canvas, edge.label, startX, endX, midY - 1);\n\t\t\t}\n\t\t}\n\n\t\treturn warnings;\n\t}\n\n\t/**\n\t * Writes an edge label above the horizontal edge segment.\n\t *\n\t * Labels are placed on the line above the horizontal segment to avoid\n\t * overwriting the edge itself. If there isn't enough horizontal space\n\t * for the label, it's truncated.\n\t *\n\t * @param canvas - 2D character array to draw on\n\t * @param label - Edge annotation text\n\t * @param startX - X coordinate of edge start\n\t * @param endX - X coordinate of edge end\n\t * @param y - Y coordinate for label (one above the horizontal segment)\n\t */\n\tprivate writeLabel(\n\t\tcanvas: string[][],\n\t\tlabel: string,\n\t\tstartX: number,\n\t\tendX: number,\n\t\ty: number,\n\t): void {\n\t\t// Skip if label would be above the canvas\n\t\tif (y < 0) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst minX = Math.min(startX, endX);\n\t\tconst maxX = Math.max(startX, endX);\n\n\t\t// Need at least 4 chars of horizontal space for a meaningful label\n\t\tif (maxX - minX < 4) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Truncate label to fit available space (minus margins)\n\t\tconst text = truncateLabel(label, maxX - minX - 2);\n\n\t\t// Write label characters starting after the first edge position\n\t\tconst offsetStart = minX + 1;\n\t\tfor (let i = 0; i < text.length; i++) {\n\t\t\tsetChar(canvas, offsetStart + i, y, text[i]!);\n\t\t}\n\t}\n\n\t/**\n\t * Generates a text-only fallback when graphical rendering fails.\n\t *\n\t * This is used when:\n\t * - The diagram is too wide for the terminal\n\t * - The graph contains cycles\n\t * - Layout calculation fails for other reasons\n\t *\n\t * The fallback provides a structured list of nodes and edges,\n\t * ensuring the diagram content is still accessible.\n\t */\n\tprivate buildFallback(): string[] {\n\t\tconst lines = [\n\t\t\tchalk.bold(\"Mermaid diagram\"),\n\t\t\tchalk.dim(\"(using textual summary)\"),\n\t\t\t\"Nodes:\",\n\t\t\t...this.diagram.nodes.map((node) => `  • ${node.id} – ${node.label}`),\n\t\t\t\"Edges:\",\n\t\t\t...this.diagram.edges.map((edge) => {\n\t\t\t\tconst label = edge.label ? ` [${edge.label}]` : \"\";\n\t\t\t\treturn `  • ${edge.from} ──▶ ${edge.to}${label}`;\n\t\t\t}),\n\t\t];\n\t\treturn lines;\n\t}\n}\n\n/**\n * Assigns nodes to vertical layers using Kahn's algorithm for topological sort.\n *\n * ## Algorithm Overview\n *\n * This is a modified topological sort that assigns layer numbers instead of\n * producing a linear ordering. The layer number represents the longest path\n * from any source node to this node.\n *\n * 1. **Initialize**: Count incoming edges (in-degree) for each node\n * 2. **Seed**: Start with nodes that have no incoming edges (sources)\n * 3. **Process**: For each node, update its children's layers to be at least\n *    one greater than the current node's layer\n * 4. **Handle Cycles**: Any nodes not reached are placed in additional layers\n *\n * ## Complexity\n *\n * - Time: O(V + E) where V = nodes, E = edges\n * - Space: O(V) for the in-degree and layer maps\n *\n * @param diagram - Parsed Mermaid diagram with nodes and edges\n * @returns Map from node ID to layer number, or null on failure\n */\nfunction assignLayers(diagram: ParsedMermaid): Map<string, number> | null {\n\t// Step 1: Calculate in-degree (number of incoming edges) for each node\n\tconst indegree = new Map<string, number>();\n\tfor (const node of diagram.nodes) {\n\t\tindegree.set(node.id, 0);\n\t}\n\tfor (const edge of diagram.edges) {\n\t\t// Skip self-loops as they don't affect layering\n\t\tif (edge.from === edge.to) {\n\t\t\tcontinue;\n\t\t}\n\t\tindegree.set(edge.to, (indegree.get(edge.to) ?? 0) + 1);\n\t}\n\n\t// Step 2: Initialize layer assignments and processing queue\n\tconst layerMap = new Map<string, number>();\n\tconst queue: MermaidNode[] = [];\n\n\t// Source nodes (in-degree 0) start at layer 0\n\tfor (const node of diagram.nodes) {\n\t\tif ((indegree.get(node.id) ?? 0) === 0) {\n\t\t\tqueue.push(node);\n\t\t\tif (!layerMap.has(node.id)) {\n\t\t\t\tlayerMap.set(node.id, 0);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 3: Process queue using BFS-like traversal\n\t// Use cursor instead of shift() for O(1) dequeue\n\tlet cursor = 0;\n\twhile (cursor < queue.length) {\n\t\tconst node = queue[cursor]!;\n\t\tcursor += 1;\n\t\tconst currentLayer = layerMap.get(node.id) ?? 0;\n\n\t\t// Process all outgoing edges from this node\n\t\tfor (const edge of diagram.edges) {\n\t\t\tif (edge.from !== node.id) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Child's layer must be at least one more than parent's\n\t\t\t// Use max to handle diamond dependencies correctly\n\t\t\tconst nextLayer = Math.max(currentLayer + 1, layerMap.get(edge.to) ?? 0);\n\t\t\tlayerMap.set(edge.to, nextLayer);\n\n\t\t\t// Decrement in-degree and add to queue when all parents processed\n\t\t\tconst nextIndegree = (indegree.get(edge.to) ?? 1) - 1;\n\t\t\tindegree.set(edge.to, nextIndegree);\n\t\t\tif (nextIndegree === 0) {\n\t\t\t\tconst nextNode = diagram.nodes.find((item) => item.id === edge.to);\n\t\t\t\tif (nextNode) {\n\t\t\t\t\tqueue.push(nextNode);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Step 4: Handle nodes not reached (part of cycles or disconnected)\n\t// Place them in layers after all reachable nodes\n\tif (layerMap.size !== diagram.nodes.length) {\n\t\tlet maxLayerValue = -1;\n\t\tfor (const value of layerMap.values()) {\n\t\t\tmaxLayerValue = Math.max(maxLayerValue, value);\n\t\t}\n\t\tlet nextLayer = Math.max(0, maxLayerValue + 1);\n\t\tfor (const node of diagram.nodes) {\n\t\t\tif (!layerMap.has(node.id)) {\n\t\t\t\tlayerMap.set(node.id, nextLayer);\n\t\t\t\tnextLayer += 1;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn layerMap;\n}\n\n/**\n * Groups nodes into arrays by their layer assignment.\n *\n * @param nodes - All nodes in the diagram\n * @param layerMap - Map from node ID to layer number\n * @returns 2D array where index is layer number, value is nodes in that layer\n */\nfunction groupByLayer(\n\tnodes: MermaidNode[],\n\tlayerMap: Map<string, number>,\n): MermaidNode[][] {\n\tconst layers: MermaidNode[][] = [];\n\n\t// Distribute nodes into layer buckets\n\tfor (const node of nodes) {\n\t\tconst layer = layerMap.get(node.id) ?? 0;\n\t\tif (!layers[layer]) {\n\t\t\tlayers[layer] = [];\n\t\t}\n\t\tlayers[layer].push(node);\n\t}\n\n\t// Sort nodes within each layer by parse order for stable rendering\n\treturn layers.map((layer) => layer.sort((a, b) => a.order - b.order));\n}\n\n/**\n * Parses Mermaid graph syntax into an intermediate representation.\n *\n * ## Supported Syntax\n *\n * - Graph declaration: `graph TD`, `graph LR`, etc.\n * - Node declarations: `A[Label]`, `B(Label)`, `C{Label}`, `D((Label))`\n * - Edge declarations: `A --> B`, `A -.-> B`, `A ==> B`\n * - Edge labels: `A -->|label| B`\n * - Comments: `%% comment text`\n *\n * ## Limitations\n *\n * - Subgraphs are recognized but flattened (nodes extracted, grouping ignored)\n * - Style definitions are skipped\n * - Click handlers are skipped\n *\n * @param source - Raw Mermaid diagram source\n * @returns Parsed diagram or null if parsing fails\n */\nfunction parseMermaid(source: string): ParsedMermaid | null {\n\t// Preprocess: split lines, remove comments (%%...), and filter empties\n\tconst cleanedLines = source\n\t\t.split(/\\r?\\n/)\n\t\t.map((line) => line.replace(/%%.*$/, \"\").trim())\n\t\t.filter((line) => line.length > 0);\n\n\tif (cleanedLines.length === 0) {\n\t\treturn null;\n\t}\n\n\tlet orientation: Orientation = \"TD\";\n\tconst nodes = new Map<string, MermaidNode>();\n\tconst edges: MermaidEdge[] = [];\n\tlet order = 0; // Tracks parse order for stable positioning\n\n\tfor (const line of cleanedLines) {\n\t\t// Parse graph declaration for orientation\n\t\tif (line.toLowerCase().startsWith(\"graph\")) {\n\t\t\torientation = parseOrientation(line) ?? orientation;\n\t\t\tcontinue;\n\t\t}\n\n\t\t// Skip unsupported directives (subgraphs, styles, etc.)\n\t\tif (/^(subgraph|end|classDef|style|linkStyle|click)/i.test(line)) {\n\t\t\tcontinue;\n\t\t}\n\n\t\t// Try to parse as an edge (contains a connector like -->)\n\t\tconst connector = findConnector(line);\n\t\tif (connector) {\n\t\t\tconst { left, right, label, reversed } = splitEdge(line, connector);\n\t\t\tconst startToken = parseNodeToken(left);\n\t\t\tconst endToken = parseNodeToken(right);\n\n\t\t\tif (!startToken || !endToken) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Handle reversed edges (arrows pointing left)\n\t\t\tconst from = reversed ? endToken.id : startToken.id;\n\t\t\tconst to = reversed ? startToken.id : endToken.id;\n\n\t\t\t// Register both nodes (idempotent if already exists)\n\t\t\tensureNode(\n\t\t\t\tnodes,\n\t\t\t\tfrom,\n\t\t\t\treversed ? endToken.label : startToken.label,\n\t\t\t\torder++,\n\t\t\t);\n\t\t\tensureNode(\n\t\t\t\tnodes,\n\t\t\t\tto,\n\t\t\t\treversed ? startToken.label : endToken.label,\n\t\t\t\torder++,\n\t\t\t);\n\n\t\t\tedges.push({ from, to, label });\n\t\t\tcontinue;\n\t\t}\n\n\t\t// Try to parse as a standalone node declaration\n\t\tconst token = parseNodeToken(line);\n\t\tif (token) {\n\t\t\tensureNode(nodes, token.id, token.label, order++);\n\t\t}\n\t}\n\n\t// Require at least some content to be parsed\n\tif (!nodes.size && !edges.length) {\n\t\treturn null;\n\t}\n\n\t// Ensure nodes referenced by edges exist (handles implicit nodes)\n\tfor (const edge of edges) {\n\t\tensureNode(nodes, edge.from, edge.from, order++);\n\t\tensureNode(nodes, edge.to, edge.to, order++);\n\t}\n\n\treturn {\n\t\torientation,\n\t\tnodes: Array.from(nodes.values()),\n\t\tedges,\n\t};\n}\n\n/**\n * Registers a node if it doesn't already exist.\n *\n * This function is idempotent - calling it multiple times with the same ID\n * will not overwrite the existing node. This allows edges to reference\n * nodes before they're explicitly declared.\n *\n * @param nodes - Map to store nodes\n * @param id - Unique node identifier\n * @param label - Display label for the node\n * @param order - Parse order for stable positioning\n */\nfunction ensureNode(\n\tnodes: Map<string, MermaidNode>,\n\tid: string,\n\tlabel: string,\n\torder: number,\n): void {\n\tif (!nodes.has(id)) {\n\t\tnodes.set(id, { id, label, order });\n\t}\n}\n\n/**\n * Extracts graph orientation from a graph declaration line.\n *\n * @param line - Line containing \"graph XX\" declaration\n * @returns Orientation enum value, or null if not found\n */\nfunction parseOrientation(line: string): Orientation | null {\n\tconst match = line.match(/graph\\s+(TD|TB|BT|LR|RL)/i);\n\tif (match?.[1]) {\n\t\treturn match[1].toUpperCase() as Orientation;\n\t}\n\treturn null;\n}\n\n/**\n * Finds the first edge connector token in a line.\n *\n * Uses first-match semantics with the CONNECTORS array ordered by\n * specificity to handle overlapping patterns correctly.\n *\n * @param line - Line to search for connectors\n * @returns Connector string if found, null otherwise\n */\nfunction findConnector(line: string): string | null {\n\tfor (const token of CONNECTORS) {\n\t\tconst index = line.indexOf(token);\n\t\tif (index >= 0) {\n\t\t\treturn token;\n\t\t}\n\t}\n\treturn null;\n}\n\n/**\n * Splits an edge declaration into its components.\n *\n * Handles edge labels in the format: `A -->|label| B`\n * Also detects reversed edges (arrows pointing left like `<--`)\n *\n * @param line - Full edge declaration line\n * @param connector - The connector token found in the line\n * @returns Object with left node, right node, optional label, and reversal flag\n */\nfunction splitEdge(\n\tline: string,\n\tconnector: string,\n): {\n\tleft: string;\n\tright: string;\n\tlabel?: string;\n\treversed: boolean;\n} {\n\tconst parts = line.split(connector);\n\tconst left = parts[0]?.trim() ?? \"\";\n\tlet right = parts[1]?.trim() ?? \"\";\n\n\t// Extract edge label if present (format: |label|)\n\tlet label: string | undefined;\n\tif (right.startsWith(\"|\")) {\n\t\tconst closing = right.indexOf(\"|\", 1);\n\t\tif (closing > 1) {\n\t\t\tlabel = right.slice(1, closing).trim();\n\t\t\tright = right.slice(closing + 1).trim();\n\t\t}\n\t}\n\n\t// Arrows starting with < indicate reversed direction\n\tconst reversed = connector.startsWith(\"<\");\n\treturn { left, right, label, reversed };\n}\n\n/**\n * Parses a node token to extract ID and label.\n *\n * Supports multiple node shapes:\n * - `A[label]` - Rectangle\n * - `B(label)` - Rounded rectangle (stadium)\n * - `C{label}` - Diamond (decision)\n * - `D((label))` - Circle\n *\n * If no label is specified, the ID is used as the label.\n *\n * @param token - Node declaration token\n * @returns Object with id and label, or null if invalid\n */\nfunction parseNodeToken(token: string): { id: string; label: string } | null {\n\t// Node ID must start with alphanumeric and can contain _:-\n\tconst idMatch = token.match(/^[A-Za-z0-9_:-]+/);\n\tif (!idMatch) {\n\t\treturn null;\n\t}\n\n\tconst id = idMatch[0];\n\tconst remainder = token.slice(id.length).trim();\n\n\t// No label specified - use ID as label\n\tif (!remainder) {\n\t\treturn { id, label: id };\n\t}\n\n\t// Match various bracket types for labels\n\tconst labelMatch = remainder.match(\n\t\t/^(?:\\[(.+?)\\]|\\((.+?)\\)|\\{(.+?)\\}|\\(\\((.+?)\\)\\))/,\n\t);\n\tif (labelMatch) {\n\t\t// Find the first non-undefined capture group\n\t\tconst label = labelMatch.slice(1).find((value) => value !== undefined);\n\t\treturn { id, label: (label ?? id).trim() };\n\t}\n\n\treturn { id, label: id };\n}\n\n/**\n * Truncates a label to fit within a given width.\n *\n * If truncation is needed, an ellipsis (…) is appended.\n * The result is padded with spaces to exactly fill the width.\n *\n * @param label - Text to truncate\n * @param width - Maximum width in characters\n * @returns Label padded or truncated to exact width\n */\nfunction truncateLabel(label: string, width: number): string {\n\tif (label.length <= width) {\n\t\treturn label.padEnd(width, \" \");\n\t}\n\tif (width <= 1) {\n\t\treturn label.slice(0, width);\n\t}\n\t// Leave room for ellipsis character\n\treturn `${label.slice(0, width - 1)}…`;\n}\n\n/**\n * Centers text within a given width using space padding.\n *\n * If the text is longer than the width, it's returned unchanged.\n * Extra padding is distributed evenly, with remainder on the right.\n *\n * @param text - Text to center\n * @param width - Total width to center within\n * @returns Centered text with space padding\n */\nfunction centerText(text: string, width: number): string {\n\tif (text.length >= width) {\n\t\treturn text;\n\t}\n\tconst totalPadding = width - text.length;\n\tconst left = Math.floor(totalPadding / 2);\n\tconst right = totalPadding - left;\n\treturn `${\" \".repeat(left)}${text}${\" \".repeat(right)}`;\n}\n\n/**\n * Safely sets a character on the canvas with bounds checking.\n *\n * This function silently ignores out-of-bounds writes, which is useful\n * for edge drawing where paths may extend beyond the visible area.\n *\n * @param canvas - 2D character array\n * @param x - Column index\n * @param y - Row index\n * @param char - Character to write\n */\nfunction setChar(canvas: string[][], x: number, y: number, char: string): void {\n\tconst row = canvas[y];\n\tif (!row || !row[x]) {\n\t\treturn;\n\t}\n\trow[x] = char;\n}\n"]}

package/dist/node_modules/@evalops/tui/dist/style/code-highlighter.d.ts

@@ -1,40 +0,0 @@
-/**
- * Highlights a multi-line code block.
- *
- * This is the main entry point for syntax highlighting. It:
- * 1. Selects the appropriate painter based on language
- * 2. Normalizes tabs to 2 spaces
- * 3. Applies highlighting line-by-line
- *
- * @param text - Code block content
- * @param language - Optional language identifier
- * @returns Array of ANSI-styled lines
- *
- * @example
- * ```typescript
- * const lines = highlightCodeLines(
- *   'const x = 42;\nconsole.log(x);',
- *   'typescript'
- * );
- * lines.forEach(line => console.log(line));
- * ```
- */
-export declare function highlightCodeLines(text: string, language?: string): string[];
-/**
- * Highlights inline code (single backticks in markdown).
- *
- * Uses a dark background with yellow text for visibility.
- * Newlines are converted to spaces since inline code should
- * remain on a single line.
- *
- * @param text - Inline code content
- * @returns ANSI-styled string
- *
- * @example
- * ```typescript
- * const styled = highlightInlineCode('foo.bar()');
- * console.log(`Use ${styled} to call the method`);
- * ```
- */
-export declare function highlightInlineCode(text: string): string;
-//# sourceMappingURL=code-highlighter.d.ts.map

package/dist/node_modules/@evalops/tui/dist/style/code-highlighter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"code-highlighter.d.ts","sourceRoot":"","sources":["../../src/style/code-highlighter.ts"],"names":[],"mappings":"AAkgBA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAM5E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAMxD"}

package/dist/node_modules/@evalops/tui/dist/style/code-highlighter.js

@@ -1,474 +0,0 @@
-/**
- * @fileoverview Lightweight Syntax Highlighting for Terminal Display
- *
- * This module provides fast, regex-based syntax highlighting for code blocks
- * in terminal output. Unlike full parsers (tree-sitter, etc.), this uses
- * simple pattern matching that's fast enough for real-time rendering.
- *
- * ## Supported Languages
- *
- * - **JSON/JSONC**: Keys, values, strings, numbers, booleans
- * - **Shell**: Commands, flags, comments
- * - **Diff**: Added (+), removed (-), and meta (@@) lines
- * - **JavaScript/TypeScript**: Keywords, strings, numbers, comments
- * - **Python**: Keywords, strings (including triple-quoted), comments
- * - **SQL**: Keywords (uppercase), strings, numbers
- * - **YAML**: Keys, values, strings, booleans
- *
- * ## Design Philosophy
- *
- * 1. **Speed over Accuracy**: Good-enough highlighting that's fast
- * 2. **No Dependencies**: Uses only chalk for ANSI colors
- * 3. **Line-at-a-time**: Each line is processed independently
- * 4. **Graceful Degradation**: Unknown languages get default styling
- *
- * ## Color Palette
- *
- * The colors are chosen for readability on dark terminal backgrounds:
- * - Keywords: Pink (#f472b6)
- * - Strings: Light pink (#f9a8d4)
- * - Numbers: Yellow (#fcd34d)
- * - Comments: Slate (#94a3b8)
- * - Default: Light gray (#e2e8f0)
- */
-import chalk from "chalk";
-/**
- * JavaScript/TypeScript reserved keywords.
- * These are highlighted in pink when encountered as whole words.
- */
-const JS_KEYWORDS = new Set([
-    "break",
-    "case",
-    "catch",
-    "class",
-    "const",
-    "continue",
-    "debugger",
-    "default",
-    "delete",
-    "do",
-    "else",
-    "enum",
-    "export",
-    "extends",
-    "finally",
-    "for",
-    "from",
-    "function",
-    "if",
-    "import",
-    "in",
-    "instanceof",
-    "let",
-    "new",
-    "return",
-    "switch",
-    "this",
-    "throw",
-    "try",
-    "typeof",
-    "var",
-    "void",
-    "while",
-    "with",
-    "yield",
-    "async",
-    "await",
-]);
-/**
- * Python reserved keywords.
- */
-const PY_KEYWORDS = new Set([
-    "def",
-    "class",
-    "import",
-    "from",
-    "return",
-    "if",
-    "elif",
-    "else",
-    "for",
-    "while",
-    "try",
-    "except",
-    "finally",
-    "with",
-    "as",
-    "pass",
-    "continue",
-    "break",
-    "yield",
-    "lambda",
-    "async",
-    "await",
-]);
-/**
- * SQL reserved keywords (matched case-insensitively).
- * These are uppercased when displayed for conventional SQL formatting.
- */
-const SQL_KEYWORDS = new Set([
-    "select",
-    "from",
-    "where",
-    "group",
-    "by",
-    "order",
-    "insert",
-    "into",
-    "values",
-    "update",
-    "set",
-    "delete",
-    "join",
-    "left",
-    "right",
-    "inner",
-    "outer",
-    "on",
-    "limit",
-    "offset",
-    "create",
-    "table",
-    "primary",
-    "key",
-    "unique",
-]);
-// ────────────────────────────────────────────────────────────────────────────
-// COLOR PALETTE
-// These colors are optimized for dark terminal backgrounds
-// ────────────────────────────────────────────────────────────────────────────
-/** Default code color (light gray) */
-const DEFAULT_CODE_COLOR = chalk.hex("#e2e8f0");
-/** Comment color (muted slate) */
-const COMMENT_COLOR = chalk.hex("#94a3b8");
-/** Keyword color (pink) */
-const KEYWORD_COLOR = chalk.hex("#f472b6");
-/** Number literal color (yellow) */
-const NUMBER_COLOR = chalk.hex("#fcd34d");
-/** String literal color (light pink) */
-const STRING_COLOR = chalk.hex("#f9a8d4");
-/** Diff: added lines (green) */
-const DIFF_ADD = chalk.hex("#4ade80");
-/** Diff: removed lines (red) */
-const DIFF_REMOVE = chalk.hex("#f87171");
-/** Diff: meta lines like @@ (blue) */
-const DIFF_META = chalk.hex("#38bdf8");
-/** Shell: command name (bold blue) */
-const SHELL_CMD = chalk.hex("#93c5fd").bold;
-/** Shell: flags and options (yellow) */
-const SHELL_FLAG = chalk.hex("#fcd34d");
-// ────────────────────────────────────────────────────────────────────────────
-// LANGUAGE DETECTION
-// Maps language identifiers to painter groups
-// ────────────────────────────────────────────────────────────────────────────
-const JSON_LANGS = new Set(["json", "jsonc"]);
-const SHELL_LANGS = new Set([
-    "bash",
-    "sh",
-    "shell",
-    "zsh",
-    "powershell",
-    "pwsh",
-]);
-const DIFF_LANGS = new Set(["diff", "patch"]);
-const JS_LANGS = new Set([
-    "js",
-    "jsx",
-    "ts",
-    "tsx",
-    "javascript",
-    "typescript",
-]);
-const PY_LANGS = new Set(["py", "python"]);
-const SQL_LANGS = new Set(["sql"]);
-const YAML_LANGS = new Set(["yaml", "yml"]);
-// ────────────────────────────────────────────────────────────────────────────
-// UTILITY FUNCTIONS
-// ────────────────────────────────────────────────────────────────────────────
-/**
- * Separates leading whitespace from the rest of the line.
- * This allows us to preserve indentation while styling the code.
- *
- * @param line - Input line
- * @returns Object with indent (whitespace) and body (rest of line)
- */
-function stripIndent(line) {
-    const match = line.match(/^\s*/);
-    const indent = match ? match[0] : "";
-    return { indent, body: line.slice(indent.length) };
-}
-// ────────────────────────────────────────────────────────────────────────────
-// LANGUAGE-SPECIFIC PAINTERS
-// Each painter handles one language or family of languages
-// ────────────────────────────────────────────────────────────────────────────
-/**
- * Default painter: applies base code color to the entire line.
- */
-function paintDefault(line) {
-    if (!line)
-        return "";
-    return DEFAULT_CODE_COLOR(line);
-}
-/**
- * JSON painter: highlights keys, string values, numbers, and booleans.
- *
- * Pattern matching:
- * - Keys: `"key":` → cyan key
- * - String values: `: "value"` → pink value
- * - Number values: `: 123` → yellow number
- * - Booleans/null: `true`, `false`, `null` → green
- */
-function paintJson(line) {
-    const { indent, body } = stripIndent(line);
-    let result = body;
-    // Match JSON keys (strings followed by colon)
-    result = result.replace(/"([^"]*)"(?=\s*:)/g, (_match, key) => chalk.hex("#7dd3fc")(`"${key}"`));
-    // Match string values after colon
-    result = result.replace(/:\s*("[^"]*")/g, (_m, value) => `: ${STRING_COLOR(value)}`);
-    // Match numeric values after colon
-    result = result.replace(/:\s*(-?\d+(?:\.\d+)?)/g, (_m, value) => `: ${NUMBER_COLOR(value)}`);
-    // Match boolean and null literals
-    result = result.replace(/\b(true|false|null)\b/g, (_m, val) => chalk.hex("#34d399")(val));
-    return indent + result;
-}
-/**
- * Shell painter: highlights commands, flags, and comments.
- *
- * Recognizes:
- * - Comments: lines starting with #
- * - Commands: first word (bold blue)
- * - Long flags: --flag-name (yellow)
- * - Short flags: -f (yellow)
- */
-function paintShell(line) {
-    const { indent, body } = stripIndent(line);
-    const trimmed = body.trim();
-    if (!trimmed)
-        return indent;
-    // Shell comments
-    if (trimmed.startsWith("#")) {
-        return indent + COMMENT_COLOR(trimmed);
-    }
-    // Split into command and arguments
-    const parts = trimmed.split(/\s+/);
-    const [command, ...rest] = parts;
-    // Highlight flags in the arguments
-    let restJoined = rest.join(" ");
-    restJoined = restJoined.replace(/(--[\w-]+)/g, (_m, flag) => SHELL_FLAG(flag));
-    restJoined = restJoined.replace(/\b(-[\w])\b/g, (_m, flag) => SHELL_FLAG(flag));
-    return indent + SHELL_CMD(command) + (restJoined ? ` ${restJoined}` : "");
-}
-/**
- * Diff painter: colors based on line prefix.
- *
- * Conventions:
- * - `+++`/`---`: File headers (blue)
- * - `@@`: Hunk headers (blue)
- * - `+`: Added lines (green)
- * - `-`: Removed lines (red)
- * - Everything else: default color
- */
-function paintDiff(line) {
-    if (line.startsWith("+++") || line.startsWith("---")) {
-        return DIFF_META(line);
-    }
-    if (line.startsWith("@@")) {
-        return DIFF_META(line);
-    }
-    if (line.startsWith("+")) {
-        return DIFF_ADD(line);
-    }
-    if (line.startsWith("-")) {
-        return DIFF_REMOVE(line);
-    }
-    return DEFAULT_CODE_COLOR(line);
-}
-/**
- * Generic keyword-based painter for C-like languages.
- *
- * Handles:
- * - // style comments
- * - String literals (", ', `)
- * - Number literals
- * - Keywords from the provided set
- *
- * @param line - Input line
- * @param keywords - Set of language keywords to highlight
- */
-function paintKeywordLine(line, keywords) {
-    const { indent, body } = stripIndent(line);
-    if (!body)
-        return indent;
-    // Split code from trailing comment
-    const commentIndex = body.indexOf("//");
-    let code = commentIndex >= 0 ? body.slice(0, commentIndex) : body;
-    const comment = commentIndex >= 0 ? body.slice(commentIndex) : "";
-    // Highlight numbers
-    code = code.replace(/\b(\d+(?:\.\d+)?)\b/g, (_m, value) => NUMBER_COLOR(value));
-    // Highlight keywords
-    code = code.replace(/\b([A-Za-z_][\w]*)\b/g, (_m, word) => keywords.has(word) ? KEYWORD_COLOR(word) : word);
-    // Highlight strings (double, single, and template literals)
-    const stringRegex = /("(?:\\.|[^"])*"|'(?:\\.|[^'])*'|`(?:\\.|[^`])*`)/g;
-    code = code.replace(stringRegex, (match) => STRING_COLOR(match));
-    return indent + code + (comment ? COMMENT_COLOR(comment) : "");
-}
-/**
- * Python painter: handles Python-specific syntax.
- *
- * Differences from C-like languages:
- * - Comments start with # instead of //
- * - Triple-quoted strings (""" and ''')
- * - Python-specific keywords
- */
-function paintPython(line) {
-    const { indent, body } = stripIndent(line);
-    if (!body)
-        return indent;
-    // Python comments use #
-    const commentIndex = body.indexOf("#");
-    let code = commentIndex >= 0 ? body.slice(0, commentIndex) : body;
-    const comment = commentIndex >= 0 ? body.slice(commentIndex) : "";
-    // Highlight numbers
-    code = code.replace(/\b(\d+(?:\.\d+)?)\b/g, (_m, value) => NUMBER_COLOR(value));
-    // Highlight Python keywords
-    code = code.replace(/\b([A-Za-z_][\w]*)\b/g, (_m, word) => PY_KEYWORDS.has(word) ? KEYWORD_COLOR(word) : word);
-    // Highlight strings (including triple-quoted)
-    const stringRegex = /("""[\s\S]*?"""|'''[\s\S]*?'''|"(?:\\.|[^"])*"|'(?:\\.|[^'])*')/g;
-    code = code.replace(stringRegex, (match) => STRING_COLOR(match));
-    return indent + code + (comment ? COMMENT_COLOR(comment) : "");
-}
-/**
- * SQL painter: highlights SQL syntax with uppercase keywords.
- *
- * SQL convention is to uppercase keywords, so we transform
- * matched keywords to uppercase in addition to coloring them.
- */
-function paintSql(line) {
-    const { indent, body } = stripIndent(line);
-    let result = body;
-    // Match words and uppercase keywords
-    result = result.replace(/\b([a-z]+)\b/gi, (match) => SQL_KEYWORDS.has(match.toLowerCase())
-        ? KEYWORD_COLOR(match.toUpperCase())
-        : match);
-    // SQL strings use single quotes (with '' for escaping)
-    result = result.replace(/'(?:''|[^'])*'/g, (match) => STRING_COLOR(match));
-    // Highlight numbers
-    result = result.replace(/\b\d+(?:\.\d+)?\b/g, (match) => NUMBER_COLOR(match));
-    return indent + result;
-}
-/**
- * YAML painter: highlights keys, values, and special literals.
- *
- * YAML structure is `key: value`, so we parse that pattern
- * and color the key in cyan.
- */
-function paintYaml(line) {
-    const match = line.match(/^(\s*)([^:#]+):(.*)$/);
-    if (!match) {
-        return DEFAULT_CODE_COLOR(line);
-    }
-    const [, indent, key, rest] = match;
-    let value = rest.trimStart();
-    // Highlight quoted strings in values
-    value = value.replace(/"(?:\\.|[^"])*"|'(?:\\.|[^'])*'/g, (str) => STRING_COLOR(str));
-    // Highlight boolean and null literals
-    value = value.replace(/\b(true|false|null)\b/gi, (word) => KEYWORD_COLOR(word));
-    return `${indent}${chalk.hex("#7dd3fc")(`${key}:`)}${value ? ` ${value}` : ""}`;
-}
-// ────────────────────────────────────────────────────────────────────────────
-// PAINTER REGISTRY
-// Maps language identifiers to their painter functions
-// ────────────────────────────────────────────────────────────────────────────
-/**
- * Registry of language painters.
- *
- * Each entry has:
- * - matcher: Function to test if a language ID matches
- * - painter: Function to apply highlighting to a line
- *
- * The first matching painter is used, so order matters for
- * overlapping language names.
- */
-const PAINTERS = [
-    { matcher: (lang) => JSON_LANGS.has(lang), painter: paintJson },
-    { matcher: (lang) => SHELL_LANGS.has(lang), painter: paintShell },
-    { matcher: (lang) => DIFF_LANGS.has(lang), painter: paintDiff },
-    {
-        matcher: (lang) => JS_LANGS.has(lang),
-        painter: (line) => paintKeywordLine(line, JS_KEYWORDS),
-    },
-    { matcher: (lang) => PY_LANGS.has(lang), painter: paintPython },
-    { matcher: (lang) => SQL_LANGS.has(lang), painter: paintSql },
-    { matcher: (lang) => YAML_LANGS.has(lang), painter: paintYaml },
-];
-/**
- * Looks up the appropriate painter for a language.
- *
- * @param language - Language identifier (e.g., "typescript", "py", "json")
- * @returns Painter function for the language, or default painter
- */
-function getPainter(language) {
-    const lang = (language || "").toLowerCase();
-    for (const entry of PAINTERS) {
-        if (entry.matcher(lang)) {
-            return entry.painter;
-        }
-    }
-    return paintDefault;
-}
-// ────────────────────────────────────────────────────────────────────────────
-// PUBLIC API
-// ────────────────────────────────────────────────────────────────────────────
-/**
- * Highlights a multi-line code block.
- *
- * This is the main entry point for syntax highlighting. It:
- * 1. Selects the appropriate painter based on language
- * 2. Normalizes tabs to 2 spaces
- * 3. Applies highlighting line-by-line
- *
- * @param text - Code block content
- * @param language - Optional language identifier
- * @returns Array of ANSI-styled lines
- *
- * @example
- * ```typescript
- * const lines = highlightCodeLines(
- *   'const x = 42;\nconsole.log(x);',
- *   'typescript'
- * );
- * lines.forEach(line => console.log(line));
- * ```
- */
-export function highlightCodeLines(text, language) {
-    const painter = getPainter(language);
-    // Normalize tabs to 2 spaces for consistent rendering
-    const normalized = text.replace(/\t/g, "  ");
-    const lines = normalized.split("\n");
-    return lines.map((line) => painter(line));
-}
-/**
- * Highlights inline code (single backticks in markdown).
- *
- * Uses a dark background with yellow text for visibility.
- * Newlines are converted to spaces since inline code should
- * remain on a single line.
- *
- * @param text - Inline code content
- * @returns ANSI-styled string
- *
- * @example
- * ```typescript
- * const styled = highlightInlineCode('foo.bar()');
- * console.log(`Use ${styled} to call the method`);
- * ```
- */
-export function highlightInlineCode(text) {
-    if (!text)
-        return "";
-    // Replace newlines with spaces (inline code is single-line)
-    const cleaned = text.replace(/\r?\n/g, " ");
-    // Dark purple background with yellow text
-    return chalk.bgRgb(40, 42, 54)(chalk.hex("#facc15")(cleaned));
-}
-//# sourceMappingURL=code-highlighter.js.map