@j0hanz/filesystem-mcp 2.1.7 → 2.1.8

package/dist/tools/define.js.map

@@ -1 +1 @@
-{"version":3,"file":"define.js","sourceRoot":"","sources":["../../src/tools/define.ts"],"names":[],"mappings":"AAgBA,OAAO,EACL,4BAA4B,EAC5B,cAAc,EACd,qBAAqB,GACtB,MAAM,8BAA8B,CAAC;AAEtC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,SAAS,EAAE,yBAAyB,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAElF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAGlD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAGnD,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAoGjE,SAAS,SAAS,CAChB,GAAkB,EAClB,IAA4E;IAE5E,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,6EAA6E;IAC7E,4EAA4E;IAC5E,8EAA8E;IAC9E,2EAA2E;IAC3E,4BAA4B;IAC5B,EAAE;IACF,6EAA6E;IAC7E,8EAA8E;IAC9E,+CAA+C;IAC/C,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,QAA+C,CAAC;IAC5E,MAAM,kBAAkB,GACrB,QAAQ,EAAE,CAAC,4BAA4B,CAAoC;QAC5E,wJAAwJ;QACxJ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC;IAE7C,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM;QACzB,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,EAAE,EAAE,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC;QACzC,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,gBAAgB,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC;QACzE,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,cAAc;QACzC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,YAAY;QACrC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtD,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CACzB,GAAkB,EAClB,IAAgB;IAEhB,OAAO,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;AAClE,CAAC;AAED,SAAS,aAAa,CAAC,IAAiB,EAAE,SAAkB;IAC1D,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5B,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAI,MAAoB;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAmB,CAAC,EAAE,IAAI,EAAE,MAAe,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/F,OAAO;QACL,OAAO;QACP,GAAG,CAAC,OAAO;YACT,CAAC,CAAC,iEAAiE;gBACjE,sEAAsE;gBACtE,sEAAsE;gBACtE,oEAAoE;gBACpE,iCAAiC;gBACjC,EAAE,KAAK,EAAE,MAAM,CAAC,UAAqC,EAAE;YACzD,CAAC,CAAC,EAAE,iBAAiB,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC;QAC7C,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC7C,CAAC;AACJ,CAAC;AAED,MAAM,YAAY;IACP,MAAM,CAAc;IACZ,GAAG,CAAgB;IACnB,UAAU,CAAa;IACvB,OAAO,CAAU;IAElC,eAAe,GAAG,KAAK,CAAC;IACf,YAAY,CAAc;IAC1B,QAAQ,CAAmB;IAC3B,gBAAgB,CAAkB;IAE3C,YAAY,QAAgB,EAAE,GAAY,EAAE,GAAkB,EAAE,UAAsB;QACpF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QACvD,IAAI,CAAC,YAAY,GAAG,kBAAkB,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;YAC9D,IAAI,CAAC,QAAQ,GAAG,IAAI,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAC7E,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,MAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACzF,IAAI,CAAC,gBAAgB,GAAG,IAAI,eAAe,CAAC;YAC1C,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK;YAC9B,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtC,CAAC,CAAC;QACH,IAAI,CAAC,OAAO,GAAG;YACb,GAAG,GAAG;YACN,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,GAAG,EAAE,CAAC,KAAmB,EAAE,IAAa,EAAE,MAAe,EAAE,EAAE;gBAC3D,MAAM,GAAG,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3D,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC;YACxC,CAAC;YACD,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE;gBAChB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;SACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,CAAsC;QAC1C,IAAI,IAAI,CAAC,eAAe;YAAE,OAAO;QACjC,MAAM,OAAO,GAAgB;YAC3B,GAAG,IAAI,CAAC,YAAY;YACpB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrD,CAAC;QACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,OAAe;QAClC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,KAAc,EAAE,OAAe;QAClD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAEO,KAAK,CAAC,gBAAgB,CAAC,MAAkB;QAC/C,MAAM,OAAO,GAAgB,IAAI,CAAC,GAAG,CAAC,YAAY;YAChD,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE;YAC7E,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QACtB,MAAM,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAC3D,CAAC;IAEO,KAAK,CAAC,YAAY,CAAC,KAAc;QACvC,MAAM,MAAM,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC9E,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,MAAM,CACxC,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,gBAAgB,IAAI,SAAS,CAAC,OAAO,CAC/C,CAAC;QACF,OAAO;YACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAe,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YACrD,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACK,KAAK,CAAC,aAAa;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;QACrC,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACzC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE7C,sEAAsE;QACtE,wEAAwE;QACxE,iEAAiE;QACjE,+DAA+D;QAC/D,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE,EAAE,OAAO;YACX,OAAO,EAAE,SAAS;YAClB,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY;YACvC,kBAAkB,EAAE,IAAI,CAAC,OAAO,CAAC,kBAAkB;YACnD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CACpB,KAAK;gBACH,CAAC,CAAC;oBACE,gBAAgB,CACd,OAAO,EACP,yEAAyE,EACzE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAC1C;iBACF;gBACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;oBACpB,GAAG,EAAE,WAAW,CAAC,EAAE;oBACnB,OAAO,EAAE,+BAA+B,GAAG,IAAI;iBAChD,CAAC,CAAC;SACV,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,wEAAwE;QACxE,0EAA0E;QAC1E,EAAE;QACF,0EAA0E;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,0EAA0E;QAC1E,sEAAsE;QACtE,EAAE;QACF,0EAA0E;QAC1E,yEAAyE;QACzE,yEAAyE;QACzE,2EAA2E;QAC3E,yEAAyE;QACzE,mDAAmD;QACnD,MAAM,QAAQ,GAAG,KAAK;YACpB,CAAC,CAAC,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC;YACvE,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAC3B,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,WAAW,CAAC,EAAE,CAAC,CACjE,CAAC;QACN,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,SAAS;YACzD,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,OAAO;QACX,MAAM,OAAO,GAAG,KAAK,IAAmD,EAAE;YACxE,IAAI,CAAC;gBACH,mEAAmE;gBACnE,iEAAiE;gBACjE,oEAAoE;gBACpE,mEAAmE;gBACnE,sCAAsC;gBACtC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;gBACjD,IAAI,aAAa,KAAK,SAAS;oBAAE,OAAO,aAAa,CAAC;gBACtD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjE,qEAAqE;gBACrE,gEAAgE;gBAChE,qEAAqE;gBACrE,yDAAyD;gBACzD,IAAI,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;oBAClC,OAAO,MAAM,CAAC;gBAChB,CAAC;gBACD,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBAC/C,OAAO,oBAAoB,CAAC,MAAM,CAAC,CAAC;YACtC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YACxC,CAAC;oBAAS,CAAC;gBACT,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;YAC9B,CAAC;QACH,CAAC,CAAC;QAEF,OAAO,OAAO,EAAE,CAAC;IACnB,CAAC;CACF;AAED,SAAS,uBAAuB,CAC9B,GAAkB,EAClB,IAAc;IAEd,OAAO,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CACzB,IAAI,YAAY,CAAO,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;AAChF,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,sBAAsB,CAAC,MAAiB;IAC/C,OAAO;QACL,YAAY;YACV,OAAO,CAAC,KAAc,EAAE,EAAE;gBACxB,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACvC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,OAAO;wBACL,KAAK,EAAE,IAAa;wBACpB,IAAI,EAAE,MAAM,CAAC,IAAS;wBACtB,YAAY,EAAE,SAAS;qBACxB,CAAC;gBACJ,CAAC;gBACD,OAAO;oBACL,KAAK,EAAE,KAAc;oBACrB,IAAI,EAAE,SAAS;oBACf,YAAY,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC;iBAC5C,CAAC;YACJ,CAAC,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAS,aAAa,CAAC,MAAiB,EAAE,EAAsB;IAC9D,MAAM,SAAS,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE;QACvC,MAAM,EAAE,eAAe;QACvB,EAAE;QACF,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE;YAC3B,MAAM,IAAI,GAAG,UAAqC,CAAC;YACnD,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,CAAC,gBAAgB;gBAAE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;YACxE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;KACF,CAA4B,CAAC;IAC9B,OAAO,SAAS,CAAC,SAAS,CAAC,CAAC;IAC5B,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,UAAU,CACxB,GAAkB;IAElB,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE1D,0EAA0E;IAC1E,6EAA6E;IAC7E,mBAAmB;IACnB,2EAA2E;IAC3E,8EAA8E;IAC9E,4EAA4E;IAC5E,8EAA8E;IAC9E,wEAAwE;IACxE,MAAM,oBAAoB,GAAoB;QAC5C,YAAY,EAAE,GAAG,CAAC,WAAW,CAAC,YAAY;QAC1C,aAAa,EAAE,GAAG,CAAC,WAAW,CAAC,aAAa,IAAI,KAAK;QACrD,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,YAAY;YAC9B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,WAAW,CAAC,eAAe,IAAI,IAAI,EAAE,CAAC;KAClE,CAAC;IAEF,MAAM,YAAY,GAAG;QACnB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,WAAW,EAAE,cAAc,CAAa,eAAe,EAAE,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3F,sEAAsE;QACtE,4EAA4E;QAC5E,0DAA0D;QAC1D,yEAAyE;QACzE,uEAAuE;QACvE,EAAE;QACF,4EAA4E;QAC5E,oDAAoD;QACpD,WAAW,EAAE,oBAAoB;KAClC,CAAC;IAEF,MAAM,IAAI,GAAgB;QACxB,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,WAAW,EAAE,GAAG,CAAC,WAAW;QAE5B,QAAQ,CAAC,IAAc;YACrB,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,uBAAuB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9F,CAAC;KACF,CAAC;IAEF,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["import type {\n  CallToolResult,\n  ClientCapabilities,\n  ContentBlock,\n  InputRequiredResult,\n  JsonSchemaType,\n  JsonSchemaValidator,\n  jsonSchemaValidator,\n  McpServer,\n  Notification,\n  RegisteredTool,\n  RequestMeta,\n  RequestStateAccessor,\n  ServerContext,\n  ToolAnnotations,\n} from '@modelcontextprotocol/server';\nimport {\n  CLIENT_CAPABILITIES_META_KEY,\n  fromJsonSchema,\n  isInputRequiredResult,\n} from '@modelcontextprotocol/server';\n\nimport * as z from 'zod/v4';\n\nimport { ErrorCode, formatUnknownErrorMessage, Problem } from '../core/errors.js';\nimport type { ProgressCtx } from '../core/fmt.js';\nimport { plainMessage } from '../core/fmt.js';\nimport { GuardedFileSystem } from '../core/fs.js';\nimport {\n  multiSelectInput,\n  pendingRoundTrip,\n  readAcceptedConfirm,\n  readAcceptedMultiChoice,\n} from '../core/input-required.js';\nimport { Logger } from '../core/observability.js';\nimport type { LoggingLevel } from '../core/observability.js';\nimport type { PageSnapshotStore } from '../core/page-store.js';\nimport { isSamePath } from '../core/path-utils.js';\nimport type { PathGuard } from '../core/path.js';\nimport type { ResourceStore } from '../core/store.js';\nimport { McpProgressSink, ProgressSession } from './progress.js';\n\nexport interface ToolCtx {\n  readonly signal: AbortSignal;\n  readonly _meta?: RequestMeta | undefined;\n  readonly fs: GuardedFileSystem;\n  readonly pageStore: PageSnapshotStore;\n  readonly resourceStore: ResourceStore | undefined;\n  /** Emits a log line to stderr via `Logger.emit`, gated by `LOG_LEVEL`. */\n  readonly log?: (level: LoggingLevel, data: unknown, logger?: string) => void;\n  readonly sendNotification?: (notification: Notification) => Promise<void>;\n  readonly onProgress?: (params: { current: number; total?: number }) => void;\n  /**\n   * Multi-round-trip `inputResponses` carried by a retried `tools/call`\n   * (protocol revision 2026-07-28); `undefined` on the first round. Bare,\n   * unvalidated client values — handlers read them through\n   * `readAcceptedConfirm`.\n   */\n  readonly inputResponses?: Record<string, unknown> | undefined;\n  /**\n   * Reads the verified multi-round-trip `requestState` for the current round:\n   * the decoded `PendingState` the `requestStateCodec` verified, or `undefined`\n   * when the round carried no state (the first round). `undefined` when no\n   * live request context is available.\n   */\n  readonly requestState?: RequestStateAccessor | undefined;\n  /**\n   * What the connected client declared it can do, or `undefined` when this\n   * connection cannot say. Read by the `input_required` flows: an embedded\n   * elicitation sent to a client that never declared `elicitation` is rejected\n   * by the SDK with `-32021` before it reaches the wire, so the handlers check\n   * first and answer with an actionable tool error instead.\n   *\n   * Two sources, because the eras differ: a legacy connection negotiated them\n   * at `initialize` (`Server.getClientCapabilities()`), a modern one carries\n   * them per request in the `_meta` envelope and never runs `initialize` at\n   * all. `undefined` means \"cannot tell\" — never \"no capabilities\".\n   */\n  readonly clientCapabilities?: ClientCapabilities | undefined;\n}\n\ninterface ToolDeps {\n  readonly server: McpServer;\n  readonly pathGuard: PathGuard;\n  readonly pageStore: PageSnapshotStore;\n  readonly resourceStore: ResourceStore | undefined;\n}\n\ninterface RunResult<T> {\n  readonly structured: T;\n  readonly text?: string;\n  readonly resources?: ContentBlock[];\n  /**\n   * The call as a whole failed. Batch tools set it from `isTotalFailure` in\n   * `batch.ts` — every requested item failed — so the executor never has to\n   * know a tool's output shape. Absent or `false` means the call did work.\n   */\n  readonly isError?: boolean;\n}\n\n/**\n * `ToolAnnotations` with `readOnlyHint` required. It is optional in the SDK, but\n * MUTATING_TOOL_NAMES derives the `--read-only` gate from it, so a tool that\n * forgets it must be a compile error rather than a silent reclassification.\n */\ntype DeclaredAnnotations = ToolAnnotations & { readonly readOnlyHint: boolean };\n\nexport interface ToolDef<I extends z.ZodType, O extends z.ZodType> {\n  readonly name: string;\n  readonly title: string;\n  readonly description: string;\n  readonly input: I;\n  readonly output: O;\n  readonly annotations: DeclaredAnnotations;\n  readonly timeoutMs?: number;\n  readonly progress?: (args: z.infer<I>) => ProgressCtx;\n  readonly progressDone?: (args: z.infer<I>, result: z.infer<O>) => Partial<ProgressCtx>;\n  readonly defaultErrorCode?: ErrorCode;\n  /**\n   * The filesystem paths this tool will operate on, extracted from its parsed\n   * args. The executor runs an access-grant pre-check over these BEFORE `run`\n   * (R7): any path outside the granted roots yields an `input_required`\n   * round-trip requesting a grant, and nothing is touched until the client\n   * retries with an accepted grant (R8). Omit for tools that do not operate on\n   * caller-supplied filesystem paths.\n   */\n  readonly accessPaths?: (args: z.infer<I>) => readonly string[];\n  readonly run: (\n    args: z.infer<I>,\n    ctx: ToolCtx,\n  ) => Promise<RunResult<z.infer<O>> | InputRequiredResult>;\n}\n\nexport interface DefinedTool {\n  readonly name: string;\n  readonly annotations: DeclaredAnnotations;\n\n  register(deps: ToolDeps): RegisteredTool;\n}\n\nfunction toToolCtx(\n  ctx: ServerContext,\n  deps: Pick<ToolDeps, 'pathGuard' | 'pageStore' | 'resourceStore' | 'server'>,\n): ToolCtx {\n  // Envelope first, accessor second — the two eras carry this differently.\n  // A modern request states the capabilities in its own `_meta` envelope; a\n  // legacy connection fixed them at `initialize` and has no envelope at all.\n  // The deprecated accessor still answers for both today (the SDK backfills it\n  // per request from the validated envelope on modern instances), but reading\n  // the envelope directly is the supported path, so it leads: when the accessor\n  // goes, legacy degrades to \"cannot tell\", which fails open to the behavior\n  // that predates this check.\n  //\n  // The cast is the SDK's shipped `RequestMetaEnvelope` declaration collapsing\n  // to `{}` — the reserved keys survive at runtime but not in the .d.ts, so the\n  // key constant cannot index the declared type.\n  const envelope = ctx.mcpReq.envelope as Record<string, unknown> | undefined;\n  const clientCapabilities =\n    (envelope?.[CLIENT_CAPABILITIES_META_KEY] as ClientCapabilities | undefined) ??\n    // eslint-disable-next-line @typescript-eslint/no-deprecated -- the only source of client capabilities on a legacy connection, where no envelope exists.\n    deps.server.server.getClientCapabilities();\n\n  return {\n    signal: ctx.mcpReq.signal,\n    ...(ctx.mcpReq._meta ? { _meta: ctx.mcpReq._meta } : {}),\n    fs: new GuardedFileSystem(deps.pathGuard),\n    pageStore: deps.pageStore,\n    resourceStore: deps.resourceStore,\n    sendNotification: async (notification) => ctx.mcpReq.notify(notification),\n    inputResponses: ctx.mcpReq.inputResponses,\n    requestState: ctx.mcpReq.requestState,\n    ...(clientCapabilities ? { clientCapabilities } : {}),\n  };\n}\n\nfunction resolveProgressCtx<I extends z.ZodType, O extends z.ZodType>(\n  def: ToolDef<I, O>,\n  args: z.infer<I>,\n): ProgressCtx {\n  return def.progress ? def.progress(args) : { label: def.title };\n}\n\nfunction composeSignal(base: AbortSignal, timeoutMs?: number): AbortSignal {\n  if (!timeoutMs) return base;\n  return AbortSignal.any([base, AbortSignal.timeout(timeoutMs)]);\n}\n\n/**\n * Claude Code — and any client that treats `structuredContent` as the canonical\n * model view — discards the `text` blocks when `structuredContent` is present,\n * showing the model `JSON.stringify(structuredContent)` instead. A tool that\n * authored a text result (list's ASCII tree, read's file) meant that text for\n * the model, so it ships its metadata under `_meta`, which no client renders in\n * place of the content. Tools with no `text` keep `structuredContent`: the JSON\n * *is* their model-facing view.\n */\nfunction buildSuccessResponse<O>(result: RunResult<O>): CallToolResult {\n  const hasText = result.text !== undefined;\n  const text = result.text ?? JSON.stringify(result.structured);\n  const content: ContentBlock[] = [{ type: 'text' as const, text }, ...(result.resources ?? [])];\n  return {\n    content,\n    ...(hasText\n      ? // Safe because every `ToolDef.output` is a Zod object schema, so\n        // `structured` is always a plain object. Constraining `O` to prove it\n        // is not worth the cost: the bound has to thread through five generic\n        // sites and still loses to `exactOptionalPropertyTypes` variance on\n        // `RunResult`'s optional fields.\n        { _meta: result.structured as Record<string, unknown> }\n      : { structuredContent: result.structured }),\n    ...(result.isError ? { isError: true } : {}),\n  };\n}\n\nclass ToolExecutor<I extends z.ZodType, O extends z.ZodType> {\n  readonly signal: AbortSignal;\n  private readonly def: ToolDef<I, O>;\n  private readonly parsedArgs: z.infer<I>;\n  private readonly toolCtx: ToolCtx;\n\n  #progressClosed = false;\n  readonly #progressCtx: ProgressCtx;\n  readonly #mcpSink?: McpProgressSink;\n  readonly #progressSession: ProgressSession;\n\n  constructor(toolName: string, ctx: ToolCtx, def: ToolDef<I, O>, parsedArgs: z.infer<I>) {\n    this.def = def;\n    this.parsedArgs = parsedArgs;\n    this.signal = composeSignal(ctx.signal, def.timeoutMs);\n    this.#progressCtx = resolveProgressCtx(def, parsedArgs);\n    const token = ctx._meta?.progressToken;\n    if (token !== undefined && ctx.sendNotification !== undefined) {\n      this.#mcpSink = new McpProgressSink(toolName, token, ctx.sendNotification);\n    }\n    const isTest = process.env['NODE_ENV'] === 'test' || process.execArgv.includes('--test');\n    this.#progressSession = new ProgressSession({\n      label: this.#progressCtx.label,\n      ...(this.#mcpSink ? { sink: this.#mcpSink } : {}),\n      ...(isTest ? { rateLimitMs: 0 } : {}),\n    });\n    this.toolCtx = {\n      ...ctx,\n      signal: this.signal,\n      log: (level: LoggingLevel, data: unknown, logger?: string) => {\n        const msg = typeof data === 'string' ? data : String(data);\n        const prefix = logger ? `[${logger}] ` : '';\n        Logger.emit(level, `${prefix}${msg}`);\n      },\n      onProgress: (p) => {\n        this.#tick(p);\n      },\n    };\n  }\n\n  #tick(p: { current: number; total?: number }): void {\n    if (this.#progressClosed) return;\n    const tickCtx: ProgressCtx = {\n      ...this.#progressCtx,\n      current: p.current,\n      ...(p.total !== undefined ? { total: p.total } : {}),\n    };\n    this.#progressSession.set({ ...p, message: plainMessage('tick', tickCtx) });\n  }\n\n  async #closeWithDone(message: string): Promise<void> {\n    this.#progressClosed = true;\n    this.#progressSession.complete(message);\n    if (this.#mcpSink) await this.#mcpSink.flush();\n  }\n\n  async #closeWithFail(error: unknown, message: string): Promise<void> {\n    this.#progressClosed = true;\n    this.#progressSession.fail(error, message);\n    if (this.#mcpSink) await this.#mcpSink.flush();\n  }\n\n  async #flushProgress(): Promise<void> {\n    if (this.#mcpSink) await this.#mcpSink.flush();\n  }\n\n  private async completeProgress(result: z.infer<O>): Promise<void> {\n    const doneCtx: ProgressCtx = this.def.progressDone\n      ? { ...this.#progressCtx, ...this.def.progressDone(this.parsedArgs, result) }\n      : this.#progressCtx;\n    await this.#closeWithDone(plainMessage('done', doneCtx));\n  }\n\n  private async failProgress(error: unknown): Promise<{ isError: true; content: ContentBlock[] }> {\n    const errMsg = formatUnknownErrorMessage(error);\n    const message = plainMessage('fail', { ...this.#progressCtx, error: errMsg });\n    await this.#closeWithFail(error, message);\n    const { text: errorText } = Problem.toText(\n      error,\n      this.def.defaultErrorCode ?? ErrorCode.UNKNOWN,\n    );\n    return {\n      content: [{ type: 'text' as const, text: errorText }],\n      isError: true,\n    };\n  }\n\n  /**\n   * Access-grant pre-check (R7/R8/R9). Before `run` touches the filesystem,\n   * ask PathGuard which of the tool's declared paths are out-of-root and\n   * grantable. If any are and this round carries no verified `requestState`,\n   * return `input_required` (nothing is read or written — R7). On retry, the\n   * verified state must bind this grant set (R9); apply each accepted grant for\n   * the session (R8) and proceed. A declined or ungrantable path is left for\n   * `validateAccess` to fail closed during the operation. Returns `undefined`\n   * when no round-trip is needed and any applicable grants have been applied.\n   */\n  private async precheckGrant(): Promise<InputRequiredResult | undefined> {\n    const extract = this.def.accessPaths;\n    if (!extract) return undefined;\n    const paths = extract(this.parsedArgs);\n    if (paths.length === 0) return undefined;\n    const grantDirs = await this.toolCtx.fs.pathGuard.precheckAccess(paths);\n    if (grantDirs.length === 0) return undefined;\n\n    // One grant dir: a single boolean confirm. Multiple: one multi-select\n    // elicitation so the client picks the subset to allow in one round-trip\n    // (N dirs → 1 round-trip, not N). `pendingRoundTrip` still binds\n    // `paths: grantDirs` sorted, so R9 path-binding is unaffected.\n    const multi = grantDirs.length > 1;\n    const round = await pendingRoundTrip({\n      op: 'grant',\n      pending: grantDirs,\n      requestState: this.toolCtx.requestState,\n      clientCapabilities: this.toolCtx.clientCapabilities,\n      buildInputs: (dirs) =>\n        multi\n          ? [\n              multiSelectInput(\n                'grant',\n                'Grant filesystem access to these directories? Select the ones to allow.',\n                dirs.map((d) => ({ value: d, title: d })),\n              ),\n            ]\n          : dirs.map((dir, i) => ({\n              key: `confirm_${i}`,\n              message: `Grant filesystem access to \"${dir}\"?`,\n            })),\n    });\n    if (round !== undefined) return round;\n    // Apply accepted grants for the session (R8). Declined/missing dirs are\n    // skipped here; their paths fail with ACCESS_DENIED during the operation.\n    //\n    // No list-changed notification follows: a grant widens the allowed roots,\n    // and no resource list reads them. The instructions resource has a fixed\n    // URI, the result template lists the ResourceStore, and the file template\n    // lists nothing at all (see resources.ts). Notifying here only bought the\n    // client a round trip to re-fetch a list that could not have changed.\n    //\n    // `readAcceptedMultiChoice` does NOT validate against the offered choices\n    // (attacker-controlled inputResponses on re-entry). Only grant dirs that\n    // were actually offered by precheckAccess — a value outside grantDirs is\n    // ignored and fails closed in validateAccess. The single-select path reads\n    // `confirm_${i}` for `grantDirs[i]`, so the isSamePath filter is a no-op\n    // there; it only bites for the multi-select array.\n    const accepted = multi\n      ? (readAcceptedMultiChoice(this.toolCtx.inputResponses, 'grant') ?? [])\n      : grantDirs.filter((_dir, i) =>\n          readAcceptedConfirm(this.toolCtx.inputResponses, `confirm_${i}`),\n        );\n    for (const dir of accepted) {\n      if (!grantDirs.some((g) => isSamePath(g, dir))) continue;\n      await this.toolCtx.fs.pathGuard.applyGrant(dir);\n    }\n    return undefined;\n  }\n\n  async execute(): Promise<CallToolResult | InputRequiredResult> {\n    const runTool = async (): Promise<CallToolResult | InputRequiredResult> => {\n      try {\n        // Access-grant pre-check before any filesystem touch (R7/R8/R9). A\n        // grant input_required short-circuits here (progress paused, not\n        // finished); an R9 mismatch throws, which this catch surfaces as an\n        // isError tool result like every other handler failure — not a raw\n        // JSON-RPC error (GRANT-1 impact #2).\n        const grantRequired = await this.precheckGrant();\n        if (grantRequired !== undefined) return grantRequired;\n        const result = await this.def.run(this.parsedArgs, this.toolCtx);\n        // input_required is a return value, not a completed call: the client\n        // retries the same tools/call carrying inputResponses, and this\n        // handler re-enters from the top. Skip the progress \"done\" close and\n        // return it verbatim — progress is paused, not finished.\n        if (isInputRequiredResult(result)) {\n          return result;\n        }\n        await this.completeProgress(result.structured);\n        return buildSuccessResponse(result);\n      } catch (error) {\n        return await this.failProgress(error);\n      } finally {\n        await this.#flushProgress();\n      }\n    };\n\n    return runTool();\n  }\n}\n\nfunction createServerToolHandler<I extends z.ZodType, O extends z.ZodType>(\n  def: ToolDef<I, O>,\n  deps: ToolDeps,\n): (args: z.infer<I>, ctx: ServerContext) => Promise<CallToolResult | InputRequiredResult> {\n  return async (args, ctx) =>\n    new ToolExecutor<I, O>(def.name, toToolCtx(ctx, deps), def, args).execute();\n}\n\n/**\n * Validate with Zod while publishing the precomputed JSON Schema: clients get\n * draft-2020-12, handlers get Zod's coercions, defaults and error messages.\n *\n * Each validator instance is built for exactly one schema and handed straight\n * to `fromJsonSchema(thatSchema, ...)`, which calls `getValidator` once with\n * the same schema — so the argument is redundant here and deliberately ignored.\n * Reusing one instance across schemas would silently validate against `schema`.\n */\nfunction zodJsonSchemaValidator(schema: z.ZodType): jsonSchemaValidator {\n  return {\n    getValidator<U>(): JsonSchemaValidator<U> {\n      return (input: unknown) => {\n        const result = schema.safeParse(input);\n        if (result.success) {\n          return {\n            valid: true as const,\n            data: result.data as U,\n            errorMessage: undefined,\n          };\n        }\n        return {\n          valid: false as const,\n          data: undefined,\n          errorMessage: z.prettifyError(result.error),\n        };\n      };\n    },\n  };\n}\n\n/**\n * Generate the wire copy of a schema for `tools/list`. The Zod schema keeps\n * every constraint for runtime validation; the `override` pass only trims what\n * the wire copy costs every client at session start:\n *\n * - `$schema` and `title` carry no information the host uses.\n * - `maximum: Number.MAX_SAFE_INTEGER` is zod's int() artifact, not a bound.\n * - `examples` is dropped in both directions: on output it describes a field the\n *   server itself fills in, and on input every description that carried one\n *   already spells the same example out inline, so the keyword paid twice.\n *\n * Output `description`s are NOT dropped. They were, and the result was a wire\n * contract the model had to guess at: `delete` returns `path` XOR `paths`,\n * `edit.diff` appears only under dryRun, `read.value` has no required field at\n * all. None of that is inferable from types alone.\n *\n * No shared subschema carries a `.meta({ id })`, so zod inlines every one of\n * them and the emitted document has no `$defs`/`$ref` to dereference.\n */\nfunction toDraft202012(schema: z.ZodType, io: 'input' | 'output'): JsonSchemaType {\n  const generated = z.toJSONSchema(schema, {\n    target: 'draft-2020-12',\n    io,\n    override: ({ jsonSchema }) => {\n      const node = jsonSchema as Record<string, unknown>;\n      delete node['title'];\n      if (node['maximum'] === Number.MAX_SAFE_INTEGER) delete node['maximum'];\n      delete node['examples'];\n    },\n  }) as Record<string, unknown>;\n  delete generated['$schema'];\n  return generated;\n}\n\nexport function defineTool<I extends z.ZodType, O extends z.ZodType>(\n  def: ToolDef<I, O>,\n): DefinedTool {\n  const inputJsonSchema = toDraft202012(def.input, 'input');\n\n  // Nothing here depends on `deps`, so it is built once per tool definition\n  // rather than once per `register` — the HTTP leg registers every tool afresh\n  // on each request.\n  // Published annotations are derived, not passed through. `readOnlyHint` is\n  // load-bearing (MUTATING_TOOL_NAMES derives the --read-only gate from it) and\n  // `openWorldHint: false` is a real claim for a filesystem server. The other\n  // two describe behavior a read-only tool cannot have, and restate the default\n  // for a mutating one — 29 tokens per tool for nothing a client acts on.\n  const publishedAnnotations: ToolAnnotations = {\n    readOnlyHint: def.annotations.readOnlyHint,\n    openWorldHint: def.annotations.openWorldHint ?? false,\n    ...(def.annotations.readOnlyHint\n      ? {}\n      : { destructiveHint: def.annotations.destructiveHint ?? true }),\n  };\n\n  const toolDefShape = {\n    title: def.title,\n    description: def.description,\n    inputSchema: fromJsonSchema<z.infer<I>>(inputJsonSchema, zodJsonSchemaValidator(def.input)),\n    // No `outputSchema`, ever. Publishing one obliges the result to carry\n    // `structuredContent` (clients enforce it), and every tool that authors its\n    // own text ships its metadata under `_meta` instead — see\n    // `buildSuccessResponse`. The two cannot both hold, and the text is what\n    // the model reads. `TOOL-SURFACE-001` pins this for the whole surface.\n    //\n    // `def.output` stays: it types `RunResult<z.infer<O>>`, which is what makes\n    // a tool returning the wrong shape a compile error.\n    annotations: publishedAnnotations,\n  };\n\n  const tool: DefinedTool = {\n    name: def.name,\n    annotations: def.annotations,\n\n    register(deps: ToolDeps): RegisteredTool {\n      return deps.server.registerTool(def.name, toolDefShape, createServerToolHandler(def, deps));\n    },\n  };\n\n  return tool;\n}\n"]}
+{"version":3,"file":"define.js","sourceRoot":"","sources":["../../src/tools/define.ts"],"names":[],"mappings":"AAgBA,OAAO,EACL,4BAA4B,EAC5B,cAAc,EACd,qBAAqB,GACtB,MAAM,8BAA8B,CAAC;AAEtC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,SAAS,EAAE,yBAAyB,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAElF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAGlD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAGnD,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAoGjE,SAAS,SAAS,CAChB,GAAkB,EAClB,IAA4E;IAE5E,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,6EAA6E;IAC7E,4EAA4E;IAC5E,8EAA8E;IAC9E,2EAA2E;IAC3E,4BAA4B;IAC5B,EAAE;IACF,6EAA6E;IAC7E,8EAA8E;IAC9E,+CAA+C;IAC/C,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,QAA+C,CAAC;IAC5E,MAAM,kBAAkB,GACrB,QAAQ,EAAE,CAAC,4BAA4B,CAAoC;QAC5E,wJAAwJ;QACxJ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC;IAE7C,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM;QACzB,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,EAAE,EAAE,IAAI,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC;QACzC,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,gBAAgB,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC;QACzE,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,cAAc;QACzC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,YAAY;QACrC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtD,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAI,MAAoB;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAmB,CAAC,EAAE,IAAI,EAAE,MAAe,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/F,OAAO;QACL,OAAO;QACP,GAAG,CAAC,OAAO;YACT,CAAC,CAAC,iEAAiE;gBACjE,sEAAsE;gBACtE,sEAAsE;gBACtE,oEAAoE;gBACpE,iCAAiC;gBACjC,EAAE,KAAK,EAAE,MAAM,CAAC,UAAqC,EAAE;YACzD,CAAC,CAAC,EAAE,iBAAiB,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC;QAC7C,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC7C,CAAC;AACJ,CAAC;AAED,MAAM,YAAY;IACP,MAAM,CAAc;IACZ,GAAG,CAAgB;IACnB,UAAU,CAAa;IACvB,OAAO,CAAU;IAEzB,YAAY,CAAc;IAC1B,QAAQ,CAAmB;IAC3B,gBAAgB,CAAkB;IAE3C,YAAY,QAAgB,EAAE,GAAY,EAAE,GAAkB,EAAE,UAAsB;QACpF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,SAAS;YACzB,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;YACnE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QACf,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;QACnF,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;YAC9D,IAAI,CAAC,QAAQ,GAAG,IAAI,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAC7E,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,MAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACzF,IAAI,CAAC,gBAAgB,GAAG,IAAI,eAAe,CAAC;YAC1C,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK;YAC9B,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtC,CAAC,CAAC;QACH,IAAI,CAAC,OAAO,GAAG;YACb,GAAG,GAAG;YACN,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,GAAG,EAAE,CAAC,KAAmB,EAAE,IAAa,EAAE,MAAe,EAAE,EAAE;gBAC3D,MAAM,GAAG,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3D,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC;YACxC,CAAC;YACD,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE;gBAChB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;SACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,CAAsC;QAC1C,MAAM,OAAO,GAAgB;YAC3B,GAAG,IAAI,CAAC,YAAY;YACpB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrD,CAAC;QACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjD,CAAC;IAEO,KAAK,CAAC,gBAAgB,CAAC,MAAkB;QAC/C,MAAM,OAAO,GAAgB,IAAI,CAAC,GAAG,CAAC,YAAY;YAChD,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE;YAC7E,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QACtB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;IAC9B,CAAC;IAEO,KAAK,CAAC,YAAY,CAAC,KAAc;QACvC,MAAM,MAAM,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC9E,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3C,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;QAC5B,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,MAAM,CACxC,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,gBAAgB,IAAI,SAAS,CAAC,OAAO,CAC/C,CAAC;QACF,OAAO;YACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAe,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YACrD,OAAO,EAAE,IAAI;SACd,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACK,KAAK,CAAC,aAAa;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;QACrC,IAAI,CAAC,OAAO;YAAE,OAAO,SAAS,CAAC;QAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACzC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE7C,sEAAsE;QACtE,wEAAwE;QACxE,iEAAiE;QACjE,+DAA+D;QAC/D,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE,EAAE,OAAO;YACX,OAAO,EAAE,SAAS;YAClB,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY;YACvC,kBAAkB,EAAE,IAAI,CAAC,OAAO,CAAC,kBAAkB;YACnD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CACpB,KAAK;gBACH,CAAC,CAAC;oBACE,gBAAgB,CACd,OAAO,EACP,yEAAyE,EACzE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAC1C;iBACF;gBACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;oBACpB,GAAG,EAAE,WAAW,CAAC,EAAE;oBACnB,OAAO,EAAE,+BAA+B,GAAG,IAAI;iBAChD,CAAC,CAAC;SACV,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,wEAAwE;QACxE,0EAA0E;QAC1E,EAAE;QACF,0EAA0E;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,0EAA0E;QAC1E,sEAAsE;QACtE,EAAE;QACF,0EAA0E;QAC1E,yEAAyE;QACzE,yEAAyE;QACzE,2EAA2E;QAC3E,yEAAyE;QACzE,mDAAmD;QACnD,MAAM,QAAQ,GAAG,KAAK;YACpB,CAAC,CAAC,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC;YACvE,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAC3B,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,WAAW,CAAC,EAAE,CAAC,CACjE,CAAC;QACN,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAAE,SAAS;YACzD,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,OAAO;QACX,IAAI,CAAC;YACH,mEAAmE;YACnE,iEAAiE;YACjE,oEAAoE;YACpE,mEAAmE;YACnE,sCAAsC;YACtC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;YACjD,IAAI,aAAa,KAAK,SAAS;gBAAE,OAAO,aAAa,CAAC;YACtD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACjE,qEAAqE;YACrE,gEAAgE;YAChE,qEAAqE;YACrE,yDAAyD;YACzD,IAAI,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/C,OAAO,oBAAoB,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;gBAAS,CAAC;YACT,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;CACF;AAED;;;;;;;;GAQG;AACH,SAAS,sBAAsB,CAAC,MAAiB;IAC/C,OAAO;QACL,YAAY;YACV,OAAO,CAAC,KAAc,EAAE,EAAE;gBACxB,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBACvC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,OAAO;wBACL,KAAK,EAAE,IAAa;wBACpB,IAAI,EAAE,MAAM,CAAC,IAAS;wBACtB,YAAY,EAAE,SAAS;qBACxB,CAAC;gBACJ,CAAC;gBACD,OAAO;oBACL,KAAK,EAAE,KAAc;oBACrB,IAAI,EAAE,SAAS;oBACf,YAAY,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC;iBAC5C,CAAC;YACJ,CAAC,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAS,aAAa,CAAC,MAAiB,EAAE,EAAsB;IAC9D,MAAM,SAAS,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE;QACvC,MAAM,EAAE,eAAe;QACvB,EAAE;QACF,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE;YAC3B,MAAM,IAAI,GAAG,UAAqC,CAAC;YACnD,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,CAAC,gBAAgB;gBAAE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;YACxE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;KACF,CAA4B,CAAC;IAC9B,OAAO,SAAS,CAAC,SAAS,CAAC,CAAC;IAC5B,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,UAAU,CACxB,GAAkB;IAElB,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE1D,0EAA0E;IAC1E,6EAA6E;IAC7E,mBAAmB;IACnB,2EAA2E;IAC3E,8EAA8E;IAC9E,4EAA4E;IAC5E,8EAA8E;IAC9E,wEAAwE;IACxE,MAAM,oBAAoB,GAAoB;QAC5C,YAAY,EAAE,GAAG,CAAC,WAAW,CAAC,YAAY;QAC1C,aAAa,EAAE,GAAG,CAAC,WAAW,CAAC,aAAa,IAAI,KAAK;QACrD,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,YAAY;YAC9B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,WAAW,CAAC,eAAe,IAAI,IAAI,EAAE,CAAC;KAClE,CAAC;IAEF,MAAM,YAAY,GAAG;QACnB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,WAAW,EAAE,cAAc,CAAa,eAAe,EAAE,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3F,sEAAsE;QACtE,4EAA4E;QAC5E,0DAA0D;QAC1D,yEAAyE;QACzE,uEAAuE;QACvE,EAAE;QACF,4EAA4E;QAC5E,oDAAoD;QACpD,WAAW,EAAE,oBAAoB;KAClC,CAAC;IAEF,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,WAAW,EAAE,GAAG,CAAC,WAAW;QAE5B,QAAQ,CAAC,IAAc;YACrB,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAC1E,IAAI,YAAY,CAAO,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAC5E,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["import type {\n  CallToolResult,\n  ClientCapabilities,\n  ContentBlock,\n  InputRequiredResult,\n  JsonSchemaType,\n  JsonSchemaValidator,\n  jsonSchemaValidator,\n  McpServer,\n  Notification,\n  RegisteredTool,\n  RequestMeta,\n  RequestStateAccessor,\n  ServerContext,\n  ToolAnnotations,\n} from '@modelcontextprotocol/server';\nimport {\n  CLIENT_CAPABILITIES_META_KEY,\n  fromJsonSchema,\n  isInputRequiredResult,\n} from '@modelcontextprotocol/server';\n\nimport * as z from 'zod/v4';\n\nimport { ErrorCode, formatUnknownErrorMessage, Problem } from '../core/errors.js';\nimport type { ProgressCtx } from '../core/fmt.js';\nimport { plainMessage } from '../core/fmt.js';\nimport { GuardedFileSystem } from '../core/fs.js';\nimport {\n  multiSelectInput,\n  pendingRoundTrip,\n  readAcceptedConfirm,\n  readAcceptedMultiChoice,\n} from '../core/input-required.js';\nimport { Logger } from '../core/observability.js';\nimport type { LoggingLevel } from '../core/observability.js';\nimport type { PageSnapshotStore } from '../core/page-store.js';\nimport { isSamePath } from '../core/path-utils.js';\nimport type { PathGuard } from '../core/path.js';\nimport type { ResourceStore } from '../core/store.js';\nimport { McpProgressSink, ProgressSession } from './progress.js';\n\nexport interface ToolCtx {\n  readonly signal: AbortSignal;\n  readonly _meta?: RequestMeta | undefined;\n  readonly fs: GuardedFileSystem;\n  readonly pageStore: PageSnapshotStore;\n  readonly resourceStore: ResourceStore | undefined;\n  /** Emits a log line to stderr via `Logger.emit`, gated by `LOG_LEVEL`. */\n  readonly log?: (level: LoggingLevel, data: unknown, logger?: string) => void;\n  readonly sendNotification?: (notification: Notification) => Promise<void>;\n  readonly onProgress?: (params: { current: number; total?: number }) => void;\n  /**\n   * Multi-round-trip `inputResponses` carried by a retried `tools/call`\n   * (protocol revision 2026-07-28); `undefined` on the first round. Bare,\n   * unvalidated client values — handlers read them through\n   * `readAcceptedConfirm`.\n   */\n  readonly inputResponses?: Record<string, unknown> | undefined;\n  /**\n   * Reads the verified multi-round-trip `requestState` for the current round:\n   * the decoded `PendingState` the `requestStateCodec` verified, or `undefined`\n   * when the round carried no state (the first round). `undefined` when no\n   * live request context is available.\n   */\n  readonly requestState?: RequestStateAccessor | undefined;\n  /**\n   * What the connected client declared it can do, or `undefined` when this\n   * connection cannot say. Read by the `input_required` flows: an embedded\n   * elicitation sent to a client that never declared `elicitation` is rejected\n   * by the SDK with `-32021` before it reaches the wire, so the handlers check\n   * first and answer with an actionable tool error instead.\n   *\n   * Two sources, because the eras differ: a legacy connection negotiated them\n   * at `initialize` (`Server.getClientCapabilities()`), a modern one carries\n   * them per request in the `_meta` envelope and never runs `initialize` at\n   * all. `undefined` means \"cannot tell\" — never \"no capabilities\".\n   */\n  readonly clientCapabilities?: ClientCapabilities | undefined;\n}\n\ninterface ToolDeps {\n  readonly server: McpServer;\n  readonly pathGuard: PathGuard;\n  readonly pageStore: PageSnapshotStore;\n  readonly resourceStore: ResourceStore | undefined;\n}\n\ninterface RunResult<T> {\n  readonly structured: T;\n  readonly text?: string;\n  readonly resources?: ContentBlock[];\n  /**\n   * The call as a whole failed. Batch tools set it from `isTotalFailure` in\n   * `batch.ts` — every requested item failed — so the executor never has to\n   * know a tool's output shape. Absent or `false` means the call did work.\n   */\n  readonly isError?: boolean;\n}\n\n/**\n * `ToolAnnotations` with `readOnlyHint` required. It is optional in the SDK, but\n * MUTATING_TOOL_NAMES derives the `--read-only` gate from it, so a tool that\n * forgets it must be a compile error rather than a silent reclassification.\n */\ntype DeclaredAnnotations = ToolAnnotations & { readonly readOnlyHint: boolean };\n\nexport interface ToolDef<I extends z.ZodType, O extends z.ZodType> {\n  readonly name: string;\n  readonly title: string;\n  readonly description: string;\n  readonly input: I;\n  readonly output: O;\n  readonly annotations: DeclaredAnnotations;\n  readonly timeoutMs?: number;\n  readonly progress?: (args: z.infer<I>) => ProgressCtx;\n  readonly progressDone?: (args: z.infer<I>, result: z.infer<O>) => Partial<ProgressCtx>;\n  readonly defaultErrorCode?: ErrorCode;\n  /**\n   * The filesystem paths this tool will operate on, extracted from its parsed\n   * args. The executor runs an access-grant pre-check over these BEFORE `run`\n   * (R7): any path outside the granted roots yields an `input_required`\n   * round-trip requesting a grant, and nothing is touched until the client\n   * retries with an accepted grant (R8). Omit for tools that do not operate on\n   * caller-supplied filesystem paths.\n   */\n  readonly accessPaths?: (args: z.infer<I>) => readonly string[];\n  readonly run: (\n    args: z.infer<I>,\n    ctx: ToolCtx,\n  ) => Promise<RunResult<z.infer<O>> | InputRequiredResult>;\n}\n\nexport interface DefinedTool {\n  readonly name: string;\n  readonly annotations: DeclaredAnnotations;\n\n  register(deps: ToolDeps): RegisteredTool;\n}\n\nfunction toToolCtx(\n  ctx: ServerContext,\n  deps: Pick<ToolDeps, 'pathGuard' | 'pageStore' | 'resourceStore' | 'server'>,\n): ToolCtx {\n  // Envelope first, accessor second — the two eras carry this differently.\n  // A modern request states the capabilities in its own `_meta` envelope; a\n  // legacy connection fixed them at `initialize` and has no envelope at all.\n  // The deprecated accessor still answers for both today (the SDK backfills it\n  // per request from the validated envelope on modern instances), but reading\n  // the envelope directly is the supported path, so it leads: when the accessor\n  // goes, legacy degrades to \"cannot tell\", which fails open to the behavior\n  // that predates this check.\n  //\n  // The cast is the SDK's shipped `RequestMetaEnvelope` declaration collapsing\n  // to `{}` — the reserved keys survive at runtime but not in the .d.ts, so the\n  // key constant cannot index the declared type.\n  const envelope = ctx.mcpReq.envelope as Record<string, unknown> | undefined;\n  const clientCapabilities =\n    (envelope?.[CLIENT_CAPABILITIES_META_KEY] as ClientCapabilities | undefined) ??\n    // eslint-disable-next-line @typescript-eslint/no-deprecated -- the only source of client capabilities on a legacy connection, where no envelope exists.\n    deps.server.server.getClientCapabilities();\n\n  return {\n    signal: ctx.mcpReq.signal,\n    ...(ctx.mcpReq._meta ? { _meta: ctx.mcpReq._meta } : {}),\n    fs: new GuardedFileSystem(deps.pathGuard),\n    pageStore: deps.pageStore,\n    resourceStore: deps.resourceStore,\n    sendNotification: async (notification) => ctx.mcpReq.notify(notification),\n    inputResponses: ctx.mcpReq.inputResponses,\n    requestState: ctx.mcpReq.requestState,\n    ...(clientCapabilities ? { clientCapabilities } : {}),\n  };\n}\n\n/**\n * Claude Code — and any client that treats `structuredContent` as the canonical\n * model view — discards the `text` blocks when `structuredContent` is present,\n * showing the model `JSON.stringify(structuredContent)` instead. A tool that\n * authored a text result (list's ASCII tree, read's file) meant that text for\n * the model, so it ships its metadata under `_meta`, which no client renders in\n * place of the content. Tools with no `text` keep `structuredContent`: the JSON\n * *is* their model-facing view.\n */\nfunction buildSuccessResponse<O>(result: RunResult<O>): CallToolResult {\n  const hasText = result.text !== undefined;\n  const text = result.text ?? JSON.stringify(result.structured);\n  const content: ContentBlock[] = [{ type: 'text' as const, text }, ...(result.resources ?? [])];\n  return {\n    content,\n    ...(hasText\n      ? // Safe because every `ToolDef.output` is a Zod object schema, so\n        // `structured` is always a plain object. Constraining `O` to prove it\n        // is not worth the cost: the bound has to thread through five generic\n        // sites and still loses to `exactOptionalPropertyTypes` variance on\n        // `RunResult`'s optional fields.\n        { _meta: result.structured as Record<string, unknown> }\n      : { structuredContent: result.structured }),\n    ...(result.isError ? { isError: true } : {}),\n  };\n}\n\nclass ToolExecutor<I extends z.ZodType, O extends z.ZodType> {\n  readonly signal: AbortSignal;\n  private readonly def: ToolDef<I, O>;\n  private readonly parsedArgs: z.infer<I>;\n  private readonly toolCtx: ToolCtx;\n\n  readonly #progressCtx: ProgressCtx;\n  readonly #mcpSink?: McpProgressSink;\n  readonly #progressSession: ProgressSession;\n\n  constructor(toolName: string, ctx: ToolCtx, def: ToolDef<I, O>, parsedArgs: z.infer<I>) {\n    this.def = def;\n    this.parsedArgs = parsedArgs;\n    this.signal = def.timeoutMs\n      ? AbortSignal.any([ctx.signal, AbortSignal.timeout(def.timeoutMs)])\n      : ctx.signal;\n    this.#progressCtx = def.progress ? def.progress(parsedArgs) : { label: def.title };\n    const token = ctx._meta?.progressToken;\n    if (token !== undefined && ctx.sendNotification !== undefined) {\n      this.#mcpSink = new McpProgressSink(toolName, token, ctx.sendNotification);\n    }\n    const isTest = process.env['NODE_ENV'] === 'test' || process.execArgv.includes('--test');\n    this.#progressSession = new ProgressSession({\n      label: this.#progressCtx.label,\n      ...(this.#mcpSink ? { sink: this.#mcpSink } : {}),\n      ...(isTest ? { rateLimitMs: 0 } : {}),\n    });\n    this.toolCtx = {\n      ...ctx,\n      signal: this.signal,\n      log: (level: LoggingLevel, data: unknown, logger?: string) => {\n        const msg = typeof data === 'string' ? data : String(data);\n        const prefix = logger ? `[${logger}] ` : '';\n        Logger.emit(level, `${prefix}${msg}`);\n      },\n      onProgress: (p) => {\n        this.#tick(p);\n      },\n    };\n  }\n\n  #tick(p: { current: number; total?: number }): void {\n    const tickCtx: ProgressCtx = {\n      ...this.#progressCtx,\n      current: p.current,\n      ...(p.total !== undefined ? { total: p.total } : {}),\n    };\n    this.#progressSession.set({ ...p, message: plainMessage('tick', tickCtx) });\n  }\n\n  async #flushProgress(): Promise<void> {\n    if (this.#mcpSink) await this.#mcpSink.flush();\n  }\n\n  private async completeProgress(result: z.infer<O>): Promise<void> {\n    const doneCtx: ProgressCtx = this.def.progressDone\n      ? { ...this.#progressCtx, ...this.def.progressDone(this.parsedArgs, result) }\n      : this.#progressCtx;\n    this.#progressSession.complete(plainMessage('done', doneCtx));\n    await this.#flushProgress();\n  }\n\n  private async failProgress(error: unknown): Promise<{ isError: true; content: ContentBlock[] }> {\n    const errMsg = formatUnknownErrorMessage(error);\n    const message = plainMessage('fail', { ...this.#progressCtx, error: errMsg });\n    this.#progressSession.fail(error, message);\n    await this.#flushProgress();\n    const { text: errorText } = Problem.toText(\n      error,\n      this.def.defaultErrorCode ?? ErrorCode.UNKNOWN,\n    );\n    return {\n      content: [{ type: 'text' as const, text: errorText }],\n      isError: true,\n    };\n  }\n\n  /**\n   * Access-grant pre-check (R7/R8/R9). Before `run` touches the filesystem,\n   * ask PathGuard which of the tool's declared paths are out-of-root and\n   * grantable. If any are and this round carries no verified `requestState`,\n   * return `input_required` (nothing is read or written — R7). On retry, the\n   * verified state must bind this grant set (R9); apply each accepted grant for\n   * the session (R8) and proceed. A declined or ungrantable path is left for\n   * `validateAccess` to fail closed during the operation. Returns `undefined`\n   * when no round-trip is needed and any applicable grants have been applied.\n   */\n  private async precheckGrant(): Promise<InputRequiredResult | undefined> {\n    const extract = this.def.accessPaths;\n    if (!extract) return undefined;\n    const paths = extract(this.parsedArgs);\n    if (paths.length === 0) return undefined;\n    const grantDirs = await this.toolCtx.fs.pathGuard.precheckAccess(paths);\n    if (grantDirs.length === 0) return undefined;\n\n    // One grant dir: a single boolean confirm. Multiple: one multi-select\n    // elicitation so the client picks the subset to allow in one round-trip\n    // (N dirs → 1 round-trip, not N). `pendingRoundTrip` still binds\n    // `paths: grantDirs` sorted, so R9 path-binding is unaffected.\n    const multi = grantDirs.length > 1;\n    const round = await pendingRoundTrip({\n      op: 'grant',\n      pending: grantDirs,\n      requestState: this.toolCtx.requestState,\n      clientCapabilities: this.toolCtx.clientCapabilities,\n      buildInputs: (dirs) =>\n        multi\n          ? [\n              multiSelectInput(\n                'grant',\n                'Grant filesystem access to these directories? Select the ones to allow.',\n                dirs.map((d) => ({ value: d, title: d })),\n              ),\n            ]\n          : dirs.map((dir, i) => ({\n              key: `confirm_${i}`,\n              message: `Grant filesystem access to \"${dir}\"?`,\n            })),\n    });\n    if (round !== undefined) return round;\n    // Apply accepted grants for the session (R8). Declined/missing dirs are\n    // skipped here; their paths fail with ACCESS_DENIED during the operation.\n    //\n    // No list-changed notification follows: a grant widens the allowed roots,\n    // and no resource list reads them. The instructions resource has a fixed\n    // URI, the result template lists the ResourceStore, and the file template\n    // lists nothing at all (see resources.ts). Notifying here only bought the\n    // client a round trip to re-fetch a list that could not have changed.\n    //\n    // `readAcceptedMultiChoice` does NOT validate against the offered choices\n    // (attacker-controlled inputResponses on re-entry). Only grant dirs that\n    // were actually offered by precheckAccess — a value outside grantDirs is\n    // ignored and fails closed in validateAccess. The single-select path reads\n    // `confirm_${i}` for `grantDirs[i]`, so the isSamePath filter is a no-op\n    // there; it only bites for the multi-select array.\n    const accepted = multi\n      ? (readAcceptedMultiChoice(this.toolCtx.inputResponses, 'grant') ?? [])\n      : grantDirs.filter((_dir, i) =>\n          readAcceptedConfirm(this.toolCtx.inputResponses, `confirm_${i}`),\n        );\n    for (const dir of accepted) {\n      if (!grantDirs.some((g) => isSamePath(g, dir))) continue;\n      await this.toolCtx.fs.pathGuard.applyGrant(dir);\n    }\n    return undefined;\n  }\n\n  async execute(): Promise<CallToolResult | InputRequiredResult> {\n    try {\n      // Access-grant pre-check before any filesystem touch (R7/R8/R9). A\n      // grant input_required short-circuits here (progress paused, not\n      // finished); an R9 mismatch throws, which this catch surfaces as an\n      // isError tool result like every other handler failure — not a raw\n      // JSON-RPC error (GRANT-1 impact #2).\n      const grantRequired = await this.precheckGrant();\n      if (grantRequired !== undefined) return grantRequired;\n      const result = await this.def.run(this.parsedArgs, this.toolCtx);\n      // input_required is a return value, not a completed call: the client\n      // retries the same tools/call carrying inputResponses, and this\n      // handler re-enters from the top. Skip the progress \"done\" close and\n      // return it verbatim — progress is paused, not finished.\n      if (isInputRequiredResult(result)) {\n        return result;\n      }\n      await this.completeProgress(result.structured);\n      return buildSuccessResponse(result);\n    } catch (error) {\n      return await this.failProgress(error);\n    } finally {\n      await this.#flushProgress();\n    }\n  }\n}\n\n/**\n * Validate with Zod while publishing the precomputed JSON Schema: clients get\n * draft-2020-12, handlers get Zod's coercions, defaults and error messages.\n *\n * Each validator instance is built for exactly one schema and handed straight\n * to `fromJsonSchema(thatSchema, ...)`, which calls `getValidator` once with\n * the same schema — so the argument is redundant here and deliberately ignored.\n * Reusing one instance across schemas would silently validate against `schema`.\n */\nfunction zodJsonSchemaValidator(schema: z.ZodType): jsonSchemaValidator {\n  return {\n    getValidator<U>(): JsonSchemaValidator<U> {\n      return (input: unknown) => {\n        const result = schema.safeParse(input);\n        if (result.success) {\n          return {\n            valid: true as const,\n            data: result.data as U,\n            errorMessage: undefined,\n          };\n        }\n        return {\n          valid: false as const,\n          data: undefined,\n          errorMessage: z.prettifyError(result.error),\n        };\n      };\n    },\n  };\n}\n\n/**\n * Generate the wire copy of a schema for `tools/list`. The Zod schema keeps\n * every constraint for runtime validation; the `override` pass only trims what\n * the wire copy costs every client at session start:\n *\n * - `$schema` and `title` carry no information the host uses.\n * - `maximum: Number.MAX_SAFE_INTEGER` is zod's int() artifact, not a bound.\n * - `examples` is dropped in both directions: on output it describes a field the\n *   server itself fills in, and on input every description that carried one\n *   already spells the same example out inline, so the keyword paid twice.\n *\n * Output `description`s are NOT dropped. They were, and the result was a wire\n * contract the model had to guess at: `delete` returns `path` XOR `paths`,\n * `edit.diff` appears only under dryRun, `read.value` has no required field at\n * all. None of that is inferable from types alone.\n *\n * No shared subschema carries a `.meta({ id })`, so zod inlines every one of\n * them and the emitted document has no `$defs`/`$ref` to dereference.\n */\nfunction toDraft202012(schema: z.ZodType, io: 'input' | 'output'): JsonSchemaType {\n  const generated = z.toJSONSchema(schema, {\n    target: 'draft-2020-12',\n    io,\n    override: ({ jsonSchema }) => {\n      const node = jsonSchema as Record<string, unknown>;\n      delete node['title'];\n      if (node['maximum'] === Number.MAX_SAFE_INTEGER) delete node['maximum'];\n      delete node['examples'];\n    },\n  }) as Record<string, unknown>;\n  delete generated['$schema'];\n  return generated;\n}\n\nexport function defineTool<I extends z.ZodType, O extends z.ZodType>(\n  def: ToolDef<I, O>,\n): DefinedTool {\n  const inputJsonSchema = toDraft202012(def.input, 'input');\n\n  // Nothing here depends on `deps`, so it is built once per tool definition\n  // rather than once per `register` — the HTTP leg registers every tool afresh\n  // on each request.\n  // Published annotations are derived, not passed through. `readOnlyHint` is\n  // load-bearing (MUTATING_TOOL_NAMES derives the --read-only gate from it) and\n  // `openWorldHint: false` is a real claim for a filesystem server. The other\n  // two describe behavior a read-only tool cannot have, and restate the default\n  // for a mutating one — 29 tokens per tool for nothing a client acts on.\n  const publishedAnnotations: ToolAnnotations = {\n    readOnlyHint: def.annotations.readOnlyHint,\n    openWorldHint: def.annotations.openWorldHint ?? false,\n    ...(def.annotations.readOnlyHint\n      ? {}\n      : { destructiveHint: def.annotations.destructiveHint ?? true }),\n  };\n\n  const toolDefShape = {\n    title: def.title,\n    description: def.description,\n    inputSchema: fromJsonSchema<z.infer<I>>(inputJsonSchema, zodJsonSchemaValidator(def.input)),\n    // No `outputSchema`, ever. Publishing one obliges the result to carry\n    // `structuredContent` (clients enforce it), and every tool that authors its\n    // own text ships its metadata under `_meta` instead — see\n    // `buildSuccessResponse`. The two cannot both hold, and the text is what\n    // the model reads. `TOOL-SURFACE-001` pins this for the whole surface.\n    //\n    // `def.output` stays: it types `RunResult<z.infer<O>>`, which is what makes\n    // a tool returning the wrong shape a compile error.\n    annotations: publishedAnnotations,\n  };\n\n  return {\n    name: def.name,\n    annotations: def.annotations,\n\n    register(deps: ToolDeps): RegisteredTool {\n      return deps.server.registerTool(def.name, toolDefShape, async (args, ctx) =>\n        new ToolExecutor<I, O>(def.name, toToolCtx(ctx, deps), def, args).execute(),\n      );\n    },\n  };\n}\n"]}

package/dist/tools/delete-file.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"delete-file.d.ts","sourceRoot":"","sources":["../../src/tools/delete-file.ts"],"names":[],"mappings":"AAoZA,eAAO,MAAM,WAAW,mCAwDtB,CAAC"}
+{"version":3,"file":"delete-file.d.ts","sourceRoot":"","sources":["../../src/tools/delete-file.ts"],"names":[],"mappings":"AA8YA,eAAO,MAAM,WAAW,mCAwDtB,CAAC"}

package/dist/tools/delete-file.js

@@ -198,27 +198,30 @@ async function handleDelete(args, ctx) {
     const paths = [...new Set(args.paths)];
     // Phase 1 (no mutation): plan every path.
     const planned = await processInParallel(paths, (inputPath) => planPath(inputPath, args, ctx.fs), PARALLEL_CONCURRENCY, ctx.signal);
+    const out = new Array(paths.length).fill(undefined);
     const plans = [];
-    const earlyFailures = [];
-    const earlyNoop = [];
-    for (const { value: r } of planned.results) {
+    for (const { index, value: r } of planned.results) {
         if (r.status === 'fail')
-            earlyFailures.push(r.failure);
+            out[index] = { path: r.failure.path, error: r.failure.error };
         else if (r.status === 'noop')
-            earlyNoop.push(r.item);
+            out[index] = { path: r.item.path, value: { deleted: true } };
         else
-            plans.push(r.plan);
+            plans.push({ plan: r.plan, index });
     }
     for (const { index, error } of planned.errors) {
-        const path = paths[index] ?? '(unknown)';
-        earlyFailures.push({ path, error: { code: ErrorCode.UNKNOWN, message: error.message } });
+        out[index] = {
+            path: paths[index] ?? '(unknown)',
+            error: { code: ErrorCode.UNKNOWN, message: error.message },
+        };
     }
     // Pending set: recursive + non-empty directories, sorted and de-duplicated.
     // `buildInputRequired` seals exactly this set into the requestState, and the
     // retried round recomputes it from the same args so a swapped retry (accept
     // for X, retry with Y) is rejected — the codec only proves the state was not
     // tampered, not that it matches the current request (R9).
-    const pendingSorted = [...new Set(plans.filter((p) => p.pending).map((p) => p.validPath))].sort();
+    const pendingSorted = [
+        ...new Set(plans.filter((p) => p.plan.pending).map((p) => p.plan.validPath)),
+    ].sort();
     if (pendingSorted.length > 0) {
         // Round 1 returns input_required (atomic — R14: nothing deleted yet, not
         // even the non-pending items in the same call); a retry whose verified
@@ -237,42 +240,34 @@ async function handleDelete(args, ctx) {
             return round;
     }
     // Phase 2 (mutation): execute deletions for every planned path.
-    const executed = await processInParallel(plans, (plan) => executePlan(plan, args, ctx, pendingSorted), PARALLEL_CONCURRENCY, ctx.signal);
-    // Collect by path first, then emit in the caller's input order so
-    // `results[i]` lines up with `paths[i]` the way read/stat guarantee.
-    const byPath = new Map();
-    const record = (path, entry) => {
-        byPath.set(path, entry);
-    };
-    for (const n of earlyNoop)
-        record(n.path, { path: n.path, value: { deleted: true } });
-    for (const f of earlyFailures)
-        record(f.path, { path: f.path, error: f.error });
-    for (const { value: r } of executed.results) {
+    const executed = await processInParallel(plans, ({ plan }) => executePlan(plan, args, ctx, pendingSorted), PARALLEL_CONCURRENCY, ctx.signal);
+    for (const { index, value: r } of executed.results) {
+        const slot = plans[index]?.index;
+        if (slot === undefined)
+            continue;
         if ('skipped' in r) {
-            record(r.path, { path: r.path, value: { deleted: false } });
+            out[slot] = { path: r.path, value: { deleted: false } };
         }
         else if ('failure' in r) {
-            record(r.failure.path, { path: r.failure.path, error: r.failure.error });
+            out[slot] = { path: r.failure.path, error: r.failure.error };
         }
         else if (r.item.path) {
-            record(r.item.path, { path: r.item.path, value: { deleted: true } });
+            out[slot] = { path: r.item.path, value: { deleted: true } };
         }
     }
     for (const { index, error } of executed.errors) {
-        const plan = plans[index];
-        const path = plan?.validPath ?? '(unknown)';
-        record(path, {
-            path,
+        const slot = plans[index]?.index;
+        if (slot === undefined)
+            continue;
+        out[slot] = {
+            path: paths[slot] ?? '(unknown)',
             error: { code: ErrorCode.UNKNOWN, message: error.message },
-        });
+        };
     }
-    // A plan's `validPath` is the resolved absolute path, so a requested relative
-    // path will not find itself in the map by name — fall back through the plan.
-    const planByRequested = new Map(plans.map((p) => [p.inputPath, p.validPath]));
-    const results = paths.map((requested) => {
-        const resolved = planByRequested.get(requested);
-        const entry = byPath.get(requested) ?? (resolved !== undefined ? byPath.get(resolved) : undefined);
+    // Emit in the caller's input order so `results[i]` lines up with `paths[i]`
+    // the way read/stat guarantee.
+    const results = paths.map((requested, i) => {
+        const entry = out[i];
         return (entry ?? {
             path: requested,
             error: { code: ErrorCode.UNKNOWN, message: 'Unknown delete failure' },

package/dist/tools/delete-file.js.map

@@ -1 +1 @@
-{"version":3,"file":"delete-file.js","sourceRoot":"","sources":["../../src/tools/delete-file.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EACL,SAAS,EACT,OAAO,EACP,SAAS,EACT,WAAW,EACX,eAAe,EACf,OAAO,GACR,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEvD,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EACL,mBAAmB,EACnB,sBAAsB,EACtB,kBAAkB,EAClB,YAAY,GACb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,iBAAiB,GAAG,CAAC,CAAC,YAAY,CAAC;IACvC,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,IAAI,CAAC;SACT,QAAQ,CAAC,qEAAqE,CAAC;IAClF,SAAS,EAAE,mBAAmB,CAC5B,4EAA4E,CAC7E;IACD,iBAAiB,EAAE,mBAAmB,CACpC,yEAAyE,CAC1E;CACF,CAAC,CAAC;AAEH,MAAM,wBAAwB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC9C,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,gEAAgE,CAAC;CAChG,CAAC,CAAC;AAEH,MAAM,mBAAmB,GAAG,CAAC,CAAC,YAAY,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;IAC3C,KAAK,EAAE,wBAAwB,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;IACzF,KAAK,EAAE,kBAAkB,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,mCAAmC,CAAC;CACnF,CAAC,CAAC;AAEH,2EAA2E;AAC3E,+EAA+E;AAC/E,+EAA+E;AAC/E,gFAAgF;AAChF,uBAAuB;AACvB,MAAM,kBAAkB,GAAG,CAAC,CAAC,YAAY,CAAC;IACxC,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,mBAAmB,CAAC;SAC1B,QAAQ,CAAC,mDAAmD,CAAC;IAChE,OAAO,EAAE,sBAAsB;CAChC,CAAC,CAAC;AAeH,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;AAE7E,SAAS,eAAe,CAAC,IAAY,EAAE,KAAc;IACnD,8EAA8E;IAC9E,2EAA2E;IAC3E,4EAA4E;IAC5E,gBAAgB;IAChB,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CACxB,IAAI,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE,IAAI,CAAC,EACxD,SAAS,CAAC,SAAS,EACnB,IAAI,CACL;SACF,CAAC;IACJ,CAAC;IACD,IACE,WAAW,CAAC,KAAK,CAAC;QAClB,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,EAClF,CAAC;QACD,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;SACzE,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAC9E,CAAC;AAoBD;;;;GAIG;AACH,KAAK,UAAU,QAAQ,CACrB,SAAiB,EACjB,IAA0D,EAC1D,EAA2E;IAE3E,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IACE,IAAI,CAAC,iBAAiB;YACtB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,EACpF,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;QACvD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,IAAI,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1C,OAAO;YACL,MAAM,EAAE,MAAM;YACd,2EAA2E;YAC3E,0EAA0E;YAC1E,sBAAsB;YACtB,OAAO,EAAE;gBACP,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,oDAAoD,EAAE;oBAChF,IAAI,EAAE,SAAS;iBAChB,CAAC;aACH;SACF,CAAC;IACJ,CAAC;IAED,IAAI,UAAuB,CAAC;IAC5B,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;QACvD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,IAAI,IAAI,CAAC,SAAS,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,WAAW,GAAG,MAAM,EAAE,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,WAAW,CAAC;IAC5B,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;AAC3F,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,IAA0D,EAC1D,WAAoB,EACpB,KAA8C;IAE9C,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE;YACxB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,IAAI,CAAC,iBAAiB;SAC9B,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,gBAAgB,CAC7B,IAAgB,EAChB,IAA0D,EAC1D,GAAgC;IAEhC,IAAI,YAAyB,CAAC;IAC9B,IAAI,CAAC;QACH,YAAY,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;QAC5C,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC7D,uEAAuE;IACvE,4EAA4E;IAC5E,uEAAuE;IACvE,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,eAAe,GACnB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,KAAK,CAAC,GAAG;QACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,KAAK,CAAC,GAAG;QACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,KAAK,YAAY,CAAC,KAAK,CAAC,WAAW,CAAC;IACvE,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAC,EAAE,CAAC;QACxF,OAAO;YACL,OAAO,EAAE;gBACP,IAAI,EAAE,IAAI,CAAC,SAAS;gBACpB,KAAK,EAAE,OAAO,CAAC,YAAY,CACzB,yCAAyC,IAAI,CAAC,QAAQ,OAAO,eAAe,uBAAuB,EACnG,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;aACF;SACF,CAAC;IACJ,CAAC;IAED,IAAI,CAAC;QACH,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACxF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,QAAQ,CAAC,CAAC;IACrD,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,WAAW,CACxB,IAAgB,EAChB,IAA0D,EAC1D,GAAmD,EACnD,aAAgC;IAEhC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,WAAW,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAa,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,OAAO;gBACL,OAAO,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,SAAS;oBACpB,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,wDAAwD,EAAE;wBACjF,IAAI,EAAE,IAAI,CAAC,SAAS;qBACrB,CAAC;iBACH;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC3C,CAAC;AAED,KAAK,UAAU,YAAY,CACzB,IAAiB,EACjB,GAAY;IAEZ,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEvC,0CAA0C;IAC1C,MAAM,OAAO,GAAG,MAAM,iBAAiB,CACrC,KAAK,EACL,CAAC,SAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAChD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,aAAa,GAAoB,EAAE,CAAC;IAC1C,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,KAAK,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3C,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;aAClD,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;;YAChD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC;QACzC,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAC3F,CAAC;IAED,4EAA4E;IAC5E,6EAA6E;IAC7E,4EAA4E;IAC5E,6EAA6E;IAC7E,0DAA0D;IAC1D,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAElG,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,yEAAyE;QACzE,uEAAuE;QACvE,2EAA2E;QAC3E,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE,EAAE,QAAQ;YACZ,OAAO,EAAE,aAAa;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;YAC1C,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAClB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACd,WAAW,CACT,WAAW,CAAC,EAAE,EACd,uBAAuB,CAAC,gDAAgD,EACxE;gBACE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE;gBACpC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;aACjC,CACF,CACF;SACJ,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CACtC,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,CAAC,EACrD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,kEAAkE;IAClE,qEAAqE;IACrE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA+B,CAAC;IACtD,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,KAA0B,EAAQ,EAAE;QAChE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IACtF,KAAK,MAAM,CAAC,IAAI,aAAa;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAChF,KAAK,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC5C,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3E,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACvB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,EAAE,SAAS,IAAI,WAAW,CAAC;QAC5C,MAAM,CAAC,IAAI,EAAE;YACX,IAAI;YACJ,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC9E,MAAM,OAAO,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;QAC7D,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAChD,MAAM,KAAK,GACT,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACvF,OAAO,CACL,KAAK,IAAI;YACP,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE;SACtE,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IACnE,OAAO;QACL,OAAO;QACP,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,WAAW,GAAG,UAAU,CAAC;IACpC,IAAI,EAAE,QAAQ;IACd,KAAK,EAAE,aAAa;IACpB,WAAW,EACT,mHAAmH;QACnH,oDAAoD;QACpD,qGAAqG;QACrG,oFAAoF;QACpF,oEAAoE;QACpE,+CAA+C;IACjD,KAAK,EAAE,iBAAiB;IACxB,MAAM,EAAE,kBAAkB;IAC1B,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,gBAAgB,EAAE,SAAS,CAAC,OAAO;IACnC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,QAAQ;QACf,OAAO,EACL,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACrB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ;KAC3C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACtC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,UAAU,CAAC;YAAE,OAAO,UAAU,CAAC;QACzD,uEAAuE;QACvE,wEAAwE;QACxE,+BAA+B;QAC/B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC;QAC7C,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACnD,6EAA6E;QAC7E,0EAA0E;QAC1E,mEAAmE;QACnE,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,OAAO;gBACL,UAAU;gBACV,IAAI,EAAE,WAAW,IAAI,EAAE,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,KAAK,EAAE,OAAO,IAAI,eAAe,EAAE;gBACvF,OAAO;aACR,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC,KAAK;gBAAE,OAAO,GAAG,KAAK,SAAS,CAAC;YACtC,OAAO,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC;IAChF,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.js';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  isNotFoundErrno,\n  Problem,\n} from '../core/errors.js';\nimport { joinRoster, pathLabel } from '../core/fmt.js';\nimport type { FileType, GuardedFileSystem } from '../core/fs.js';\nimport { choiceInput, pendingRoundTrip, readAcceptedChoice } from '../core/input-required.js';\nimport { resolveEntryType } from '../core/primitives.js';\nimport {\n  defaultFalseBoolean,\n  OperationSummarySchema,\n  PerFileErrorSchema,\n  RequiredPath,\n} from '../core/schema.js';\nimport { PARALLEL_CONCURRENCY } from '../core/util.js';\nimport { isTotalFailure } from './batch.js';\nimport type { ToolCtx } from './define.js';\nimport { defineTool } from './define.js';\n\nconst DeleteInputSchema = z.strictObject({\n  paths: z\n    .array(RequiredPath)\n    .min(1)\n    .max(1000)\n    .describe('Paths to delete (max 1000); accepts files, directories, or symlinks'),\n  recursive: defaultFalseBoolean(\n    'Delete directory contents recursively (required for non-empty directories)',\n  ),\n  ignoreIfNotExists: defaultFalseBoolean(\n    'Silently succeed if a path does not exist instead of returning an error',\n  ),\n});\n\nconst DeletePerPathValueSchema = z.strictObject({\n  deleted: z.boolean().describe('True when the path was removed; false when the user chose Skip'),\n});\n\nconst DeletePerPathSchema = z.strictObject({\n  path: z.string().describe('Requested path'),\n  value: DeletePerPathValueSchema.optional().describe('Delete outcome; present on success'),\n  error: PerFileErrorSchema.optional().describe('Error details; present on failure'),\n});\n\n// One envelope for every batch tool: `read` and `stat` already answer with\n// `{ results, summary }`, so `delete` does too. The old shape switched between\n// `{ ok, path }` and `{ ok: false, failures }` depending on the outcome, which\n// left a caller parsing two schemas for one tool and never named the paths in a\n// multi-delete's text.\nconst DeleteOutputSchema = z.strictObject({\n  results: z\n    .array(DeletePerPathSchema)\n    .describe('Per-path results ordered to match the input paths'),\n  summary: OperationSummarySchema,\n});\n\ntype DeleteInput = z.infer<typeof DeleteInputSchema>;\ntype DeleteOutput = z.infer<typeof DeleteOutputSchema>;\ntype DeletePerPathResult = z.infer<typeof DeletePerPathSchema>;\n\n// Internal types for error handling\ninterface DeletedItem {\n  path: string;\n}\ninterface DeleteFailure {\n  path: string;\n  error: Problem;\n}\n\nconst ERR_NOT_EMPTY = new Error('Directory not empty. Set recursive: true.');\n\nfunction toDeleteFailure(path: string, error: unknown): DeleteFailure {\n  // A missing path reached here as the raw errno text (\"ENOENT: no such file or\n  // directory, lstat 'c:\\...'\"), while `stat` reported the same condition as\n  // \"Path not found\". One condition, one message — and the syscall name stays\n  // off the wire.\n  if (isNotFoundErrno(error)) {\n    return {\n      path,\n      error: Problem.fromUnknown(\n        new FsError(ErrorCode.NOT_FOUND, 'Path not found', path),\n        ErrorCode.NOT_FOUND,\n        path,\n      ),\n    };\n  }\n  if (\n    isNodeError(error) &&\n    (error.code === 'ENOTEMPTY' || error.code === 'EISDIR' || error.code === 'EEXIST')\n  ) {\n    return {\n      path,\n      error: Problem.fromUnknown(ERR_NOT_EMPTY, ErrorCode.INVALID_INPUT, path),\n    };\n  }\n  return { path, error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, path) };\n}\n\ntype LstatResult = Awaited<ReturnType<GuardedFileSystem['lstat']>>;\ntype ItemType = FileType;\n\n/** A path's pre-checked plan: validated, statted, and flagged if it needs confirmation. */\ninterface DeletePlan {\n  inputPath: string;\n  validPath: string;\n  itemType: ItemType;\n  firstStats: LstatResult;\n  /** Recursive + non-empty directory: needs a round-trip confirmation. */\n  pending: boolean;\n}\n\ntype PlanResult =\n  | { status: 'fail'; failure: DeleteFailure }\n  | { status: 'noop'; item: DeletedItem }\n  | { status: 'plan'; plan: DeletePlan };\n\n/**\n * Phase 1 (no mutation): validate, stat, and decide whether a path needs a\n * confirmation before anything is deleted. A pending path is a recursive\n * non-empty directory; everything else is ready to delete directly.\n */\nasync function planPath(\n  inputPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  fs: Pick<GuardedFileSystem, 'pathGuard' | 'lstat' | 'hasChildrenUnchecked'>,\n): Promise<PlanResult> {\n  let validPath: string;\n  try {\n    validPath = await fs.pathGuard.validatePathForDelete(inputPath);\n  } catch (error) {\n    if (\n      args.ignoreIfNotExists &&\n      ((isFsError(error) && error.code === ErrorCode.NOT_FOUND) || isNotFoundErrno(error))\n    ) {\n      return { status: 'noop', item: { path: inputPath } };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  if (fs.pathGuard.isAllowedRoot(validPath)) {\n    return {\n      status: 'fail',\n      // Keyed by the REQUESTED path, like every other failure here: handleDelete\n      // orders results by input path, and a resolved key would not be found for\n      // a relative request.\n      failure: {\n        path: inputPath,\n        error: Problem.accessDenied('Deleting a workspace root directory is not allowed', {\n          path: validPath,\n        }),\n      },\n    };\n  }\n\n  let firstStats: LstatResult;\n  try {\n    firstStats = await fs.lstat(validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { status: 'noop', item: { path: inputPath } };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  const itemType = resolveEntryType(firstStats.stats);\n  let hasChildren = false;\n  if (args.recursive && itemType === 'directory') {\n    try {\n      hasChildren = await fs.hasChildrenUnchecked(validPath);\n    } catch (error) {\n      return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n    }\n  }\n  const pending = hasChildren;\n  return { status: 'plan', plan: { inputPath, validPath, itemType, firstStats, pending } };\n}\n\nasync function performDeletion(\n  validPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  isDirectory: boolean,\n  fsOps: Pick<GuardedFileSystem, 'rm' | 'rmdir'>,\n): Promise<void> {\n  if (isDirectory && !args.recursive) {\n    await fsOps.rmdir(validPath);\n  } else {\n    await fsOps.rm(validPath, {\n      recursive: args.recursive,\n      force: args.ignoreIfNotExists,\n    });\n  }\n}\n\n/**\n * Phase 2 (mutation): TOCTOU re-stat against the plan's first stat, then\n * delete. A type or identity change across the confirmation gap fails closed\n * rather than deleting a replacement object the user never confirmed.\n */\nasync function finalizeDeletion(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'log'>,\n): Promise<{ item: DeletedItem } | { failure: DeleteFailure }> {\n  let currentStats: LstatResult;\n  try {\n    currentStats = await ctx.fs.lstat(plan.validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { item: { path: plan.validPath } };\n    }\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  const currentItemType = resolveEntryType(currentStats.stats);\n  // Identity comparison, not just the coarse category: a swap during the\n  // confirmation gap (delete original, create a same-named replacement) keeps\n  // the type but changes dev/ino/birthtimeMs. birthtimeMs is the primary\n  // cross-platform signal — dev/ino can read 0 on some non-POSIX drivers — so\n  // combine all three rather than trusting dev/ino alone.\n  const identityChanged =\n    plan.firstStats.stats.dev !== currentStats.stats.dev ||\n    plan.firstStats.stats.ino !== currentStats.stats.ino ||\n    plan.firstStats.stats.birthtimeMs !== currentStats.stats.birthtimeMs;\n  if (plan.itemType !== 'other' && (currentItemType !== plan.itemType || identityChanged)) {\n    return {\n      failure: {\n        path: plan.validPath,\n        error: Problem.invalidInput(\n          `Delete failed: item type changed from ${plan.itemType} to ${currentItemType} during confirmation.`,\n          { path: plan.validPath },\n        ),\n      },\n    };\n  }\n\n  try {\n    await performDeletion(plan.validPath, args, currentStats.stats.isDirectory(), ctx.fs);\n  } catch (error) {\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  ctx.log?.('info', `rm: ${plan.inputPath}`, 'delete');\n  return { item: { path: plan.validPath } };\n}\n\n/**\n * Execute one planned path on the retry round. A pending path deletes only on\n * an accepted `confirm: true`; decline, cancel, or a missing key report\n * `CANCELLED` for that path (R3 proceed, R4/R5 cancelled). A non-pending path\n * deletes directly (R14: non-pending items proceed alongside accepted ones).\n */\nasync function executePlan(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'inputResponses' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<{ item: DeletedItem } | { failure: DeleteFailure } | { skipped: true; path: string }> {\n  if (plan.pending) {\n    const key = `confirm_${pendingSorted.indexOf(plan.validPath)}`;\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: true as const, path: plan.validPath };\n    }\n    if (choice !== 'delete') {\n      return {\n        failure: {\n          path: plan.validPath,\n          error: Problem.cancelled('Delete cancelled: confirmation was declined or missing', {\n            path: plan.validPath,\n          }),\n        },\n      };\n    }\n  }\n  return finalizeDeletion(plan, args, ctx);\n}\n\nasync function handleDelete(\n  args: DeleteInput,\n  ctx: ToolCtx,\n): Promise<DeleteOutput | InputRequiredResult> {\n  // Duplicate paths collapse: results are keyed by path, so a repeated entry\n  // would emit two rows for one deletion and inflate `summary.total`.\n  const paths = [...new Set(args.paths)];\n\n  // Phase 1 (no mutation): plan every path.\n  const planned = await processInParallel(\n    paths,\n    (inputPath) => planPath(inputPath, args, ctx.fs),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  const plans: DeletePlan[] = [];\n  const earlyFailures: DeleteFailure[] = [];\n  const earlyNoop: DeletedItem[] = [];\n  for (const { value: r } of planned.results) {\n    if (r.status === 'fail') earlyFailures.push(r.failure);\n    else if (r.status === 'noop') earlyNoop.push(r.item);\n    else plans.push(r.plan);\n  }\n  for (const { index, error } of planned.errors) {\n    const path = paths[index] ?? '(unknown)';\n    earlyFailures.push({ path, error: { code: ErrorCode.UNKNOWN, message: error.message } });\n  }\n\n  // Pending set: recursive + non-empty directories, sorted and de-duplicated.\n  // `buildInputRequired` seals exactly this set into the requestState, and the\n  // retried round recomputes it from the same args so a swapped retry (accept\n  // for X, retry with Y) is rejected — the codec only proves the state was not\n  // tampered, not that it matches the current request (R9).\n  const pendingSorted = [...new Set(plans.filter((p) => p.pending).map((p) => p.validPath))].sort();\n\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required (atomic — R14: nothing deleted yet, not\n    // even the non-pending items in the same call); a retry whose verified\n    // state does not bind this pending set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip({\n      op: 'delete',\n      pending: pendingSorted,\n      requestState: ctx.requestState,\n      clientCapabilities: ctx.clientCapabilities,\n      buildInputs: (ps) =>\n        ps.map((p, i) =>\n          choiceInput(\n            `confirm_${i}`,\n            `Permanently delete \"${p}\" and all its contents? This cannot be undone.`,\n            [\n              { value: 'delete', title: 'Delete' },\n              { value: 'skip', title: 'Skip' },\n            ],\n          ),\n        ),\n    });\n    if (round !== undefined) return round;\n  }\n\n  // Phase 2 (mutation): execute deletions for every planned path.\n  const executed = await processInParallel(\n    plans,\n    (plan) => executePlan(plan, args, ctx, pendingSorted),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  // Collect by path first, then emit in the caller's input order so\n  // `results[i]` lines up with `paths[i]` the way read/stat guarantee.\n  const byPath = new Map<string, DeletePerPathResult>();\n  const record = (path: string, entry: DeletePerPathResult): void => {\n    byPath.set(path, entry);\n  };\n  for (const n of earlyNoop) record(n.path, { path: n.path, value: { deleted: true } });\n  for (const f of earlyFailures) record(f.path, { path: f.path, error: f.error });\n  for (const { value: r } of executed.results) {\n    if ('skipped' in r) {\n      record(r.path, { path: r.path, value: { deleted: false } });\n    } else if ('failure' in r) {\n      record(r.failure.path, { path: r.failure.path, error: r.failure.error });\n    } else if (r.item.path) {\n      record(r.item.path, { path: r.item.path, value: { deleted: true } });\n    }\n  }\n  for (const { index, error } of executed.errors) {\n    const plan = plans[index];\n    const path = plan?.validPath ?? '(unknown)';\n    record(path, {\n      path,\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    });\n  }\n\n  // A plan's `validPath` is the resolved absolute path, so a requested relative\n  // path will not find itself in the map by name — fall back through the plan.\n  const planByRequested = new Map(plans.map((p) => [p.inputPath, p.validPath]));\n  const results: DeletePerPathResult[] = paths.map((requested) => {\n    const resolved = planByRequested.get(requested);\n    const entry =\n      byPath.get(requested) ?? (resolved !== undefined ? byPath.get(resolved) : undefined);\n    return (\n      entry ?? {\n        path: requested,\n        error: { code: ErrorCode.UNKNOWN, message: 'Unknown delete failure' },\n      }\n    );\n  });\n\n  const failed = results.filter((r) => r.error !== undefined).length;\n  return {\n    results,\n    summary: { total: results.length, succeeded: results.length - failed, failed },\n  };\n}\n\nexport const DELETE_FILE = defineTool({\n  name: 'delete',\n  title: 'Delete File',\n  description:\n    'Permanently delete one or more files, directories, or symlinks (max 1000 per call). This action is irreversible. ' +\n    'Pass paths: [...] — there is no single-path form. ' +\n    'Non-empty directories require recursive=true and additionally prompt the user to confirm each one, ' +\n    'so the call returns without deleting anything until that confirmation comes back; ' +\n    'a client that cannot prompt gets an error naming the alternative. ' +\n    'Workspace root directories cannot be deleted.',\n  input: DeleteInputSchema,\n  output: DeleteOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    idempotentHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  defaultErrorCode: ErrorCode.UNKNOWN,\n  progress: (args) => ({\n    label: 'Delete',\n    subject:\n      args.paths.length === 1\n        ? basename(args.paths[0] ?? '')\n        : `${String(args.paths.length)} paths`,\n  }),\n  accessPaths: (args) => [...args.paths],\n  run: async (args, ctx) => {\n    const structured = await handleDelete(args, ctx);\n    // input_required is a return value, not a completed call: surface it\n    // verbatim so the executor short-circuits before building a CallToolResult.\n    if (isInputRequiredResult(structured)) return structured;\n    // Name every path and its outcome. The old text said \"deleted 2 paths\"\n    // without saying which two, so a partial failure was unreadable without\n    // parsing the structured half.\n    const { failed, total } = structured.summary;\n    const isError = isTotalFailure(structured.summary);\n    // A lone failure carries its reason in the text. \"delete: . FAILED (0/1 ok)\"\n    // made the model re-read structuredContent to learn it was ACCESS_DENIED;\n    // with one path there is no ambiguity about which message applies.\n    if (total === 1 && failed === 1) {\n      const only = structured.results[0];\n      return {\n        structured,\n        text: `delete: ${only?.path ?? ''} FAILED — ${only?.error?.message ?? 'unknown error'}`,\n        isError,\n      };\n    }\n    const tokens = structured.results.map((r) => {\n      const label = pathLabel(r.path);\n      if (r.error) return `${label} FAILED`;\n      return r.value?.deleted ? label : `${label} SKIPPED`;\n    });\n    const ratio = failed > 0 ? ` (${String(total - failed)}/${String(total)} ok)` : '';\n    return { structured, text: `delete: ${joinRoster(tokens)}${ratio}`, isError };\n  },\n});\n"]}
+{"version":3,"file":"delete-file.js","sourceRoot":"","sources":["../../src/tools/delete-file.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EACL,SAAS,EACT,OAAO,EACP,SAAS,EACT,WAAW,EACX,eAAe,EACf,OAAO,GACR,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEvD,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EACL,mBAAmB,EACnB,sBAAsB,EACtB,kBAAkB,EAClB,YAAY,GACb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,iBAAiB,GAAG,CAAC,CAAC,YAAY,CAAC;IACvC,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,IAAI,CAAC;SACT,QAAQ,CAAC,qEAAqE,CAAC;IAClF,SAAS,EAAE,mBAAmB,CAC5B,4EAA4E,CAC7E;IACD,iBAAiB,EAAE,mBAAmB,CACpC,yEAAyE,CAC1E;CACF,CAAC,CAAC;AAEH,MAAM,wBAAwB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC9C,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,gEAAgE,CAAC;CAChG,CAAC,CAAC;AAEH,MAAM,mBAAmB,GAAG,CAAC,CAAC,YAAY,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;IAC3C,KAAK,EAAE,wBAAwB,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;IACzF,KAAK,EAAE,kBAAkB,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,mCAAmC,CAAC;CACnF,CAAC,CAAC;AAEH,2EAA2E;AAC3E,+EAA+E;AAC/E,+EAA+E;AAC/E,gFAAgF;AAChF,uBAAuB;AACvB,MAAM,kBAAkB,GAAG,CAAC,CAAC,YAAY,CAAC;IACxC,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,mBAAmB,CAAC;SAC1B,QAAQ,CAAC,mDAAmD,CAAC;IAChE,OAAO,EAAE,sBAAsB;CAChC,CAAC,CAAC;AAeH,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;AAE7E,SAAS,eAAe,CAAC,IAAY,EAAE,KAAc;IACnD,8EAA8E;IAC9E,2EAA2E;IAC3E,4EAA4E;IAC5E,gBAAgB;IAChB,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CACxB,IAAI,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE,IAAI,CAAC,EACxD,SAAS,CAAC,SAAS,EACnB,IAAI,CACL;SACF,CAAC;IACJ,CAAC;IACD,IACE,WAAW,CAAC,KAAK,CAAC;QAClB,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,EAClF,CAAC;QACD,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;SACzE,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAC9E,CAAC;AAoBD;;;;GAIG;AACH,KAAK,UAAU,QAAQ,CACrB,SAAiB,EACjB,IAA0D,EAC1D,EAA2E;IAE3E,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IACE,IAAI,CAAC,iBAAiB;YACtB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,EACpF,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;QACvD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,IAAI,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1C,OAAO;YACL,MAAM,EAAE,MAAM;YACd,2EAA2E;YAC3E,0EAA0E;YAC1E,sBAAsB;YACtB,OAAO,EAAE;gBACP,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,oDAAoD,EAAE;oBAChF,IAAI,EAAE,SAAS;iBAChB,CAAC;aACH;SACF,CAAC;IACJ,CAAC;IAED,IAAI,UAAuB,CAAC;IAC5B,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC;QACvD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,IAAI,IAAI,CAAC,SAAS,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,WAAW,GAAG,MAAM,EAAE,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,WAAW,CAAC;IAC5B,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;AAC3F,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,IAA0D,EAC1D,WAAoB,EACpB,KAA8C;IAE9C,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE;YACxB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,IAAI,CAAC,iBAAiB;SAC9B,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,gBAAgB,CAC7B,IAAgB,EAChB,IAA0D,EAC1D,GAAgC;IAEhC,IAAI,YAAyB,CAAC;IAC9B,IAAI,CAAC;QACH,YAAY,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;QAC5C,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC7D,uEAAuE;IACvE,4EAA4E;IAC5E,uEAAuE;IACvE,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,eAAe,GACnB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,KAAK,CAAC,GAAG;QACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,KAAK,CAAC,GAAG;QACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,KAAK,YAAY,CAAC,KAAK,CAAC,WAAW,CAAC;IACvE,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAC,EAAE,CAAC;QACxF,OAAO;YACL,OAAO,EAAE;gBACP,IAAI,EAAE,IAAI,CAAC,SAAS;gBACpB,KAAK,EAAE,OAAO,CAAC,YAAY,CACzB,yCAAyC,IAAI,CAAC,QAAQ,OAAO,eAAe,uBAAuB,EACnG,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;aACF;SACF,CAAC;IACJ,CAAC;IAED,IAAI,CAAC;QACH,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACxF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,QAAQ,CAAC,CAAC;IACrD,OAAO,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,WAAW,CACxB,IAAgB,EAChB,IAA0D,EAC1D,GAAmD,EACnD,aAAgC;IAEhC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,WAAW,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAa,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,OAAO;gBACL,OAAO,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,SAAS;oBACpB,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,wDAAwD,EAAE;wBACjF,IAAI,EAAE,IAAI,CAAC,SAAS;qBACrB,CAAC;iBACH;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC3C,CAAC;AAED,KAAK,UAAU,YAAY,CACzB,IAAiB,EACjB,GAAY;IAEZ,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEvC,0CAA0C;IAC1C,MAAM,OAAO,GAAG,MAAM,iBAAiB,CACrC,KAAK,EACL,CAAC,SAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAChD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,KAAK,CAAkC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrF,MAAM,KAAK,GAA0C,EAAE,CAAC;IACxD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;aAClF,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;;YACtF,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3C,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9C,GAAG,CAAC,KAAK,CAAC,GAAG;YACX,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,WAAW;YACjC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,6EAA6E;IAC7E,4EAA4E;IAC5E,6EAA6E;IAC7E,0DAA0D;IAC1D,MAAM,aAAa,GAAG;QACpB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;KAC7E,CAAC,IAAI,EAAE,CAAC;IAET,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,yEAAyE;QACzE,uEAAuE;QACvE,2EAA2E;QAC3E,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE,EAAE,QAAQ;YACZ,OAAO,EAAE,aAAa;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;YAC1C,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAClB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACd,WAAW,CACT,WAAW,CAAC,EAAE,EACd,uBAAuB,CAAC,gDAAgD,EACxE;gBACE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE;gBACpC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;aACjC,CACF,CACF;SACJ,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CACtC,KAAK,EACL,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,CAAC,EACzD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,CAAC;aAAM,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAC/D,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,GAAG,CAAC,IAAI,CAAC,GAAG;YACV,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,WAAW;YAChC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,+BAA+B;IAC/B,MAAM,OAAO,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;QAChE,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,CACL,KAAK,IAAI;YACP,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE;SACtE,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IACnE,OAAO;QACL,OAAO;QACP,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,WAAW,GAAG,UAAU,CAAC;IACpC,IAAI,EAAE,QAAQ;IACd,KAAK,EAAE,aAAa;IACpB,WAAW,EACT,mHAAmH;QACnH,oDAAoD;QACpD,qGAAqG;QACrG,oFAAoF;QACpF,oEAAoE;QACpE,+CAA+C;IACjD,KAAK,EAAE,iBAAiB;IACxB,MAAM,EAAE,kBAAkB;IAC1B,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,gBAAgB,EAAE,SAAS,CAAC,OAAO;IACnC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,QAAQ;QACf,OAAO,EACL,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACrB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ;KAC3C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACtC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,UAAU,CAAC;YAAE,OAAO,UAAU,CAAC;QACzD,uEAAuE;QACvE,wEAAwE;QACxE,+BAA+B;QAC/B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC;QAC7C,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACnD,6EAA6E;QAC7E,0EAA0E;QAC1E,mEAAmE;QACnE,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,OAAO;gBACL,UAAU;gBACV,IAAI,EAAE,WAAW,IAAI,EAAE,IAAI,IAAI,EAAE,aAAa,IAAI,EAAE,KAAK,EAAE,OAAO,IAAI,eAAe,EAAE;gBACvF,OAAO;aACR,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC,KAAK;gBAAE,OAAO,GAAG,KAAK,SAAS,CAAC;YACtC,OAAO,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC;IAChF,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.js';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  isNotFoundErrno,\n  Problem,\n} from '../core/errors.js';\nimport { joinRoster, pathLabel } from '../core/fmt.js';\nimport type { FileType, GuardedFileSystem } from '../core/fs.js';\nimport { choiceInput, pendingRoundTrip, readAcceptedChoice } from '../core/input-required.js';\nimport { resolveEntryType } from '../core/primitives.js';\nimport {\n  defaultFalseBoolean,\n  OperationSummarySchema,\n  PerFileErrorSchema,\n  RequiredPath,\n} from '../core/schema.js';\nimport { PARALLEL_CONCURRENCY } from '../core/util.js';\nimport { isTotalFailure } from './batch.js';\nimport type { ToolCtx } from './define.js';\nimport { defineTool } from './define.js';\n\nconst DeleteInputSchema = z.strictObject({\n  paths: z\n    .array(RequiredPath)\n    .min(1)\n    .max(1000)\n    .describe('Paths to delete (max 1000); accepts files, directories, or symlinks'),\n  recursive: defaultFalseBoolean(\n    'Delete directory contents recursively (required for non-empty directories)',\n  ),\n  ignoreIfNotExists: defaultFalseBoolean(\n    'Silently succeed if a path does not exist instead of returning an error',\n  ),\n});\n\nconst DeletePerPathValueSchema = z.strictObject({\n  deleted: z.boolean().describe('True when the path was removed; false when the user chose Skip'),\n});\n\nconst DeletePerPathSchema = z.strictObject({\n  path: z.string().describe('Requested path'),\n  value: DeletePerPathValueSchema.optional().describe('Delete outcome; present on success'),\n  error: PerFileErrorSchema.optional().describe('Error details; present on failure'),\n});\n\n// One envelope for every batch tool: `read` and `stat` already answer with\n// `{ results, summary }`, so `delete` does too. The old shape switched between\n// `{ ok, path }` and `{ ok: false, failures }` depending on the outcome, which\n// left a caller parsing two schemas for one tool and never named the paths in a\n// multi-delete's text.\nconst DeleteOutputSchema = z.strictObject({\n  results: z\n    .array(DeletePerPathSchema)\n    .describe('Per-path results ordered to match the input paths'),\n  summary: OperationSummarySchema,\n});\n\ntype DeleteInput = z.infer<typeof DeleteInputSchema>;\ntype DeleteOutput = z.infer<typeof DeleteOutputSchema>;\ntype DeletePerPathResult = z.infer<typeof DeletePerPathSchema>;\n\n// Internal types for error handling\ninterface DeletedItem {\n  path: string;\n}\ninterface DeleteFailure {\n  path: string;\n  error: Problem;\n}\n\nconst ERR_NOT_EMPTY = new Error('Directory not empty. Set recursive: true.');\n\nfunction toDeleteFailure(path: string, error: unknown): DeleteFailure {\n  // A missing path reached here as the raw errno text (\"ENOENT: no such file or\n  // directory, lstat 'c:\\...'\"), while `stat` reported the same condition as\n  // \"Path not found\". One condition, one message — and the syscall name stays\n  // off the wire.\n  if (isNotFoundErrno(error)) {\n    return {\n      path,\n      error: Problem.fromUnknown(\n        new FsError(ErrorCode.NOT_FOUND, 'Path not found', path),\n        ErrorCode.NOT_FOUND,\n        path,\n      ),\n    };\n  }\n  if (\n    isNodeError(error) &&\n    (error.code === 'ENOTEMPTY' || error.code === 'EISDIR' || error.code === 'EEXIST')\n  ) {\n    return {\n      path,\n      error: Problem.fromUnknown(ERR_NOT_EMPTY, ErrorCode.INVALID_INPUT, path),\n    };\n  }\n  return { path, error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, path) };\n}\n\ntype LstatResult = Awaited<ReturnType<GuardedFileSystem['lstat']>>;\ntype ItemType = FileType;\n\n/** A path's pre-checked plan: validated, statted, and flagged if it needs confirmation. */\ninterface DeletePlan {\n  inputPath: string;\n  validPath: string;\n  itemType: ItemType;\n  firstStats: LstatResult;\n  /** Recursive + non-empty directory: needs a round-trip confirmation. */\n  pending: boolean;\n}\n\ntype PlanResult =\n  | { status: 'fail'; failure: DeleteFailure }\n  | { status: 'noop'; item: DeletedItem }\n  | { status: 'plan'; plan: DeletePlan };\n\n/**\n * Phase 1 (no mutation): validate, stat, and decide whether a path needs a\n * confirmation before anything is deleted. A pending path is a recursive\n * non-empty directory; everything else is ready to delete directly.\n */\nasync function planPath(\n  inputPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  fs: Pick<GuardedFileSystem, 'pathGuard' | 'lstat' | 'hasChildrenUnchecked'>,\n): Promise<PlanResult> {\n  let validPath: string;\n  try {\n    validPath = await fs.pathGuard.validatePathForDelete(inputPath);\n  } catch (error) {\n    if (\n      args.ignoreIfNotExists &&\n      ((isFsError(error) && error.code === ErrorCode.NOT_FOUND) || isNotFoundErrno(error))\n    ) {\n      return { status: 'noop', item: { path: inputPath } };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  if (fs.pathGuard.isAllowedRoot(validPath)) {\n    return {\n      status: 'fail',\n      // Keyed by the REQUESTED path, like every other failure here: handleDelete\n      // orders results by input path, and a resolved key would not be found for\n      // a relative request.\n      failure: {\n        path: inputPath,\n        error: Problem.accessDenied('Deleting a workspace root directory is not allowed', {\n          path: validPath,\n        }),\n      },\n    };\n  }\n\n  let firstStats: LstatResult;\n  try {\n    firstStats = await fs.lstat(validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { status: 'noop', item: { path: inputPath } };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  const itemType = resolveEntryType(firstStats.stats);\n  let hasChildren = false;\n  if (args.recursive && itemType === 'directory') {\n    try {\n      hasChildren = await fs.hasChildrenUnchecked(validPath);\n    } catch (error) {\n      return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n    }\n  }\n  const pending = hasChildren;\n  return { status: 'plan', plan: { inputPath, validPath, itemType, firstStats, pending } };\n}\n\nasync function performDeletion(\n  validPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  isDirectory: boolean,\n  fsOps: Pick<GuardedFileSystem, 'rm' | 'rmdir'>,\n): Promise<void> {\n  if (isDirectory && !args.recursive) {\n    await fsOps.rmdir(validPath);\n  } else {\n    await fsOps.rm(validPath, {\n      recursive: args.recursive,\n      force: args.ignoreIfNotExists,\n    });\n  }\n}\n\n/**\n * Phase 2 (mutation): TOCTOU re-stat against the plan's first stat, then\n * delete. A type or identity change across the confirmation gap fails closed\n * rather than deleting a replacement object the user never confirmed.\n */\nasync function finalizeDeletion(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'log'>,\n): Promise<{ item: DeletedItem } | { failure: DeleteFailure }> {\n  let currentStats: LstatResult;\n  try {\n    currentStats = await ctx.fs.lstat(plan.validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { item: { path: plan.validPath } };\n    }\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  const currentItemType = resolveEntryType(currentStats.stats);\n  // Identity comparison, not just the coarse category: a swap during the\n  // confirmation gap (delete original, create a same-named replacement) keeps\n  // the type but changes dev/ino/birthtimeMs. birthtimeMs is the primary\n  // cross-platform signal — dev/ino can read 0 on some non-POSIX drivers — so\n  // combine all three rather than trusting dev/ino alone.\n  const identityChanged =\n    plan.firstStats.stats.dev !== currentStats.stats.dev ||\n    plan.firstStats.stats.ino !== currentStats.stats.ino ||\n    plan.firstStats.stats.birthtimeMs !== currentStats.stats.birthtimeMs;\n  if (plan.itemType !== 'other' && (currentItemType !== plan.itemType || identityChanged)) {\n    return {\n      failure: {\n        path: plan.validPath,\n        error: Problem.invalidInput(\n          `Delete failed: item type changed from ${plan.itemType} to ${currentItemType} during confirmation.`,\n          { path: plan.validPath },\n        ),\n      },\n    };\n  }\n\n  try {\n    await performDeletion(plan.validPath, args, currentStats.stats.isDirectory(), ctx.fs);\n  } catch (error) {\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  ctx.log?.('info', `rm: ${plan.inputPath}`, 'delete');\n  return { item: { path: plan.validPath } };\n}\n\n/**\n * Execute one planned path on the retry round. A pending path deletes only on\n * an accepted `confirm: true`; decline, cancel, or a missing key report\n * `CANCELLED` for that path (R3 proceed, R4/R5 cancelled). A non-pending path\n * deletes directly (R14: non-pending items proceed alongside accepted ones).\n */\nasync function executePlan(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'inputResponses' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<{ item: DeletedItem } | { failure: DeleteFailure } | { skipped: true; path: string }> {\n  if (plan.pending) {\n    const key = `confirm_${pendingSorted.indexOf(plan.validPath)}`;\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: true as const, path: plan.validPath };\n    }\n    if (choice !== 'delete') {\n      return {\n        failure: {\n          path: plan.validPath,\n          error: Problem.cancelled('Delete cancelled: confirmation was declined or missing', {\n            path: plan.validPath,\n          }),\n        },\n      };\n    }\n  }\n  return finalizeDeletion(plan, args, ctx);\n}\n\nasync function handleDelete(\n  args: DeleteInput,\n  ctx: ToolCtx,\n): Promise<DeleteOutput | InputRequiredResult> {\n  // Duplicate paths collapse: results are keyed by path, so a repeated entry\n  // would emit two rows for one deletion and inflate `summary.total`.\n  const paths = [...new Set(args.paths)];\n\n  // Phase 1 (no mutation): plan every path.\n  const planned = await processInParallel(\n    paths,\n    (inputPath) => planPath(inputPath, args, ctx.fs),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  const out = new Array<DeletePerPathResult | undefined>(paths.length).fill(undefined);\n  const plans: { plan: DeletePlan; index: number }[] = [];\n  for (const { index, value: r } of planned.results) {\n    if (r.status === 'fail') out[index] = { path: r.failure.path, error: r.failure.error };\n    else if (r.status === 'noop') out[index] = { path: r.item.path, value: { deleted: true } };\n    else plans.push({ plan: r.plan, index });\n  }\n  for (const { index, error } of planned.errors) {\n    out[index] = {\n      path: paths[index] ?? '(unknown)',\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    };\n  }\n\n  // Pending set: recursive + non-empty directories, sorted and de-duplicated.\n  // `buildInputRequired` seals exactly this set into the requestState, and the\n  // retried round recomputes it from the same args so a swapped retry (accept\n  // for X, retry with Y) is rejected — the codec only proves the state was not\n  // tampered, not that it matches the current request (R9).\n  const pendingSorted = [\n    ...new Set(plans.filter((p) => p.plan.pending).map((p) => p.plan.validPath)),\n  ].sort();\n\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required (atomic — R14: nothing deleted yet, not\n    // even the non-pending items in the same call); a retry whose verified\n    // state does not bind this pending set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip({\n      op: 'delete',\n      pending: pendingSorted,\n      requestState: ctx.requestState,\n      clientCapabilities: ctx.clientCapabilities,\n      buildInputs: (ps) =>\n        ps.map((p, i) =>\n          choiceInput(\n            `confirm_${i}`,\n            `Permanently delete \"${p}\" and all its contents? This cannot be undone.`,\n            [\n              { value: 'delete', title: 'Delete' },\n              { value: 'skip', title: 'Skip' },\n            ],\n          ),\n        ),\n    });\n    if (round !== undefined) return round;\n  }\n\n  // Phase 2 (mutation): execute deletions for every planned path.\n  const executed = await processInParallel(\n    plans,\n    ({ plan }) => executePlan(plan, args, ctx, pendingSorted),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { index, value: r } of executed.results) {\n    const slot = plans[index]?.index;\n    if (slot === undefined) continue;\n    if ('skipped' in r) {\n      out[slot] = { path: r.path, value: { deleted: false } };\n    } else if ('failure' in r) {\n      out[slot] = { path: r.failure.path, error: r.failure.error };\n    } else if (r.item.path) {\n      out[slot] = { path: r.item.path, value: { deleted: true } };\n    }\n  }\n  for (const { index, error } of executed.errors) {\n    const slot = plans[index]?.index;\n    if (slot === undefined) continue;\n    out[slot] = {\n      path: paths[slot] ?? '(unknown)',\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    };\n  }\n\n  // Emit in the caller's input order so `results[i]` lines up with `paths[i]`\n  // the way read/stat guarantee.\n  const results: DeletePerPathResult[] = paths.map((requested, i) => {\n    const entry = out[i];\n    return (\n      entry ?? {\n        path: requested,\n        error: { code: ErrorCode.UNKNOWN, message: 'Unknown delete failure' },\n      }\n    );\n  });\n\n  const failed = results.filter((r) => r.error !== undefined).length;\n  return {\n    results,\n    summary: { total: results.length, succeeded: results.length - failed, failed },\n  };\n}\n\nexport const DELETE_FILE = defineTool({\n  name: 'delete',\n  title: 'Delete File',\n  description:\n    'Permanently delete one or more files, directories, or symlinks (max 1000 per call). This action is irreversible. ' +\n    'Pass paths: [...] — there is no single-path form. ' +\n    'Non-empty directories require recursive=true and additionally prompt the user to confirm each one, ' +\n    'so the call returns without deleting anything until that confirmation comes back; ' +\n    'a client that cannot prompt gets an error naming the alternative. ' +\n    'Workspace root directories cannot be deleted.',\n  input: DeleteInputSchema,\n  output: DeleteOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    idempotentHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  defaultErrorCode: ErrorCode.UNKNOWN,\n  progress: (args) => ({\n    label: 'Delete',\n    subject:\n      args.paths.length === 1\n        ? basename(args.paths[0] ?? '')\n        : `${String(args.paths.length)} paths`,\n  }),\n  accessPaths: (args) => [...args.paths],\n  run: async (args, ctx) => {\n    const structured = await handleDelete(args, ctx);\n    // input_required is a return value, not a completed call: surface it\n    // verbatim so the executor short-circuits before building a CallToolResult.\n    if (isInputRequiredResult(structured)) return structured;\n    // Name every path and its outcome. The old text said \"deleted 2 paths\"\n    // without saying which two, so a partial failure was unreadable without\n    // parsing the structured half.\n    const { failed, total } = structured.summary;\n    const isError = isTotalFailure(structured.summary);\n    // A lone failure carries its reason in the text. \"delete: . FAILED (0/1 ok)\"\n    // made the model re-read structuredContent to learn it was ACCESS_DENIED;\n    // with one path there is no ambiguity about which message applies.\n    if (total === 1 && failed === 1) {\n      const only = structured.results[0];\n      return {\n        structured,\n        text: `delete: ${only?.path ?? ''} FAILED — ${only?.error?.message ?? 'unknown error'}`,\n        isError,\n      };\n    }\n    const tokens = structured.results.map((r) => {\n      const label = pathLabel(r.path);\n      if (r.error) return `${label} FAILED`;\n      return r.value?.deleted ? label : `${label} SKIPPED`;\n    });\n    const ratio = failed > 0 ? ` (${String(total - failed)}/${String(total)} ok)` : '';\n    return { structured, text: `delete: ${joinRoster(tokens)}${ratio}`, isError };\n  },\n});\n"]}

package/dist/tools/list.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../src/tools/list.ts"],"names":[],"mappings":"AA0VA,eAAO,MAAM,IAAI,mCA6Cf,CAAC"}
+{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../src/tools/list.ts"],"names":[],"mappings":"AA+UA,eAAO,MAAM,IAAI,mCA6Cf,CAAC"}

package/dist/tools/list.js

@@ -1,9 +1,8 @@
 import { basename } from 'node:path';
 import * as z from 'zod/v4';
-import { timedSignal } from '../core/concurrency.js';
 import { paginate } from '../core/cursor.js';
 import { ErrorCode } from '../core/errors.js';
-import { DEFAULT_EXCLUDE_PATTERNS, globEntries, isIgnoredByGitignore, loadRootGitignore, } from '../core/glob.js';
+import { DEFAULT_EXCLUDE_PATTERNS, globEntries, loadRootGitignore } from '../core/glob.js';
 import { toPosixRelative } from '../core/path.js';
 import { resolveEntryType } from '../core/primitives.js';
 import { CursorSchema, FileType as FileTypeEnum, includeHiddenField, includeIgnoredField, NextCursorSchema, NonNegInt, OptionalPath, PositiveInt, } from '../core/schema.js';
@@ -57,10 +56,7 @@ async function collect(rootPath, options) {
         const isDir = entryType === 'directory';
         const relPath = toPosixRelative(rootPath, entry.path);
         const name = basename(relPath);
-        if (gitignoreMatcher &&
-            isIgnoredByGitignore(gitignoreMatcher, rootPath, entry.path, {
-                isDirectory: isDir,
-            })) {
+        if (gitignoreMatcher?.isIgnored(relPath, isDir)) {
             continue;
         }
         const accessible = await options.pathGuard.isEntryAccessible(entry.path);
@@ -205,7 +201,7 @@ async function handleList(args, ctx) {
                 maxDepth: args.maxDepth,
                 includeHidden: args.includeHidden,
                 includeIgnored: args.includeIgnored,
-                signal: timedSignal(ctx.signal, DEFAULT_SEARCH_TIMEOUT_MS),
+                signal: AbortSignal.any([ctx.signal, AbortSignal.timeout(DEFAULT_SEARCH_TIMEOUT_MS)]),
                 pathGuard: ctx.fs.pathGuard,
                 entryCap: MAX_LIST_ENTRIES,
                 ...(ctx.onProgress ? { onProgress: ctx.onProgress } : {}),

package/dist/tools/list.js.map

@@ -1 +1 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/tools/list.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C,OAAO,EACL,wBAAwB,EACxB,WAAW,EACX,oBAAoB,EACpB,iBAAiB,GAClB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EACL,YAAY,EACZ,QAAQ,IAAI,YAAY,EACxB,kBAAkB,EAClB,mBAAmB,EACnB,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,WAAW,GACZ,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EACL,yBAAyB,EACzB,oBAAoB,EACpB,gBAAgB,EAChB,cAAc,GACf,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AA0BvD,SAAS,aAAa,CAAC,IAAe;IACpC,IAAI,IAAI,KAAK,WAAW;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,cAAc,CAAC,CAAiB,EAAE,CAAiB;IAC1D,2DAA2D;IAC3D,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAErE,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAE/D,oDAAoD;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IACpC,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,QAAgB,EAAE,OAAuB;IAC9D,MAAM,gBAAgB,GAAG,OAAO,CAAC,cAAc;QAC7C,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,MAAM,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,WAAW,CAAC;QACpC,GAAG,EAAE,QAAQ;QACb,OAAO,EAAE,MAAM;QACf,eAAe,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,wBAAwB;QACvE,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,aAAa,EAAE,KAAK;QACpB,uEAAuE;QACvE,+EAA+E;QAC/E,0EAA0E;QAC1E,QAAQ,EAAE,OAAO,CAAC,QAAQ,GAAG,CAAC;QAC9B,SAAS,EAAE,KAAK;KACjB,CAAC,EAAE,CAAC;QACH,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;QACV,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAE3C,MAAM,SAAS,GAAc,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,SAAS,KAAK,WAAW,CAAC;QACxC,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/B,IACE,gBAAgB;YAChB,oBAAoB,CAAC,gBAAgB,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE;gBAC3D,WAAW,EAAE,KAAK;aACnB,CAAC,EACF,CAAC;YACD,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU;YAAE,SAAS;QAE1B,YAAY,EAAE,CAAC;QACf,IAAI,SAAS,KAAK,WAAW,EAAE,CAAC;YAC9B,gBAAgB,EAAE,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,UAAU,EAAE,CAAC;QACf,CAAC;QAED,MAAM,cAAc,GAAmB;YACrC,IAAI;YACJ,YAAY,EAAE,OAAO;YACrB,IAAI,EAAE,SAAS;SAChB,CAAC;QAEF,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7B,OAAO;QACL,OAAO;QACP,YAAY;QACZ,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED,MAAM,GAAG,GAAG,MAAM,CAAC;AACnB,MAAM,KAAK,GAAG,MAAM,CAAC;AACrB,MAAM,IAAI,GAAG,MAAM,CAAC;AACpB,MAAM,MAAM,GAAG,MAAM,CAAC;AAEtB,SAAS,cAAc,CAAC,QAAgB,EAAE,OAAkC;IAC1E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE1C,+BAA+B;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IACvD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;IAEnC,SAAS,cAAc,CAAC,SAAiB,EAAE,MAAc;QACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;YACpC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrD,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAC7B,MAAM,oBAAoB,GAAG,oBAAoB,CAAC;AAElD,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,iDAAiD,CAAC;IAC9E,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;SACtC,OAAO,CAAC,kBAAkB,CAAC;SAC3B,QAAQ,CACP,6CAA6C,MAAM,CAAC,kBAAkB,CAAC,gDAAgD,CACxH;IACH,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC;SAC1C,OAAO,CAAC,oBAAoB,CAAC;SAC7B,QAAQ,CACP,uBAAuB,MAAM,CAAC,oBAAoB,CAAC,oGAAoG,CACxJ;IACH,aAAa,EAAE,kBAAkB,EAAE;IACnC,cAAc,EAAE,mBAAmB,EAAE;IACrC,MAAM,EAAE,YAAY;CACrB,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,gDAAgD,CAAC;IACtF,OAAO,EAAE,CAAC;SACP,KAAK,CACJ,CAAC,CAAC,YAAY,CAAC;QACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC3C,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6CAA6C,CAAC;QAChF,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,gDAAgD,CAAC;KAC9E,CAAC,CACH;SACA,QAAQ,CAAC,+EAA+E,CAAC;IAC5F,8EAA8E;IAC9E,2EAA2E;IAC3E,6EAA6E;IAC7E,iEAAiE;IACjE,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6CAA6C,CAAC;IAC7E,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,2DAA2D,CAAC;IAC7F,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6BAA6B,CAAC;IAC7D,gBAAgB,EAAE,SAAS,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IACzE,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,8FAA8F;QAC5F,6FAA6F;QAC7F,uDAAuD,CAC1D;IACH,UAAU,EAAE,gBAAgB;CAC7B,CAAC,CAAC;AASH,SAAS,YAAY,CAAC,IAAqC,EAAE,IAAY;IACvE,OAAO,IAAI,CAAC,SAAS,CAAC;QACpB,MAAM,EAAE,MAAM;QACd,IAAI;QACJ,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,cAAc,EAAE,IAAI,CAAC,cAAc;KACpC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,UAAU,CACjB,OAAkC,EAClC,QAA0B,EAC1B,UAA8B,EAC9B,WAA+B;IAE/B,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;QACrB,UAAU,EAAE,OAAO,CAAC,MAAM;QAC1B,YAAY,EAAE,QAAQ,CAAC,YAAY;QACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;QAC3C,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAMZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,YAAY,GAAG,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;IAE9B,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAuD;QACjF,KAAK,EAAE,GAAG,CAAC,SAAS;QACpB,QAAQ;QACR,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,UAAU;QACzB,OAAO,EAAE,KAAK,IAAI,EAAE;YAClB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC;YAChF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE;gBACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,yBAAyB,CAAC;gBAC1D,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS;gBAC3B,QAAQ,EAAE,gBAAgB;gBAC1B,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1D,CAAC,CAAC;YACH,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,OAAO;gBACrB,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,YAAY,EAAE,MAAM,CAAC,YAAY;oBACjC,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;iBAC1C;gBACD,SAAS,EAAE,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM;aACvD,CAAC;QACJ,CAAC;QACD,WAAW,EAAE,aAAa;YACxB,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;gBACpB,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACrC,qEAAqE;gBACrE,4CAA4C;gBAC5C,MAAM,UAAU,GAAG;oBACjB,OAAO;oBACP,QAAQ,EAAE,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;oBACvC,YAAY,EAAE,QAAQ,CAAC,YAAY;oBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;oBAC3C,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACvE,CAAC;gBACF,OAAO,eAAe,CAAC,aAAa,EAAE,GAAG,IAAI,OAAO,EAAE,UAAU,CAAC,CAAC;YACpE,CAAC;YACH,CAAC,CAAC,SAAS;KACd,CAAC,CAAC;IAEH,OAAO;QACL,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC;QAC/F,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzD,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,MAAM;IACb,WAAW,EACT,4EAA4E;QAC5E,4HAA4H;IAC9H,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,sEAAsE;IACtE,wEAAwE;IACxE,6EAA6E;IAC7E,0DAA0D;IAC1D,WAAW,EAAE;QACX,YAAY,EAAE,IAAI;QAClB,cAAc,EAAE,IAAI;QACpB,eAAe,EAAE,KAAK;QACtB,aAAa,EAAE,KAAK;KACrB;IACD,SAAS,EAAE,yBAAyB;IACpC,gBAAgB,EAAE,SAAS,CAAC,aAAa;IACzC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,MAAM;QACb,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG;KAC/C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACnE,0EAA0E;QAC1E,0EAA0E;QAC1E,uDAAuD;QACvD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,UAAU,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,eAAe,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,UAAU,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CACV,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,gCAAgC,UAAU,CAAC,WAAW,EAAE,CAC/H,CAAC;QACJ,CAAC;QACD,OAAO;YACL,UAAU;YACV,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ;YAC5E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvC,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { ContentBlock } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { timedSignal } from '../core/concurrency.js';\nimport { paginate } from '../core/cursor.js';\nimport { ErrorCode } from '../core/errors.js';\nimport type { EntryType } from '../core/glob.js';\nimport {\n  DEFAULT_EXCLUDE_PATTERNS,\n  globEntries,\n  isIgnoredByGitignore,\n  loadRootGitignore,\n} from '../core/glob.js';\nimport type { PathGuard } from '../core/path.js';\nimport { toPosixRelative } from '../core/path.js';\nimport { resolveEntryType } from '../core/primitives.js';\nimport {\n  CursorSchema,\n  FileType as FileTypeEnum,\n  includeHiddenField,\n  includeIgnoredField,\n  NextCursorSchema,\n  NonNegInt,\n  OptionalPath,\n  PositiveInt,\n} from '../core/schema.js';\nimport type { JsonResourceResult } from '../core/store.js';\nimport { putJsonResource } from '../core/store.js';\nimport {\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  DEFAULT_TREE_ENTRIES,\n  MAX_LIST_ENTRIES,\n  MAX_TREE_DEPTH,\n} from '../core/util.js';\nimport { defineTool, type ToolCtx } from './define.js';\n\ninterface CollectedEntry {\n  name: string;\n  relativePath: string; // POSIX\n  type: EntryType;\n}\n\ninterface CollectOptions {\n  maxDepth: number;\n  includeHidden: boolean;\n  includeIgnored: boolean;\n  signal: AbortSignal;\n  pathGuard: PathGuard;\n  /** Upper bound on the stored, paginable entry array. */\n  entryCap: number;\n  onProgress?: (progress: { current: number; total?: number }) => void;\n}\n\ninterface CollectResult {\n  entries: CollectedEntry[];\n  totalEntries: number;\n  totalFiles: number;\n  totalDirectories: number;\n}\n\nfunction entryTypeRank(type: EntryType): number {\n  if (type === 'directory') return 0;\n  return 1;\n}\n\nfunction compareEntries(a: CollectedEntry, b: CollectedEntry): number {\n  // Compare by parent directory first (depth-level grouping)\n  const slashA = a.relativePath.lastIndexOf('/');\n  const slashB = b.relativePath.lastIndexOf('/');\n  const parentA = slashA === -1 ? '' : a.relativePath.slice(0, slashA);\n  const parentB = slashB === -1 ? '' : b.relativePath.slice(0, slashB);\n\n  if (parentA !== parentB) return parentA.localeCompare(parentB);\n\n  // Within same parent: dirs first, then alphabetical\n  const rankDiff = entryTypeRank(a.type) - entryTypeRank(b.type);\n  if (rankDiff !== 0) return rankDiff;\n  return a.name.localeCompare(b.name);\n}\n\nasync function collect(rootPath: string, options: CollectOptions): Promise<CollectResult> {\n  const gitignoreMatcher = options.includeIgnored\n    ? null\n    : await loadRootGitignore(rootPath, options.signal);\n\n  const entries: CollectedEntry[] = [];\n  let scanned = 0;\n  let totalEntries = 0;\n  let totalFiles = 0;\n  let totalDirectories = 0;\n\n  for await (const entry of globEntries({\n    cwd: rootPath,\n    pattern: '**/*',\n    excludePatterns: options.includeIgnored ? [] : DEFAULT_EXCLUDE_PATTERNS,\n    includeHidden: options.includeHidden,\n    baseNameMatch: false,\n    // ListInputSchema.maxDepth is 1-based (1 = top-level only); the shared\n    // globEntries primitive is now 0-based, so subtract one here. options.maxDepth\n    // is guaranteed >= 1 by its PositiveInt schema, so this never underflows.\n    maxDepth: options.maxDepth - 1,\n    onlyFiles: false,\n  })) {\n    options.signal.throwIfAborted();\n    scanned++;\n    options.onProgress?.({ current: scanned });\n\n    const entryType: EntryType = resolveEntryType(entry.dirent);\n    const isDir = entryType === 'directory';\n    const relPath = toPosixRelative(rootPath, entry.path);\n    const name = basename(relPath);\n\n    if (\n      gitignoreMatcher &&\n      isIgnoredByGitignore(gitignoreMatcher, rootPath, entry.path, {\n        isDirectory: isDir,\n      })\n    ) {\n      continue;\n    }\n    const accessible = await options.pathGuard.isEntryAccessible(entry.path);\n    if (!accessible) continue;\n\n    totalEntries++;\n    if (entryType === 'directory') {\n      totalDirectories++;\n    } else {\n      totalFiles++;\n    }\n\n    const collectedEntry: CollectedEntry = {\n      name,\n      relativePath: relPath,\n      type: entryType,\n    };\n\n    if (entries.length < options.entryCap) {\n      entries.push(collectedEntry);\n    }\n  }\n\n  options.signal.throwIfAborted();\n  entries.sort(compareEntries);\n\n  return {\n    entries,\n    totalEntries,\n    totalFiles,\n    totalDirectories,\n  };\n}\n\nconst TEE = '├── ';\nconst ELBOW = '└── ';\nconst PIPE = '│   ';\nconst INDENT = '    ';\n\nfunction renderMarkdown(rootName: string, entries: readonly CollectedEntry[]): string {\n  if (entries.length === 0) return rootName;\n\n  // Group entries by parent path\n  const childrenOf = new Map<string, CollectedEntry[]>();\n  for (const entry of entries) {\n    const slash = entry.relativePath.lastIndexOf('/');\n    const parentKey = slash === -1 ? '' : entry.relativePath.slice(0, slash);\n    if (!childrenOf.has(parentKey)) childrenOf.set(parentKey, []);\n    const children = childrenOf.get(parentKey);\n    if (children) children.push(entry);\n  }\n\n  const lines: string[] = [rootName];\n\n  function renderChildren(parentKey: string, prefix: string): void {\n    const children = childrenOf.get(parentKey);\n    if (!children) return;\n\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      if (!child) continue;\n      const isLast = i === children.length - 1;\n      const connector = isLast ? ELBOW : TEE;\n      lines.push(prefix + connector + child.name);\n\n      const childKey = child.relativePath;\n      const nextPrefix = prefix + (isLast ? INDENT : PIPE);\n      renderChildren(childKey, nextPrefix);\n    }\n  }\n\n  renderChildren('', '');\n  return lines.join('\\n');\n}\n\nconst DEFAULT_LIST_DEPTH = 1;\nconst DEFAULT_LIST_ENTRIES = DEFAULT_TREE_ENTRIES;\n\nconst ListInputSchema = z.strictObject({\n  path: OptionalPath.describe('Directory to list (default: first allowed root)'),\n  maxDepth: PositiveInt.max(MAX_TREE_DEPTH)\n    .default(DEFAULT_LIST_DEPTH)\n    .describe(\n      `Max directory depth to traverse (default: ${String(DEFAULT_LIST_DEPTH)} = top-level only; increase to recurse deeper)`,\n    ),\n  maxEntries: PositiveInt.max(MAX_LIST_ENTRIES)\n    .default(DEFAULT_LIST_ENTRIES)\n    .describe(\n      `Page size (default: ${String(DEFAULT_LIST_ENTRIES)}). Continue with nextCursor; an incomplete first page also carries resourceUri for the whole list.`,\n    ),\n  includeHidden: includeHiddenField(),\n  includeIgnored: includeIgnoredField(),\n  cursor: CursorSchema,\n});\n\nconst ListOutputSchema = z.strictObject({\n  path: z.string().optional().describe('Resolved absolute path of the listed directory'),\n  entries: z\n    .array(\n      z.strictObject({\n        name: z.string().describe('Entry basename'),\n        relativePath: z.string().describe('POSIX path relative to the listed directory'),\n        type: FileTypeEnum.describe('Entry type: file, directory, symlink, or other'),\n      }),\n    )\n    .describe('Inline directory entries sorted directories-first then alphabetically by name'),\n  // No `markdown` field: the ASCII tree is the call's text content already, and\n  // carrying it here too doubled every list response for a string the client\n  // has in hand. The stored full-tree resource still holds its own copy — that\n  // one is a *different* (uncapped) tree and is never sent inline.\n  entryCount: NonNegInt.describe('Number of entries included in this response'),\n  totalEntries: NonNegInt.describe('Total entries found before the maxEntries cap was applied'),\n  totalFiles: NonNegInt.describe('Total number of files found'),\n  totalDirectories: NonNegInt.describe('Total number of directories found'),\n  resourceUri: z\n    .string()\n    .optional()\n    .describe(\n      'URI to the full entry list in the resource store; first page only, whenever the response is ' +\n        'incomplete — more pages follow, or the hard cap cut the listing. The stored list is itself ' +\n        'bounded by that cap and marked truncated if exceeded.',\n    ),\n  nextCursor: NextCursorSchema,\n});\n\ninterface ListPageMetadata {\n  readonly path: string;\n  readonly totalEntries: number;\n  readonly totalFiles: number;\n  readonly totalDirectories: number;\n}\n\nfunction listQueryKey(args: z.infer<typeof ListInputSchema>, path: string): string {\n  return JSON.stringify({\n    method: 'list',\n    path,\n    maxDepth: args.maxDepth,\n    includeHidden: args.includeHidden,\n    includeIgnored: args.includeIgnored,\n  });\n}\n\nfunction listOutput(\n  entries: readonly CollectedEntry[],\n  metadata: ListPageMetadata,\n  nextCursor: string | undefined,\n  resourceUri: string | undefined,\n): z.infer<typeof ListOutputSchema> {\n  return {\n    path: metadata.path,\n    entries: [...entries],\n    entryCount: entries.length,\n    totalEntries: metadata.totalEntries,\n    totalFiles: metadata.totalFiles,\n    totalDirectories: metadata.totalDirectories,\n    ...(resourceUri !== undefined ? { resourceUri } : {}),\n    ...(nextCursor !== undefined ? { nextCursor } : {}),\n  };\n}\n\nasync function handleList(\n  args: z.infer<typeof ListInputSchema>,\n  ctx: ToolCtx,\n): Promise<{\n  structured: z.infer<typeof ListOutputSchema>;\n  markdown: string;\n  link?: ContentBlock;\n}> {\n  const path = args.path;\n  const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);\n  const queryKey = listQueryKey(args, resolvedPath);\n  const { resourceStore } = ctx;\n\n  const paged = await paginate<CollectedEntry, ListPageMetadata, JsonResourceResult>({\n    store: ctx.pageStore,\n    queryKey,\n    cursor: args.cursor,\n    pageSize: args.maxEntries,\n    produce: async () => {\n      const validDir = await ctx.fs.pathGuard.validateExistingDirectory(resolvedPath);\n      const result = await collect(validDir, {\n        maxDepth: args.maxDepth,\n        includeHidden: args.includeHidden,\n        includeIgnored: args.includeIgnored,\n        signal: timedSignal(ctx.signal, DEFAULT_SEARCH_TIMEOUT_MS),\n        pathGuard: ctx.fs.pathGuard,\n        entryCap: MAX_LIST_ENTRIES,\n        ...(ctx.onProgress ? { onProgress: ctx.onProgress } : {}),\n      });\n      return {\n        items: result.entries,\n        metadata: {\n          path: validDir,\n          totalEntries: result.totalEntries,\n          totalFiles: result.totalFiles,\n          totalDirectories: result.totalDirectories,\n        },\n        truncated: result.totalEntries > result.entries.length,\n      };\n    },\n    externalize: resourceStore\n      ? (entries, metadata) => {\n          const name = basename(metadata.path);\n          // The stored tree is the whole collected set — itself bounded by the\n          // hard cap, and marked when the cap cut it.\n          const fullOutput = {\n            entries,\n            markdown: renderMarkdown(name, entries),\n            totalEntries: metadata.totalEntries,\n            totalFiles: metadata.totalFiles,\n            totalDirectories: metadata.totalDirectories,\n            ...(metadata.totalEntries > entries.length ? { truncated: true } : {}),\n          };\n          return putJsonResource(resourceStore, `${name} tree`, fullOutput);\n        }\n      : undefined,\n  });\n\n  return {\n    structured: listOutput(paged.page, paged.metadata, paged.nextCursor, paged.resource?.entry.uri),\n    markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),\n    ...(paged.resource ? { link: paged.resource.link } : {}),\n  };\n}\n\nexport const LIST = defineTool({\n  name: 'list',\n  title: 'List',\n  description:\n    'List sorted directory entries and an ASCII tree. maxDepth=1 is top-level. ' +\n    'maxEntries sets page size; continue with nextCursor. An incomplete first page also carries resourceUri for the whole list.',\n  input: ListInputSchema,\n  output: ListOutputSchema,\n  // Not published: every field is a plainly-named scalar (`entryCount`,\n  // `totalFiles`, `nextCursor`) that one sample response teaches, and the\n  // schema costs 1599 chars of every session start. Publishing is reserved for\n  // the value-XOR-error union shape a sample cannot convey.\n  annotations: {\n    readOnlyHint: true,\n    idempotentHint: true,\n    destructiveHint: false,\n    openWorldHint: false,\n  },\n  timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,\n  defaultErrorCode: ErrorCode.NOT_DIRECTORY,\n  progress: (args) => ({\n    label: 'List',\n    subject: args.path ? basename(args.path) : '.',\n  }),\n  accessPaths: (args) => (args.path ? [args.path] : []),\n  run: async (args, ctx) => {\n    const { structured, markdown, link } = await handleList(args, ctx);\n    // The tree is what the model reads; nextCursor and the full-list URI used\n    // to reach it only through the structured half, which now ships as _meta.\n    // Both ride the text so paging needs no second lookup.\n    const trailer: string[] = [];\n    if (structured.nextCursor !== undefined) {\n      trailer.push(`nextCursor: ${structured.nextCursor}`);\n    }\n    if (structured.resourceUri !== undefined) {\n      trailer.push(\n        `${String(structured.entryCount)} of ${String(structured.totalEntries)} entries shown; full tree at ${structured.resourceUri}`,\n      );\n    }\n    return {\n      structured,\n      text: trailer.length > 0 ? `${markdown}\\n\\n${trailer.join('\\n')}` : markdown,\n      ...(link ? { resources: [link] } : {}),\n    };\n  },\n});\n"]}
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/tools/list.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C,OAAO,EAAE,wBAAwB,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAE3F,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EACL,YAAY,EACZ,QAAQ,IAAI,YAAY,EACxB,kBAAkB,EAClB,mBAAmB,EACnB,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,WAAW,GACZ,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EACL,yBAAyB,EACzB,oBAAoB,EACpB,gBAAgB,EAChB,cAAc,GACf,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AA0BvD,SAAS,aAAa,CAAC,IAAe;IACpC,IAAI,IAAI,KAAK,WAAW;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,cAAc,CAAC,CAAiB,EAAE,CAAiB;IAC1D,2DAA2D;IAC3D,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAErE,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAE/D,oDAAoD;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IACpC,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,QAAgB,EAAE,OAAuB;IAC9D,MAAM,gBAAgB,GAAG,OAAO,CAAC,cAAc;QAC7C,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,MAAM,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,WAAW,CAAC;QACpC,GAAG,EAAE,QAAQ;QACb,OAAO,EAAE,MAAM;QACf,eAAe,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,wBAAwB;QACvE,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,aAAa,EAAE,KAAK;QACpB,uEAAuE;QACvE,+EAA+E;QAC/E,0EAA0E;QAC1E,QAAQ,EAAE,OAAO,CAAC,QAAQ,GAAG,CAAC;QAC9B,SAAS,EAAE,KAAK;KACjB,CAAC,EAAE,CAAC;QACH,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;QACV,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAE3C,MAAM,SAAS,GAAc,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,SAAS,KAAK,WAAW,CAAC;QACxC,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/B,IAAI,gBAAgB,EAAE,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;YAChD,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU;YAAE,SAAS;QAE1B,YAAY,EAAE,CAAC;QACf,IAAI,SAAS,KAAK,WAAW,EAAE,CAAC;YAC9B,gBAAgB,EAAE,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,UAAU,EAAE,CAAC;QACf,CAAC;QAED,MAAM,cAAc,GAAmB;YACrC,IAAI;YACJ,YAAY,EAAE,OAAO;YACrB,IAAI,EAAE,SAAS;SAChB,CAAC;QAEF,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7B,OAAO;QACL,OAAO;QACP,YAAY;QACZ,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED,MAAM,GAAG,GAAG,MAAM,CAAC;AACnB,MAAM,KAAK,GAAG,MAAM,CAAC;AACrB,MAAM,IAAI,GAAG,MAAM,CAAC;AACpB,MAAM,MAAM,GAAG,MAAM,CAAC;AAEtB,SAAS,cAAc,CAAC,QAAgB,EAAE,OAAkC;IAC1E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE1C,+BAA+B;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IACvD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;IAEnC,SAAS,cAAc,CAAC,SAAiB,EAAE,MAAc;QACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;YACpC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrD,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAC7B,MAAM,oBAAoB,GAAG,oBAAoB,CAAC;AAElD,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,iDAAiD,CAAC;IAC9E,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;SACtC,OAAO,CAAC,kBAAkB,CAAC;SAC3B,QAAQ,CACP,6CAA6C,MAAM,CAAC,kBAAkB,CAAC,gDAAgD,CACxH;IACH,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC;SAC1C,OAAO,CAAC,oBAAoB,CAAC;SAC7B,QAAQ,CACP,uBAAuB,MAAM,CAAC,oBAAoB,CAAC,oGAAoG,CACxJ;IACH,aAAa,EAAE,kBAAkB,EAAE;IACnC,cAAc,EAAE,mBAAmB,EAAE;IACrC,MAAM,EAAE,YAAY;CACrB,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,gDAAgD,CAAC;IACtF,OAAO,EAAE,CAAC;SACP,KAAK,CACJ,CAAC,CAAC,YAAY,CAAC;QACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC3C,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6CAA6C,CAAC;QAChF,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,gDAAgD,CAAC;KAC9E,CAAC,CACH;SACA,QAAQ,CAAC,+EAA+E,CAAC;IAC5F,8EAA8E;IAC9E,2EAA2E;IAC3E,6EAA6E;IAC7E,iEAAiE;IACjE,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6CAA6C,CAAC;IAC7E,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,2DAA2D,CAAC;IAC7F,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6BAA6B,CAAC;IAC7D,gBAAgB,EAAE,SAAS,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IACzE,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,8FAA8F;QAC5F,6FAA6F;QAC7F,uDAAuD,CAC1D;IACH,UAAU,EAAE,gBAAgB;CAC7B,CAAC,CAAC;AASH,SAAS,YAAY,CAAC,IAAqC,EAAE,IAAY;IACvE,OAAO,IAAI,CAAC,SAAS,CAAC;QACpB,MAAM,EAAE,MAAM;QACd,IAAI;QACJ,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,cAAc,EAAE,IAAI,CAAC,cAAc;KACpC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,UAAU,CACjB,OAAkC,EAClC,QAA0B,EAC1B,UAA8B,EAC9B,WAA+B;IAE/B,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;QACrB,UAAU,EAAE,OAAO,CAAC,MAAM;QAC1B,YAAY,EAAE,QAAQ,CAAC,YAAY;QACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;QAC3C,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAMZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,YAAY,GAAG,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;IAE9B,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAuD;QACjF,KAAK,EAAE,GAAG,CAAC,SAAS;QACpB,QAAQ;QACR,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,UAAU;QACzB,OAAO,EAAE,KAAK,IAAI,EAAE;YAClB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC;YAChF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE;gBACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,CAAC;gBACrF,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS;gBAC3B,QAAQ,EAAE,gBAAgB;gBAC1B,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1D,CAAC,CAAC;YACH,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,OAAO;gBACrB,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,YAAY,EAAE,MAAM,CAAC,YAAY;oBACjC,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;iBAC1C;gBACD,SAAS,EAAE,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM;aACvD,CAAC;QACJ,CAAC;QACD,WAAW,EAAE,aAAa;YACxB,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;gBACpB,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACrC,qEAAqE;gBACrE,4CAA4C;gBAC5C,MAAM,UAAU,GAAG;oBACjB,OAAO;oBACP,QAAQ,EAAE,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;oBACvC,YAAY,EAAE,QAAQ,CAAC,YAAY;oBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;oBAC3C,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACvE,CAAC;gBACF,OAAO,eAAe,CAAC,aAAa,EAAE,GAAG,IAAI,OAAO,EAAE,UAAU,CAAC,CAAC;YACpE,CAAC;YACH,CAAC,CAAC,SAAS;KACd,CAAC,CAAC;IAEH,OAAO;QACL,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC;QAC/F,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzD,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,MAAM;IACb,WAAW,EACT,4EAA4E;QAC5E,4HAA4H;IAC9H,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,sEAAsE;IACtE,wEAAwE;IACxE,6EAA6E;IAC7E,0DAA0D;IAC1D,WAAW,EAAE;QACX,YAAY,EAAE,IAAI;QAClB,cAAc,EAAE,IAAI;QACpB,eAAe,EAAE,KAAK;QACtB,aAAa,EAAE,KAAK;KACrB;IACD,SAAS,EAAE,yBAAyB;IACpC,gBAAgB,EAAE,SAAS,CAAC,aAAa;IACzC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,MAAM;QACb,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG;KAC/C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACnE,0EAA0E;QAC1E,0EAA0E;QAC1E,uDAAuD;QACvD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,UAAU,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,eAAe,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,UAAU,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CACV,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,gCAAgC,UAAU,CAAC,WAAW,EAAE,CAC/H,CAAC;QACJ,CAAC;QACD,OAAO;YACL,UAAU;YACV,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ;YAC5E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvC,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { ContentBlock } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { paginate } from '../core/cursor.js';\nimport { ErrorCode } from '../core/errors.js';\nimport type { EntryType } from '../core/glob.js';\nimport { DEFAULT_EXCLUDE_PATTERNS, globEntries, loadRootGitignore } from '../core/glob.js';\nimport type { PathGuard } from '../core/path.js';\nimport { toPosixRelative } from '../core/path.js';\nimport { resolveEntryType } from '../core/primitives.js';\nimport {\n  CursorSchema,\n  FileType as FileTypeEnum,\n  includeHiddenField,\n  includeIgnoredField,\n  NextCursorSchema,\n  NonNegInt,\n  OptionalPath,\n  PositiveInt,\n} from '../core/schema.js';\nimport type { JsonResourceResult } from '../core/store.js';\nimport { putJsonResource } from '../core/store.js';\nimport {\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  DEFAULT_TREE_ENTRIES,\n  MAX_LIST_ENTRIES,\n  MAX_TREE_DEPTH,\n} from '../core/util.js';\nimport { defineTool, type ToolCtx } from './define.js';\n\ninterface CollectedEntry {\n  name: string;\n  relativePath: string; // POSIX\n  type: EntryType;\n}\n\ninterface CollectOptions {\n  maxDepth: number;\n  includeHidden: boolean;\n  includeIgnored: boolean;\n  signal: AbortSignal;\n  pathGuard: PathGuard;\n  /** Upper bound on the stored, paginable entry array. */\n  entryCap: number;\n  onProgress?: (progress: { current: number; total?: number }) => void;\n}\n\ninterface CollectResult {\n  entries: CollectedEntry[];\n  totalEntries: number;\n  totalFiles: number;\n  totalDirectories: number;\n}\n\nfunction entryTypeRank(type: EntryType): number {\n  if (type === 'directory') return 0;\n  return 1;\n}\n\nfunction compareEntries(a: CollectedEntry, b: CollectedEntry): number {\n  // Compare by parent directory first (depth-level grouping)\n  const slashA = a.relativePath.lastIndexOf('/');\n  const slashB = b.relativePath.lastIndexOf('/');\n  const parentA = slashA === -1 ? '' : a.relativePath.slice(0, slashA);\n  const parentB = slashB === -1 ? '' : b.relativePath.slice(0, slashB);\n\n  if (parentA !== parentB) return parentA.localeCompare(parentB);\n\n  // Within same parent: dirs first, then alphabetical\n  const rankDiff = entryTypeRank(a.type) - entryTypeRank(b.type);\n  if (rankDiff !== 0) return rankDiff;\n  return a.name.localeCompare(b.name);\n}\n\nasync function collect(rootPath: string, options: CollectOptions): Promise<CollectResult> {\n  const gitignoreMatcher = options.includeIgnored\n    ? null\n    : await loadRootGitignore(rootPath, options.signal);\n\n  const entries: CollectedEntry[] = [];\n  let scanned = 0;\n  let totalEntries = 0;\n  let totalFiles = 0;\n  let totalDirectories = 0;\n\n  for await (const entry of globEntries({\n    cwd: rootPath,\n    pattern: '**/*',\n    excludePatterns: options.includeIgnored ? [] : DEFAULT_EXCLUDE_PATTERNS,\n    includeHidden: options.includeHidden,\n    baseNameMatch: false,\n    // ListInputSchema.maxDepth is 1-based (1 = top-level only); the shared\n    // globEntries primitive is now 0-based, so subtract one here. options.maxDepth\n    // is guaranteed >= 1 by its PositiveInt schema, so this never underflows.\n    maxDepth: options.maxDepth - 1,\n    onlyFiles: false,\n  })) {\n    options.signal.throwIfAborted();\n    scanned++;\n    options.onProgress?.({ current: scanned });\n\n    const entryType: EntryType = resolveEntryType(entry.dirent);\n    const isDir = entryType === 'directory';\n    const relPath = toPosixRelative(rootPath, entry.path);\n    const name = basename(relPath);\n\n    if (gitignoreMatcher?.isIgnored(relPath, isDir)) {\n      continue;\n    }\n    const accessible = await options.pathGuard.isEntryAccessible(entry.path);\n    if (!accessible) continue;\n\n    totalEntries++;\n    if (entryType === 'directory') {\n      totalDirectories++;\n    } else {\n      totalFiles++;\n    }\n\n    const collectedEntry: CollectedEntry = {\n      name,\n      relativePath: relPath,\n      type: entryType,\n    };\n\n    if (entries.length < options.entryCap) {\n      entries.push(collectedEntry);\n    }\n  }\n\n  options.signal.throwIfAborted();\n  entries.sort(compareEntries);\n\n  return {\n    entries,\n    totalEntries,\n    totalFiles,\n    totalDirectories,\n  };\n}\n\nconst TEE = '├── ';\nconst ELBOW = '└── ';\nconst PIPE = '│   ';\nconst INDENT = '    ';\n\nfunction renderMarkdown(rootName: string, entries: readonly CollectedEntry[]): string {\n  if (entries.length === 0) return rootName;\n\n  // Group entries by parent path\n  const childrenOf = new Map<string, CollectedEntry[]>();\n  for (const entry of entries) {\n    const slash = entry.relativePath.lastIndexOf('/');\n    const parentKey = slash === -1 ? '' : entry.relativePath.slice(0, slash);\n    if (!childrenOf.has(parentKey)) childrenOf.set(parentKey, []);\n    const children = childrenOf.get(parentKey);\n    if (children) children.push(entry);\n  }\n\n  const lines: string[] = [rootName];\n\n  function renderChildren(parentKey: string, prefix: string): void {\n    const children = childrenOf.get(parentKey);\n    if (!children) return;\n\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      if (!child) continue;\n      const isLast = i === children.length - 1;\n      const connector = isLast ? ELBOW : TEE;\n      lines.push(prefix + connector + child.name);\n\n      const childKey = child.relativePath;\n      const nextPrefix = prefix + (isLast ? INDENT : PIPE);\n      renderChildren(childKey, nextPrefix);\n    }\n  }\n\n  renderChildren('', '');\n  return lines.join('\\n');\n}\n\nconst DEFAULT_LIST_DEPTH = 1;\nconst DEFAULT_LIST_ENTRIES = DEFAULT_TREE_ENTRIES;\n\nconst ListInputSchema = z.strictObject({\n  path: OptionalPath.describe('Directory to list (default: first allowed root)'),\n  maxDepth: PositiveInt.max(MAX_TREE_DEPTH)\n    .default(DEFAULT_LIST_DEPTH)\n    .describe(\n      `Max directory depth to traverse (default: ${String(DEFAULT_LIST_DEPTH)} = top-level only; increase to recurse deeper)`,\n    ),\n  maxEntries: PositiveInt.max(MAX_LIST_ENTRIES)\n    .default(DEFAULT_LIST_ENTRIES)\n    .describe(\n      `Page size (default: ${String(DEFAULT_LIST_ENTRIES)}). Continue with nextCursor; an incomplete first page also carries resourceUri for the whole list.`,\n    ),\n  includeHidden: includeHiddenField(),\n  includeIgnored: includeIgnoredField(),\n  cursor: CursorSchema,\n});\n\nconst ListOutputSchema = z.strictObject({\n  path: z.string().optional().describe('Resolved absolute path of the listed directory'),\n  entries: z\n    .array(\n      z.strictObject({\n        name: z.string().describe('Entry basename'),\n        relativePath: z.string().describe('POSIX path relative to the listed directory'),\n        type: FileTypeEnum.describe('Entry type: file, directory, symlink, or other'),\n      }),\n    )\n    .describe('Inline directory entries sorted directories-first then alphabetically by name'),\n  // No `markdown` field: the ASCII tree is the call's text content already, and\n  // carrying it here too doubled every list response for a string the client\n  // has in hand. The stored full-tree resource still holds its own copy — that\n  // one is a *different* (uncapped) tree and is never sent inline.\n  entryCount: NonNegInt.describe('Number of entries included in this response'),\n  totalEntries: NonNegInt.describe('Total entries found before the maxEntries cap was applied'),\n  totalFiles: NonNegInt.describe('Total number of files found'),\n  totalDirectories: NonNegInt.describe('Total number of directories found'),\n  resourceUri: z\n    .string()\n    .optional()\n    .describe(\n      'URI to the full entry list in the resource store; first page only, whenever the response is ' +\n        'incomplete — more pages follow, or the hard cap cut the listing. The stored list is itself ' +\n        'bounded by that cap and marked truncated if exceeded.',\n    ),\n  nextCursor: NextCursorSchema,\n});\n\ninterface ListPageMetadata {\n  readonly path: string;\n  readonly totalEntries: number;\n  readonly totalFiles: number;\n  readonly totalDirectories: number;\n}\n\nfunction listQueryKey(args: z.infer<typeof ListInputSchema>, path: string): string {\n  return JSON.stringify({\n    method: 'list',\n    path,\n    maxDepth: args.maxDepth,\n    includeHidden: args.includeHidden,\n    includeIgnored: args.includeIgnored,\n  });\n}\n\nfunction listOutput(\n  entries: readonly CollectedEntry[],\n  metadata: ListPageMetadata,\n  nextCursor: string | undefined,\n  resourceUri: string | undefined,\n): z.infer<typeof ListOutputSchema> {\n  return {\n    path: metadata.path,\n    entries: [...entries],\n    entryCount: entries.length,\n    totalEntries: metadata.totalEntries,\n    totalFiles: metadata.totalFiles,\n    totalDirectories: metadata.totalDirectories,\n    ...(resourceUri !== undefined ? { resourceUri } : {}),\n    ...(nextCursor !== undefined ? { nextCursor } : {}),\n  };\n}\n\nasync function handleList(\n  args: z.infer<typeof ListInputSchema>,\n  ctx: ToolCtx,\n): Promise<{\n  structured: z.infer<typeof ListOutputSchema>;\n  markdown: string;\n  link?: ContentBlock;\n}> {\n  const path = args.path;\n  const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);\n  const queryKey = listQueryKey(args, resolvedPath);\n  const { resourceStore } = ctx;\n\n  const paged = await paginate<CollectedEntry, ListPageMetadata, JsonResourceResult>({\n    store: ctx.pageStore,\n    queryKey,\n    cursor: args.cursor,\n    pageSize: args.maxEntries,\n    produce: async () => {\n      const validDir = await ctx.fs.pathGuard.validateExistingDirectory(resolvedPath);\n      const result = await collect(validDir, {\n        maxDepth: args.maxDepth,\n        includeHidden: args.includeHidden,\n        includeIgnored: args.includeIgnored,\n        signal: AbortSignal.any([ctx.signal, AbortSignal.timeout(DEFAULT_SEARCH_TIMEOUT_MS)]),\n        pathGuard: ctx.fs.pathGuard,\n        entryCap: MAX_LIST_ENTRIES,\n        ...(ctx.onProgress ? { onProgress: ctx.onProgress } : {}),\n      });\n      return {\n        items: result.entries,\n        metadata: {\n          path: validDir,\n          totalEntries: result.totalEntries,\n          totalFiles: result.totalFiles,\n          totalDirectories: result.totalDirectories,\n        },\n        truncated: result.totalEntries > result.entries.length,\n      };\n    },\n    externalize: resourceStore\n      ? (entries, metadata) => {\n          const name = basename(metadata.path);\n          // The stored tree is the whole collected set — itself bounded by the\n          // hard cap, and marked when the cap cut it.\n          const fullOutput = {\n            entries,\n            markdown: renderMarkdown(name, entries),\n            totalEntries: metadata.totalEntries,\n            totalFiles: metadata.totalFiles,\n            totalDirectories: metadata.totalDirectories,\n            ...(metadata.totalEntries > entries.length ? { truncated: true } : {}),\n          };\n          return putJsonResource(resourceStore, `${name} tree`, fullOutput);\n        }\n      : undefined,\n  });\n\n  return {\n    structured: listOutput(paged.page, paged.metadata, paged.nextCursor, paged.resource?.entry.uri),\n    markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),\n    ...(paged.resource ? { link: paged.resource.link } : {}),\n  };\n}\n\nexport const LIST = defineTool({\n  name: 'list',\n  title: 'List',\n  description:\n    'List sorted directory entries and an ASCII tree. maxDepth=1 is top-level. ' +\n    'maxEntries sets page size; continue with nextCursor. An incomplete first page also carries resourceUri for the whole list.',\n  input: ListInputSchema,\n  output: ListOutputSchema,\n  // Not published: every field is a plainly-named scalar (`entryCount`,\n  // `totalFiles`, `nextCursor`) that one sample response teaches, and the\n  // schema costs 1599 chars of every session start. Publishing is reserved for\n  // the value-XOR-error union shape a sample cannot convey.\n  annotations: {\n    readOnlyHint: true,\n    idempotentHint: true,\n    destructiveHint: false,\n    openWorldHint: false,\n  },\n  timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,\n  defaultErrorCode: ErrorCode.NOT_DIRECTORY,\n  progress: (args) => ({\n    label: 'List',\n    subject: args.path ? basename(args.path) : '.',\n  }),\n  accessPaths: (args) => (args.path ? [args.path] : []),\n  run: async (args, ctx) => {\n    const { structured, markdown, link } = await handleList(args, ctx);\n    // The tree is what the model reads; nextCursor and the full-list URI used\n    // to reach it only through the structured half, which now ships as _meta.\n    // Both ride the text so paging needs no second lookup.\n    const trailer: string[] = [];\n    if (structured.nextCursor !== undefined) {\n      trailer.push(`nextCursor: ${structured.nextCursor}`);\n    }\n    if (structured.resourceUri !== undefined) {\n      trailer.push(\n        `${String(structured.entryCount)} of ${String(structured.totalEntries)} entries shown; full tree at ${structured.resourceUri}`,\n      );\n    }\n    return {\n      structured,\n      text: trailer.length > 0 ? `${markdown}\\n\\n${trailer.join('\\n')}` : markdown,\n      ...(link ? { resources: [link] } : {}),\n    };\n  },\n});\n"]}

package/dist/tools/move.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"move.d.ts","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AA8eA,eAAO,MAAM,IAAI,mCA8Cf,CAAC"}
+{"version":3,"file":"move.d.ts","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AAgfA,eAAO,MAAM,IAAI,mCA8Cf,CAAC"}

package/dist/tools/move.js

@@ -6,7 +6,7 @@ import { ErrorCode, FsError, isFsError, isNodeError, Problem, rethrowIfAborted,
 import { joinRoster, pathLabel } from '../core/fmt.js';
 import { destExists } from '../core/fs.js';
 import { choiceInput, pendingRoundTrip, readAcceptedChoice } from '../core/input-required.js';
-import { IS_CASE_INSENSITIVE_FS, isPathInsideDirectory, isSamePath } from '../core/path-utils.js';
+import { isPathInsideDirectory, isSamePath, normalizeCaseForComparison, } from '../core/path-utils.js';
 import { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.js';
 import { PARALLEL_CONCURRENCY } from '../core/util.js';
 import { defineTool } from './define.js';
@@ -164,9 +164,7 @@ async function runTransfers(items, ctx, op, overwrite) {
     const seenDest = new Set();
     const ready = [];
     for (const candidate of candidates) {
-        const destKey = IS_CASE_INSENSITIVE_FS
-            ? candidate.validDest.toLowerCase()
-            : candidate.validDest;
+        const destKey = normalizeCaseForComparison(candidate.validDest);
         if (seenDest.has(destKey)) {
             failures.push(pairFailure(candidate.pair, new FsError(ErrorCode.INVALID_INPUT, `${VERB[op]} cancelled: another entry in this batch already targets destination "${candidate.pair.destination}"`, candidate.pair.destination)));
             continue;