@j0hanz/filesystem-mcp 2.5.2 → 2.6.1

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,KAAK,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAkB,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzE,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EACL,YAAY,EACZ,QAAQ,IAAI,YAAY,EACxB,aAAa,EACb,cAAc,EACd,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,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,WAAW,EAAE,CAAC,OAAO,CAAC,cAAc;QACpC,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,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,OAAO,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/B,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,IAA+B;IACvE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEvC,2EAA2E;IAC3E,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;IACjE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,KACE,IAAI,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,EAC3C,GAAG,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAChC,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EACxB,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7B,+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,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEtF,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;AAE7B,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,aAAa;IAC5B,cAAc,EAAE,cAAc;IAC9B,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,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAOZ,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,IAAI,CAAC,SAAS,CAAC;QAC9B,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,YAAY;QAClB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,cAAc,EAAE,IAAI,CAAC,cAAc;KACpC,CAAC,CAAC;IACH,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,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC;IAC9C,OAAO;QACL,UAAU,EAAE;YACV,GAAG,KAAK,CAAC,QAAQ;YACjB,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM;YAC7B,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,GAAG,CAAC,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5E;QACD,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxE,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,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,mFAAmF;QACnF,+BAA+B;IACjC,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,sEAAsE;IACtE,wEAAwE;IACxE,6EAA6E;IAC7E,0DAA0D;IAC1D,WAAW,EAAE;QACX,YAAY,EAAE,IAAI;QAClB,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,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC3E,2EAA2E;QAC3E,yEAAyE;QACzE,4EAA4E;QAC5E,MAAM,IAAI,GACR,QAAQ;YACR,WAAW,CAAC;gBACV,MAAM;gBACN,KAAK,EAAE,UAAU,CAAC,UAAU;gBAC5B,KAAK,EAAE,UAAU,CAAC,YAAY;gBAC9B,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,MAAM;gBACZ,UAAU,EAAE,UAAU,CAAC,UAAU;aAClC,CAAC;YACF,CAAC,UAAU,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,kBAAkB,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3F,OAAO;YACL,UAAU;YACV,IAAI;YACJ,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, posix } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { paginate } from '../core/cursor.ts';\nimport { ErrorCode } from '../core/errors.ts';\nimport { pageTrailer } from '../core/fmt.ts';\nimport { globEntries } from '../core/glob.ts';\nimport { type EntryType, resolveEntryType } from '../core/path-utils.ts';\nimport type { PathGuard } from '../core/path.ts';\nimport { toPosixRelative } from '../core/path.ts';\nimport {\n  CursorSchema,\n  FileType as FileTypeEnum,\n  IncludeHidden,\n  IncludeIgnored,\n  NextCursorSchema,\n  NonNegInt,\n  OptionalPath,\n  PositiveInt,\n} from '../core/schema.ts';\nimport type { JsonResourceResult } from '../core/store.ts';\nimport { putJsonResource } from '../core/store.ts';\nimport {\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  DEFAULT_TREE_ENTRIES,\n  MAX_LIST_ENTRIES,\n  MAX_TREE_DEPTH,\n} from '../core/util.ts';\nimport { defineTool, type ToolCtx } from './define.ts';\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 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    skipIgnored: !options.includeIgnored,\n    signal: options.signal,\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 relPath = toPosixRelative(rootPath, entry.path);\n    const name = basename(relPath);\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, page: readonly CollectedEntry[]): string {\n  if (page.length === 0) return rootName;\n\n  // The tree is drawn down from the root, but a later page (or a capped set)\n  // can hold entries whose ancestors sat elsewhere; those would never be drawn.\n  // Re-draw each missing ancestor as context so every entry stays locatable.\n  const present = new Set(page.map((entry) => entry.relativePath));\n  const entries = [...page];\n  for (const entry of page) {\n    for (\n      let dir = posix.dirname(entry.relativePath);\n      dir !== '.' && !present.has(dir);\n      dir = posix.dirname(dir)\n    ) {\n      present.add(dir);\n      entries.push({ name: posix.basename(dir), relativePath: dir, type: 'directory' });\n    }\n  }\n  entries.sort(compareEntries);\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 + (child.type === 'directory' ? '/' : ''));\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;\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_TREE_ENTRIES)\n    .describe(\n      `Page size (default: ${String(DEFAULT_TREE_ENTRIES)}). Continue with nextCursor; an incomplete first page also carries resourceUri for the whole list.`,\n    ),\n  includeHidden: IncludeHidden,\n  includeIgnored: IncludeIgnored,\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\nasync function handleList(\n  args: z.infer<typeof ListInputSchema>,\n  ctx: ToolCtx,\n): Promise<{\n  structured: z.infer<typeof ListOutputSchema>;\n  markdown: string;\n  offset: number;\n  link?: ContentBlock;\n}> {\n  const path = args.path;\n  const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);\n  const queryKey = JSON.stringify({\n    method: 'list',\n    path: resolvedPath,\n    maxDepth: args.maxDepth,\n    includeHidden: args.includeHidden,\n    includeIgnored: args.includeIgnored,\n  });\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  const resourceUri = paged.resource?.entry.uri;\n  return {\n    structured: {\n      ...paged.metadata,\n      entries: [...paged.page],\n      entryCount: paged.page.length,\n      ...(resourceUri !== undefined ? { resourceUri } : {}),\n      ...(paged.nextCursor !== undefined ? { nextCursor: paged.nextCursor } : {}),\n    },\n    markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),\n    offset: paged.offset,\n    ...(paged.resource ? { link: paged.resource.link } : {}),\n  };\n}\n\nexport const LIST = defineTool({\n  name: 'list',\n  title: 'List',\n  description:\n    \"List a directory's files and subdirectories as a tree of names, like ls or tree. \" +\n    'stat returns sizes and dates.',\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    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, offset, link } = await handleList(args, ctx);\n    // The tree is what the model reads, so position and the full-list URI ride\n    // the text too — paging needs no second lookup. `pageTrailer` is the one\n    // owner of that line, and it owes it on the last page as much as the first.\n    const text =\n      markdown +\n      pageTrailer({\n        offset,\n        shown: structured.entryCount,\n        total: structured.totalEntries,\n        noun: 'entries',\n        tool: 'list',\n        nextCursor: structured.nextCursor,\n      }) +\n      (structured.resourceUri !== undefined ? `\\nfull tree at ${structured.resourceUri}` : '');\n    return {\n      structured,\n      text,\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,KAAK,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAkB,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzE,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EACL,YAAY,EACZ,QAAQ,IAAI,YAAY,EACxB,aAAa,EACb,cAAc,EACd,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,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,WAAW,EAAE,CAAC,OAAO,CAAC,cAAc;QACpC,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,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,OAAO,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/B,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,IAA+B;IACvE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEvC,2EAA2E;IAC3E,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;IACjE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,KACE,IAAI,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,EAC3C,GAAG,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAChC,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EACxB,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7B,+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,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEtF,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;AAE7B,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,aAAa;IAC5B,cAAc,EAAE,cAAc;IAC9B,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,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAOZ,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,IAAI,CAAC,SAAS,CAAC;QAC9B,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,YAAY;QAClB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,cAAc,EAAE,IAAI,CAAC,cAAc;KACpC,CAAC,CAAC;IACH,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,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC;IAC9C,OAAO;QACL,UAAU,EAAE;YACV,GAAG,KAAK,CAAC,QAAQ;YACjB,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM;YAC7B,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,GAAG,CAAC,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5E;QACD,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxE,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,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,mFAAmF;QACnF,+BAA+B;IACjC,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,yEAAyE;IACzE,0EAA0E;IAC1E,iBAAiB;IACjB,WAAW,EAAE;QACX,YAAY,EAAE,IAAI;QAClB,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,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC3E,2EAA2E;QAC3E,yEAAyE;QACzE,4EAA4E;QAC5E,MAAM,IAAI,GACR,QAAQ;YACR,WAAW,CAAC;gBACV,MAAM;gBACN,KAAK,EAAE,UAAU,CAAC,UAAU;gBAC5B,KAAK,EAAE,UAAU,CAAC,YAAY;gBAC9B,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,MAAM;gBACZ,UAAU,EAAE,UAAU,CAAC,UAAU;gBACjC,QAAQ,EAAE,IAAI;aACf,CAAC;YACF,CAAC,UAAU,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,kBAAkB,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3F,OAAO;YACL,UAAU;YACV,IAAI;YACJ,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, posix } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { paginate } from '../core/cursor.ts';\nimport { ErrorCode } from '../core/errors.ts';\nimport { pageTrailer } from '../core/fmt.ts';\nimport { globEntries } from '../core/glob.ts';\nimport { type EntryType, resolveEntryType } from '../core/path-utils.ts';\nimport type { PathGuard } from '../core/path.ts';\nimport { toPosixRelative } from '../core/path.ts';\nimport {\n  CursorSchema,\n  FileType as FileTypeEnum,\n  IncludeHidden,\n  IncludeIgnored,\n  NextCursorSchema,\n  NonNegInt,\n  OptionalPath,\n  PositiveInt,\n} from '../core/schema.ts';\nimport type { JsonResourceResult } from '../core/store.ts';\nimport { putJsonResource } from '../core/store.ts';\nimport {\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  DEFAULT_TREE_ENTRIES,\n  MAX_LIST_ENTRIES,\n  MAX_TREE_DEPTH,\n} from '../core/util.ts';\nimport { defineTool, type ToolCtx } from './define.ts';\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 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    skipIgnored: !options.includeIgnored,\n    signal: options.signal,\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 relPath = toPosixRelative(rootPath, entry.path);\n    const name = basename(relPath);\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, page: readonly CollectedEntry[]): string {\n  if (page.length === 0) return rootName;\n\n  // The tree is drawn down from the root, but a later page (or a capped set)\n  // can hold entries whose ancestors sat elsewhere; those would never be drawn.\n  // Re-draw each missing ancestor as context so every entry stays locatable.\n  const present = new Set(page.map((entry) => entry.relativePath));\n  const entries = [...page];\n  for (const entry of page) {\n    for (\n      let dir = posix.dirname(entry.relativePath);\n      dir !== '.' && !present.has(dir);\n      dir = posix.dirname(dir)\n    ) {\n      present.add(dir);\n      entries.push({ name: posix.basename(dir), relativePath: dir, type: 'directory' });\n    }\n  }\n  entries.sort(compareEntries);\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 + (child.type === 'directory' ? '/' : ''));\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;\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_TREE_ENTRIES)\n    .describe(\n      `Page size (default: ${String(DEFAULT_TREE_ENTRIES)}). Continue with nextCursor; an incomplete first page also carries resourceUri for the whole list.`,\n    ),\n  includeHidden: IncludeHidden,\n  includeIgnored: IncludeIgnored,\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\nasync function handleList(\n  args: z.infer<typeof ListInputSchema>,\n  ctx: ToolCtx,\n): Promise<{\n  structured: z.infer<typeof ListOutputSchema>;\n  markdown: string;\n  offset: number;\n  link?: ContentBlock;\n}> {\n  const path = args.path;\n  const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);\n  const queryKey = JSON.stringify({\n    method: 'list',\n    path: resolvedPath,\n    maxDepth: args.maxDepth,\n    includeHidden: args.includeHidden,\n    includeIgnored: args.includeIgnored,\n  });\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  const resourceUri = paged.resource?.entry.uri;\n  return {\n    structured: {\n      ...paged.metadata,\n      entries: [...paged.page],\n      entryCount: paged.page.length,\n      ...(resourceUri !== undefined ? { resourceUri } : {}),\n      ...(paged.nextCursor !== undefined ? { nextCursor: paged.nextCursor } : {}),\n    },\n    markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),\n    offset: paged.offset,\n    ...(paged.resource ? { link: paged.resource.link } : {}),\n  };\n}\n\nexport const LIST = defineTool({\n  name: 'list',\n  title: 'List',\n  description:\n    \"List a directory's files and subdirectories as a tree of names, like ls or tree. \" +\n    'stat returns sizes and dates.',\n  input: ListInputSchema,\n  output: ListOutputSchema,\n  // No outputSchema, like every tool here (define.ts): one sample response\n  // teaches these scalar fields, and the schema would cost ~1.6 KB of every\n  // session start.\n  annotations: {\n    readOnlyHint: true,\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, offset, link } = await handleList(args, ctx);\n    // The tree is what the model reads, so position and the full-list URI ride\n    // the text too — paging needs no second lookup. `pageTrailer` is the one\n    // owner of that line, and it owes it on the last page as much as the first.\n    const text =\n      markdown +\n      pageTrailer({\n        offset,\n        shown: structured.entryCount,\n        total: structured.totalEntries,\n        noun: 'entries',\n        tool: 'list',\n        nextCursor: structured.nextCursor,\n        nextArgs: args,\n      }) +\n      (structured.resourceUri !== undefined ? `\\nfull tree at ${structured.resourceUri}` : '');\n    return {\n      structured,\n      text,\n      ...(link ? { resources: [link] } : {}),\n    };\n  },\n});\n"]}

package/dist/tools/move.d.ts

@@ -1,2 +1,4 @@
+import type { GuardedFileSystem } from '../core/fs.ts';
+export declare function performRenameWithFallback(validSource: string, validDest: string, fsOps: Pick<GuardedFileSystem, 'rename' | 'cp' | 'rm'>, originalSource: string): Promise<void>;
 export declare const MOVE: import("./define.ts").DefinedTool;
 //# sourceMappingURL=move.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"move.d.ts","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AAidA,eAAO,MAAM,IAAI,mCA8Cf,CAAC"}
+{"version":3,"file":"move.d.ts","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAsZvD,wBAAsB,yBAAyB,CAC7C,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,IAAI,CAAC,iBAAiB,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC,EACtD,cAAc,EAAE,MAAM,GACrB,OAAO,CAAC,IAAI,CAAC,CA2Cf;AAED,eAAO,MAAM,IAAI,mCA6Cf,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 { confirmKey, describeRefusal, pendingRoundTrip, readAcceptedChoice, } from "../core/input-required.js";
-import { isPathInsideDirectory, isSamePath, normalizeCaseForComparison, } from "../core/path-utils.js";
+import { isPathInsideDirectory, isSamePath, normalizeCaseForComparison, respellCaseOnlyTarget, } 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";
@@ -65,7 +65,14 @@ async function planTransfer(op, pair, fs, overwrite) {
     // opSource. validatePathForWrite resolves the destination through a symlink
     // too, so both sides of every check must be resolved to match.
     const resolvedSource = resolve(realSource);
-    const resolvedDest = resolve(validDest);
+    let resolvedDest = resolve(validDest);
+    // validatePathForWrite realpaths an existing destination to its on-disk
+    // spelling, so a case-only rename resolves to the source itself; re-spell
+    // it with the requested basename before deciding self vs. rename.
+    if (resolvedSource === resolvedDest) {
+        validDest = respellCaseOnlyTarget(pair.destination, validDest);
+        resolvedDest = resolve(validDest);
+    }
     const isSelf = resolvedSource === resolvedDest;
     const isCaseOnlyRename = !isSelf && isSamePath(resolvedSource, resolvedDest);
     // A copy onto a case-only variant of its own source is the same file, so it
@@ -261,7 +268,7 @@ async function validateTransferSource(op, source, fs) {
         throw new FsError(ErrorCode.ACCESS_DENIED, `${VERB[op]} failed for ${source}`, source);
     }
 }
-async function performRenameWithFallback(validSource, validDest, fsOps, originalSource) {
+export async function performRenameWithFallback(validSource, validDest, fsOps, originalSource) {
     try {
         await fsOps.rename(validSource, validDest);
     }
@@ -319,7 +326,6 @@ export const MOVE = defineTool({
         }
         return { label, subject: `${String(args.moves.length)} files` };
     },
-    defaultErrorCode: ErrorCode.UNKNOWN,
     accessPaths: (args) => args.moves.flatMap((m) => [m.source, m.destination]),
     run: async (args, ctx) => {
         const op = args.copy ? 'copy' : 'move';

package/dist/tools/move.js.map

@@ -1 +1 @@
-{"version":3,"file":"move.js","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEvD,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,OAAO,EACP,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EACL,UAAU,EACV,eAAe,EACf,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qBAAqB,EACrB,UAAU,EACV,0BAA0B,GAC3B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,cAAc,GAAG,CAAC,CAAC,YAAY,CAAC;IACpC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IAC9E,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC;CACvD,CAAC,CAAC;AAEH,MAAM,oBAAoB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;IAC1D,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;CAC9D,CAAC,CAAC;AAEH,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,iCAAiC,CAAC;IAC1F,IAAI,EAAE,mBAAmB,CAAC,iDAAiD,CAAC;IAC5E,SAAS,EAAE,mBAAmB,CAC5B,sEAAsE,CACvE;CACF,CAAC,CAAC;AAEH,MAAM,qBAAqB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC3C,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IAClE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IACjF,KAAK,EAAE,kBAAkB;CAC1B,CAAC,CAAC;AAIH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IAClF,QAAQ,EAAE,CAAC;SACR,KAAK,CAAC,qBAAqB,CAAC;SAC5B,QAAQ,EAAE;SACV,QAAQ,CAAC,oDAAoD,CAAC;IACjE,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,EAAE;SACV,QAAQ,CAAC,kDAAkD,CAAC;CAChE,CAAC,CAAC;AAMH,MAAM,IAAI,GAAqC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAyB9E;;;;;;;;;GASG;AACH,KAAK,UAAU,YAAY,CACzB,EAAU,EACV,IAA6C,EAC7C,EAAiB,EACjB,SAAkB;IAElB,IAAI,UAAkB,CAAC;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,MAAM,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/E,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,MAAM,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IAExC,MAAM,MAAM,GAAG,cAAc,KAAK,YAAY,CAAC;IAC/C,MAAM,gBAAgB,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IAE7E,4EAA4E;IAC5E,kEAAkE;IAClE,IAAI,MAAM,IAAI,CAAC,gBAAgB,IAAI,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;QAClD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,gBAAgB,IAAI,qBAAqB,CAAC,cAAc,EAAE,YAAY,CAAC,EAAE,CAAC;QAC7E,OAAO;YACL,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,WAAW,CAClB,IAAI,EACJ,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,UAAU,EAAE,wCAAwC,EACpD,IAAI,CAAC,MAAM,CACZ,CACF;SACF,CAAC;IACJ,CAAC;IAED,MAAM,qBAAqB,GAAG,CAAC,gBAAgB,IAAI,CAAC,MAAM,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,qBAAqB,IAAI,CAAC,SAAS,CAAC;IAEpD,OAAO;QACL,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,OAAO,EAAE;KACtF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,eAAe,CAC5B,EAAU,EACV,IAAkB,EAClB,GAA8D,EAC9D,aAAgC;IAEhC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,UAAU,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC3B,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,6BAA6B,IAAI,CAAC,IAAI,CAAC,WAAW,SAAS,eAAe,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE,EAChH,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,kEAAkE;IAClE,IACE,CAAC,IAAI,CAAC,gBAAgB;QACtB,CAAC,IAAI,CAAC,qBAAqB;QAC3B,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAC9C,CAAC;QACD,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,4BAA4B,IAAI,CAAC,IAAI,CAAC,WAAW,oCAAoC,EAChG,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEjE,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QAClB,MAAM,yBAAyB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzF,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,CAAC;IACrF,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE;YAC7C,SAAS,EAAE,IAAI;YACf,gBAAgB,EAAE,IAAI;YACtB,kBAAkB,EAAE,IAAI;YACxB,KAAK,EAAE,IAAI;SACZ,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;AAChE,CAAC;AAUD,SAAS,WAAW,CAClB,IAA6C,EAC7C,KAAc;IAEd,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC;KAClE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,YAAY,CACzB,KAAgD,EAChD,GAAY,EACZ,EAAU,EACV,SAAkB;IAKlB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CACtE,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,EACnD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IACF,wEAAwE;IACxE,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,cAAc;QAAE,MAAM,cAAc,CAAC,KAAK,CAAC;IAE/C,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACrD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9D,sDAAsD;IACxD,CAAC;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,yEAAyE;IACzE,yEAAyE;IACzE,uDAAuD;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,0BAA0B,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CACX,WAAW,CACT,SAAS,CAAC,IAAI,EACd,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,GAAG,IAAI,CAAC,EAAE,CAAC,wEAAwE,SAAS,CAAC,IAAI,CAAC,WAAW,GAAG,EAChH,SAAS,CAAC,IAAI,CAAC,WAAW,CAC3B,CACF,CACF,CAAC;YACF,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,aAAa,GAAG,KAAK;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;SACvB,IAAI,EAAE,CAAC;IACV,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,wEAAwE;QACxE,8DAA8D;QAC9D,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE;YACF,OAAO,EAAE,aAAa;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;YAC1C,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,WAAW,EAAE,CAAC,KAAK,EAAE,EAAE,CACrB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtB,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClB,OAAO,EACL,EAAE,KAAK,MAAM;oBACX,CAAC,CAAC,IAAI,IAAI,iCAAiC;oBAC3C,CAAC,CAAC,gBAAgB,IAAI,iCAAiC;gBAC3D,OAAO,EAAE,CAAC,WAAW,EAAE,MAAM,CAAC;aAC/B,CAAC,CAAC;SACN,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,SAAS,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC;IACF,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CAC1E,KAAK,EACL,KAAK,EAAE,SAAS,EAAE,EAAE;QAClB,IAAI,CAAC;YACH,OAAO,MAAM,eAAe,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,IAAI,EAAE,CAAC;QACT,CAAC;IACH,CAAC,EACD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,UAAU,EAAE,CAAC;QAC1C,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,SAAS,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;;YAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACxC,CAAC;AAED,SAAS,YAAY,CACnB,IAAqB,EACrB,OAAkC,EAClC,QAAoC,EACpC,OAA0B;IAE1B,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;IAClC,4EAA4E;IAC5E,uEAAuE;IACvE,2EAA2E;IAC3E,yDAAyD;IACzD,MAAM,MAAM,GAAG;QACb,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QAClE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;KACvD,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,UAAU,CAAC,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;IAC9D,IAAI,SAAS,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AASD;;;;;;;GAOG;AACH,KAAK,UAAU,sBAAsB,CACnC,EAAU,EACV,MAAc,EACd,EAAiB;IAEjB,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;QACnE,MAAM,QAAQ,GAAG,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC/F,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAClC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,MAAM,KAAK,CAAC;QAClC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,eAAe,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC;IACzF,CAAC;AACH,CAAC;AAED,KAAK,UAAU,yBAAyB,CACtC,WAAmB,EACnB,SAAiB,EACjB,KAAsD,EACtD,cAAsB;IAEtB,IAAI,CAAC;QACH,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAClD,MAAM,KAAK,CAAC;QACd,CAAC;QAED,wEAAwE;QACxE,iDAAiD;QACjD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE;gBACrC,SAAS,EAAE,IAAI;gBACf,gBAAgB,EAAE,IAAI;gBACtB,kBAAkB,EAAE,IAAI;aACzB,CAAC,CAAC;YACH,MAAM,GAAG,IAAI,CAAC;YACd,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAAC,OAAO,iBAAiB,EAAE,CAAC;YAC3B,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;YACpC,IAAI,MAAM,EAAE,CAAC;gBACX,uEAAuE;gBACvE,wEAAwE;gBACxE,0EAA0E;gBAC1E,6CAA6C;gBAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CACrC,iBAAiB,EACjB,SAAS,CAAC,OAAO,EACjB,cAAc,CACf,CAAC;gBACF,MAAM,IAAI,OAAO,CACf,WAAW,CAAC,IAAI,EAChB,wBAAwB,cAAc,0EAA0E,WAAW,CAAC,OAAO,EAAE,EACrI,cAAc,EACd,iBAAiB,CAClB,CAAC;YACJ,CAAC;YACD,MAAM,iBAAiB,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,oBAAoB;IAC3B,WAAW,EACT,iEAAiE;QACjE,2GAA2G;IAC7G,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO;gBACL,KAAK;gBACL,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,WAAW,IAAI,EAAE,CAAC,EAAE;aAClF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClE,CAAC;IACD,gBAAgB,EAAE,SAAS,CAAC,OAAO;IACnC,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAC3E,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,GAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC/C,6DAA6D;QAC7D,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;QACrF,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QACnD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;QAC/C,OAAO;YACL,UAAU,EAAE;gBACV,KAAK,EAAE,OAAO;gBACd,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3C;YACD,IAAI,EAAE,YAAY,CAAC,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC;YAClD,2EAA2E;YAC3E,uEAAuE;YACvE,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC;SACtE,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename, dirname, resolve } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.ts';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  Problem,\n  rethrowIfAborted,\n} from '../core/errors.ts';\nimport { joinRoster, pathLabel } from '../core/fmt.ts';\nimport { destExists } from '../core/fs.ts';\nimport type { GuardedFileSystem } from '../core/fs.ts';\nimport {\n  confirmKey,\n  describeRefusal,\n  pendingRoundTrip,\n  readAcceptedChoice,\n} from '../core/input-required.ts';\nimport {\n  isPathInsideDirectory,\n  isSamePath,\n  normalizeCaseForComparison,\n} from '../core/path-utils.ts';\nimport { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.ts';\nimport { PARALLEL_CONCURRENCY } from '../core/util.ts';\nimport type { ToolCtx } from './define.ts';\nimport { defineTool } from './define.ts';\n\nconst MoveItemSchema = z.strictObject({\n  source: RequiredPath.describe('Path of the file or directory to move or copy'),\n  destination: RequiredPath.describe('Destination path'),\n});\n\nconst MoveItemResultSchema = z.strictObject({\n  from: z.string().describe('Resolved absolute source path'),\n  to: z.string().describe('Resolved absolute destination path'),\n});\n\nconst MoveInputSchema = z.strictObject({\n  moves: z.array(MoveItemSchema).min(1).max(100).describe('Operations to perform (max 100)'),\n  copy: defaultFalseBoolean('Copy instead of move; sources are left in place'),\n  overwrite: defaultFalseBoolean(\n    'Copy mode only: overwrite existing destinations without confirmation',\n  ),\n});\n\nconst MoveFailureItemSchema = z.strictObject({\n  source: z.string().describe('Source path that could not be moved'),\n  destination: z.string().describe('Intended destination path for the failed move'),\n  error: PerFileErrorSchema,\n});\n\ntype MoveFailureItem = z.infer<typeof MoveFailureItemSchema>;\n\nconst MoveOutputSchema = z.strictObject({\n  moves: z.array(MoveItemResultSchema).describe('Successfully completed operations'),\n  failures: z\n    .array(MoveFailureItemSchema)\n    .optional()\n    .describe('Operations that failed with per-item error details'),\n  skipped: z\n    .array(z.string())\n    .optional()\n    .describe('Destinations skipped because the user chose Skip'),\n});\n\ntype MoveItemResult = z.infer<typeof MoveItemResultSchema>;\n\ntype PairOp = 'move' | 'copy';\n\nconst VERB: Readonly<Record<PairOp, string>> = { move: 'Move', copy: 'Copy' };\n\n/** A move or copy pre-checked up to the point a confirmation decision is needed. */\ninterface TransferPlan {\n  pair: { source: string; destination: string };\n  /**\n   * The path the mutation runs on: the link itself for a move, the resolved\n   * target for a copy. Every collision check uses the resolved source instead\n   * — see {@link validateTransferSource}.\n   */\n  opSource: string;\n  validDest: string;\n  /**\n   * A rename that only changes the destination's case. Move must perform it —\n   * it is real work — so it is exempt from the destination-exists checks that\n   * would otherwise read the source itself as an existing destination. Never\n   * true for a copy, which treats a case-only target as a self-copy and skips.\n   */\n  isCaseOnlyRename: boolean;\n  /** Whether the destination existed when planned (drives the TOCTOU guard). */\n  destExistedOriginally: boolean;\n  /** Destination exists and is not a self/case-only target → needs overwrite confirmation. */\n  pending: boolean;\n}\n\n/**\n * Phase 1 (no mutation): validate source and destination, reject self-targets\n * and transfers into a subdirectory of the source, and stat the destination to\n * decide whether this pair needs an overwrite confirmation. No `mkdir` happens\n * here — the old flow created the destination's parent before asking, which\n * mutated the filesystem before a confirmation; that now waits for phase 2 (R14).\n *\n * `overwrite` is copy-only — move has no confirmation bypass — so a move always\n * passes false.\n */\nasync function planTransfer(\n  op: PairOp,\n  pair: { source: string; destination: string },\n  fs: ToolCtx['fs'],\n  overwrite: boolean,\n): Promise<TransferPlanResult> {\n  let realSource: string;\n  let opSource: string;\n  let validDest: string;\n  try {\n    ({ realSource, opSource } = await validateTransferSource(op, pair.source, fs));\n    validDest = await fs.pathGuard.validatePathForWrite(pair.destination);\n  } catch (error) {\n    return { status: 'fail', failure: pairFailure(pair, error) };\n  }\n\n  // Comparisons run on the resolved source; only the fs call in phase 2 uses\n  // opSource. validatePathForWrite resolves the destination through a symlink\n  // too, so both sides of every check must be resolved to match.\n  const resolvedSource = resolve(realSource);\n  const resolvedDest = resolve(validDest);\n\n  const isSelf = resolvedSource === resolvedDest;\n  const isCaseOnlyRename = !isSelf && isSamePath(resolvedSource, resolvedDest);\n\n  // A copy onto a case-only variant of its own source is the same file, so it\n  // is a no-op; the same rename is real work for move and proceeds.\n  if (isSelf || (isCaseOnlyRename && op === 'copy')) {\n    return { status: 'noop' };\n  }\n\n  if (!isCaseOnlyRename && isPathInsideDirectory(resolvedSource, resolvedDest)) {\n    return {\n      status: 'fail',\n      failure: pairFailure(\n        pair,\n        new FsError(\n          ErrorCode.INVALID_INPUT,\n          `Cannot ${op} a directory into its own subdirectory`,\n          pair.source,\n        ),\n      ),\n    };\n  }\n\n  const destExistedOriginally = !isCaseOnlyRename && (await destExists(fs, validDest, op));\n  const pending = destExistedOriginally && !overwrite;\n\n  return {\n    status: 'plan',\n    plan: { pair, opSource, validDest, isCaseOnlyRename, destExistedOriginally, pending },\n  };\n}\n\n/**\n * Phase 2 (mutation): confirm an overwrite if needed, TOCTOU-check the\n * destination, create its parent, then rename (with cross-device fallback) or\n * copy. A declined/missing confirmation throws `CANCELLED`, collected as a\n * per-pair failure by the caller. A destination that appeared between plan and\n * mutation (created during the confirmation gap) also fails closed.\n */\nasync function executeTransfer(\n  op: PairOp,\n  plan: TransferPlan,\n  ctx: Pick<ToolCtx, 'fs' | 'signal' | 'inputResponses' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<TransferExecResult> {\n  if (plan.pending) {\n    const key = confirmKey(pendingSorted.indexOf(plan.validDest));\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: plan.pair.destination };\n    }\n    if (choice !== 'overwrite') {\n      throw new FsError(\n        ErrorCode.CANCELLED,\n        `${VERB[op]} cancelled: overwrite of \"${plan.pair.destination}\" was ${describeRefusal(ctx.inputResponses, key)}`,\n        plan.pair.destination,\n      );\n    }\n  }\n\n  // TOCTOU check before any mutation: a destination that did not exist when\n  // planned but exists now was created during the confirmation gap.\n  if (\n    !plan.isCaseOnlyRename &&\n    !plan.destExistedOriginally &&\n    (await destExists(ctx.fs, plan.validDest, op))\n  ) {\n    throw new FsError(\n      ErrorCode.CANCELLED,\n      `${VERB[op]} cancelled: destination \"${plan.pair.destination}\" was created during confirmation.`,\n      plan.pair.destination,\n    );\n  }\n\n  await ctx.fs.mkdir(dirname(plan.validDest), { recursive: true });\n\n  if (op === 'move') {\n    await performRenameWithFallback(plan.opSource, plan.validDest, ctx.fs, plan.pair.source);\n    ctx.log?.('info', `move: ${plan.pair.source} -> ${plan.pair.destination}`, 'move');\n  } else {\n    await ctx.fs.cp(plan.opSource, plan.validDest, {\n      recursive: true,\n      verbatimSymlinks: true,\n      preserveTimestamps: true,\n      force: true,\n    });\n  }\n  return { value: { from: plan.opSource, to: plan.validDest } };\n}\n\ntype TransferPlanResult =\n  | { status: 'fail'; failure: MoveFailureItem }\n  | { status: 'noop' }\n  | { status: 'plan'; plan: TransferPlan };\n\n/** A discriminated union, so the fold below narrows without a generic cast. */\ntype TransferExecResult = { readonly skipped: string } | { readonly value: MoveItemResult };\n\nfunction pairFailure(\n  pair: { source: string; destination: string },\n  error: unknown,\n): MoveFailureItem {\n  return {\n    source: pair.source,\n    destination: pair.destination,\n    error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, pair.source),\n  };\n}\n\n/**\n * The source→destination sibling of `runOverPaths`: plan every pair, fail closed\n * on a duplicated destination, round-trip the overwrite confirmations as one\n * set, then execute what survived in parallel. `copy` and `move` differ only in\n * their `plan` and `execute` callbacks.\n */\nasync function runTransfers(\n  items: readonly z.infer<typeof MoveItemSchema>[],\n  ctx: ToolCtx,\n  op: PairOp,\n  overwrite: boolean,\n): Promise<\n  | { results: MoveItemResult[]; skipped: string[]; failures: MoveFailureItem[] }\n  | InputRequiredResult\n> {\n  const { results: planned, errors: planErrors } = await processInParallel(\n    items,\n    (pair) => planTransfer(op, pair, ctx.fs, overwrite),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n  // plan callbacks are fail-closed (they return { status: 'fail' }, never\n  // throw), so planErrors should always be empty. Surface the first rather\n  // than silently dropping the item if a future plan callback violates that.\n  const firstPlanError = planErrors[0];\n  if (firstPlanError) throw firstPlanError.error;\n\n  const failures: MoveFailureItem[] = [];\n  const candidates: TransferPlan[] = [];\n  for (const { value } of planned) {\n    if (value.status === 'fail') failures.push(value.failure);\n    else if (value.status === 'plan') candidates.push(value.plan);\n    // 'noop' (self-copy / self-move) is silently skipped.\n  }\n\n  // Two sources targeting the same destination in one batch would otherwise\n  // collapse to a single shared overwrite confirmation and let the second\n  // one silently clobber the first's freshly-written content. Fail closed:\n  // only the first plan per destination proceeds; later ones targeting the\n  // same destination are reported as a per-item failure.\n  const seenDest = new Set<string>();\n  const ready: TransferPlan[] = [];\n  for (const candidate of candidates) {\n    const destKey = normalizeCaseForComparison(candidate.validDest);\n    if (seenDest.has(destKey)) {\n      failures.push(\n        pairFailure(\n          candidate.pair,\n          new FsError(\n            ErrorCode.INVALID_INPUT,\n            `${VERB[op]} cancelled: another entry in this batch already targets destination \"${candidate.pair.destination}\"`,\n            candidate.pair.destination,\n          ),\n        ),\n      );\n      continue;\n    }\n    seenDest.add(destKey);\n    ready.push(candidate);\n  }\n\n  const pendingSorted = ready\n    .filter((p) => p.pending)\n    .map((p) => p.validDest)\n    .sort();\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required; a retry whose verified state does not\n    // bind this overwrite set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip({\n      op,\n      pending: pendingSorted,\n      requestState: ctx.requestState,\n      clientCapabilities: ctx.clientCapabilities,\n      serverCtx: ctx.serverCtx,\n      buildInputs: (dests) =>\n        dests.map((dest, i) => ({\n          key: confirmKey(i),\n          message:\n            op === 'move'\n              ? `\"${dest}\" already exists. Overwrite it?`\n              : `Destination \"${dest}\" already exists. Overwrite it?`,\n          choices: ['overwrite', 'skip'],\n        })),\n    });\n    if (round !== undefined) return round;\n  }\n\n  const total = ready.length;\n  let completed = 0;\n  const tick = (): void => {\n    completed += 1;\n    ctx.onProgress?.({ current: completed, total });\n  };\n  const { results: execResults, errors: execErrors } = await processInParallel(\n    ready,\n    async (readyPlan) => {\n      try {\n        return await executeTransfer(op, readyPlan, ctx, pendingSorted);\n      } finally {\n        tick();\n      }\n    },\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { error, index } of execErrors) {\n    rethrowIfAborted(error);\n    const failed = ready[index];\n    if (failed) failures.push(pairFailure(failed.pair, error));\n  }\n\n  const results: MoveItemResult[] = [];\n  const skipped: string[] = [];\n  for (const { value } of execResults) {\n    if ('skipped' in value) skipped.push(value.skipped);\n    else results.push(value.value);\n  }\n\n  return { results, skipped, failures };\n}\n\nfunction buildSummary(\n  verb: 'move' | 'copy',\n  results: readonly MoveItemResult[],\n  failures: readonly MoveFailureItem[],\n  skipped: readonly string[],\n): string {\n  const failCount = failures.length;\n  // Name each pair. \"move: 2 items\" left the caller to open structuredContent\n  // to learn which two, and a partial failure was unreadable without it.\n  // Skipped destinations are an outcome the user chose, not a failure — name\n  // them, or an all-skipped call reads as \"copy: nothing\".\n  const tokens = [\n    ...results.map((r) => `${pathLabel(r.from)} → ${pathLabel(r.to)}`),\n    ...skipped.map((dest) => `${pathLabel(dest)} SKIPPED`),\n  ];\n  const parts = [`${verb}: ${joinRoster(tokens) || 'nothing'}`];\n  if (failCount > 0) parts.push(`${String(failCount)} failed`);\n  return parts.join(' · ');\n}\n\ninterface TransferSource {\n  /** Symlink resolved — the identity used for every same-target comparison. */\n  realSource: string;\n  /** The path the mutation runs on: symlink preserved for move, resolved for copy. */\n  opSource: string;\n}\n\n/**\n * A move needs two views of its source. Renaming must operate on the link\n * itself, or moving a symlink would rename the file it points at and leave the\n * link dangling. Every collision check must instead compare the resolved\n * target, or a link moved onto itself (or onto its own target) reads as a real\n * move and renames the link over that target, destroying it. A copy reads\n * through the link, so both views are the resolved one.\n */\nasync function validateTransferSource(\n  op: PairOp,\n  source: string,\n  fs: ToolCtx['fs'],\n): Promise<TransferSource> {\n  try {\n    const realSource = await fs.pathGuard.validateExistingPath(source);\n    const opSource = op === 'move' ? await fs.pathGuard.validatePathForDelete(source) : realSource;\n    return { realSource, opSource };\n  } catch (error) {\n    if (isFsError(error)) throw error;\n    throw new FsError(ErrorCode.ACCESS_DENIED, `${VERB[op]} failed for ${source}`, source);\n  }\n}\n\nasync function performRenameWithFallback(\n  validSource: string,\n  validDest: string,\n  fsOps: Pick<GuardedFileSystem, 'rename' | 'cp' | 'rm'>,\n  originalSource: string,\n): Promise<void> {\n  try {\n    await fsOps.rename(validSource, validDest);\n  } catch (error: unknown) {\n    rethrowIfAborted(error);\n\n    if (!isNodeError(error) || error.code !== 'EXDEV') {\n      throw error;\n    }\n\n    // EXDEV: cross-device rename. Copy then remove, preserving symlinks and\n    // timestamps so link semantics survive the move.\n    let copied = false;\n    try {\n      await fsOps.cp(validSource, validDest, {\n        recursive: true,\n        verbatimSymlinks: true,\n        preserveTimestamps: true,\n      });\n      copied = true;\n      await fsOps.rm(validSource, { recursive: true, force: true });\n    } catch (copyOrRemoveError) {\n      rethrowIfAborted(copyOrRemoveError);\n      if (copied) {\n        // cp succeeded but rm failed: the destination already holds a complete\n        // copy and the source remains. Surface the rm error as the cause so the\n        // caller can recover (clean up the duplicate) instead of a silent generic\n        // failure that hides the partial completion.\n        const baseProblem = Problem.fromUnknown(\n          copyOrRemoveError,\n          ErrorCode.UNKNOWN,\n          originalSource,\n        );\n        throw new FsError(\n          baseProblem.code,\n          `Cross-device move of ${originalSource}: copy succeeded but source removal failed (destination holds a copy): ${baseProblem.message}`,\n          originalSource,\n          copyOrRemoveError,\n        );\n      }\n      throw copyOrRemoveError;\n    }\n  }\n}\n\nexport const MOVE = defineTool({\n  name: 'move',\n  title: 'Move or Copy Files',\n  description:\n    'Move, rename, or copy files and directories, like mv or cp -r. ' +\n    'Each destination is the full new path, not a folder to move into; missing parent directories are created.',\n  input: MoveInputSchema,\n  output: MoveOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  progress: (args) => {\n    const label = args.copy ? 'Copy' : 'Move';\n    if (args.moves.length === 1) {\n      const move = args.moves[0];\n      return {\n        label,\n        subject: `${basename(move?.source ?? '')} → ${basename(move?.destination ?? '')}`,\n      };\n    }\n    return { label, subject: `${String(args.moves.length)} files` };\n  },\n  defaultErrorCode: ErrorCode.UNKNOWN,\n  accessPaths: (args) => args.moves.flatMap((m) => [m.source, m.destination]),\n  run: async (args, ctx) => {\n    const op: PairOp = args.copy ? 'copy' : 'move';\n    // `overwrite` is copy-only; move has no confirmation bypass.\n    const outcome = await runTransfers(args.moves, ctx, op, args.copy && args.overwrite);\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(outcome)) return outcome;\n    const { results, skipped, failures } = outcome;\n    return {\n      structured: {\n        moves: results,\n        ...(failures.length > 0 ? { failures } : {}),\n        ...(skipped.length > 0 ? { skipped } : {}),\n      },\n      text: buildSummary(op, results, failures, skipped),\n      // Every requested pair failed: no move, no copy, no user-chosen skip - the\n      // call did nothing. A skip is work the caller asked for, so it counts.\n      isError: failures.length > 0 && results.length + skipped.length === 0,\n    };\n  },\n});\n"]}
+{"version":3,"file":"move.js","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEvD,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,OAAO,EACP,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EACL,UAAU,EACV,eAAe,EACf,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qBAAqB,EACrB,UAAU,EACV,0BAA0B,EAC1B,qBAAqB,GACtB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,cAAc,GAAG,CAAC,CAAC,YAAY,CAAC;IACpC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IAC9E,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC;CACvD,CAAC,CAAC;AAEH,MAAM,oBAAoB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;IAC1D,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;CAC9D,CAAC,CAAC;AAEH,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,iCAAiC,CAAC;IAC1F,IAAI,EAAE,mBAAmB,CAAC,iDAAiD,CAAC;IAC5E,SAAS,EAAE,mBAAmB,CAC5B,sEAAsE,CACvE;CACF,CAAC,CAAC;AAEH,MAAM,qBAAqB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC3C,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IAClE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IACjF,KAAK,EAAE,kBAAkB;CAC1B,CAAC,CAAC;AAIH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IAClF,QAAQ,EAAE,CAAC;SACR,KAAK,CAAC,qBAAqB,CAAC;SAC5B,QAAQ,EAAE;SACV,QAAQ,CAAC,oDAAoD,CAAC;IACjE,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,EAAE;SACV,QAAQ,CAAC,kDAAkD,CAAC;CAChE,CAAC,CAAC;AAMH,MAAM,IAAI,GAAqC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAyB9E;;;;;;;;;GASG;AACH,KAAK,UAAU,YAAY,CACzB,EAAU,EACV,IAA6C,EAC7C,EAAiB,EACjB,SAAkB;IAElB,IAAI,UAAkB,CAAC;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,MAAM,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/E,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,MAAM,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAC3C,IAAI,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IAEtC,wEAAwE;IACxE,0EAA0E;IAC1E,kEAAkE;IAClE,IAAI,cAAc,KAAK,YAAY,EAAE,CAAC;QACpC,SAAS,GAAG,qBAAqB,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QAC/D,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,MAAM,GAAG,cAAc,KAAK,YAAY,CAAC;IAC/C,MAAM,gBAAgB,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IAE7E,4EAA4E;IAC5E,kEAAkE;IAClE,IAAI,MAAM,IAAI,CAAC,gBAAgB,IAAI,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;QAClD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,gBAAgB,IAAI,qBAAqB,CAAC,cAAc,EAAE,YAAY,CAAC,EAAE,CAAC;QAC7E,OAAO;YACL,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,WAAW,CAClB,IAAI,EACJ,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,UAAU,EAAE,wCAAwC,EACpD,IAAI,CAAC,MAAM,CACZ,CACF;SACF,CAAC;IACJ,CAAC;IAED,MAAM,qBAAqB,GAAG,CAAC,gBAAgB,IAAI,CAAC,MAAM,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,qBAAqB,IAAI,CAAC,SAAS,CAAC;IAEpD,OAAO;QACL,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,OAAO,EAAE;KACtF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,eAAe,CAC5B,EAAU,EACV,IAAkB,EAClB,GAA8D,EAC9D,aAAgC;IAEhC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,UAAU,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC3B,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,6BAA6B,IAAI,CAAC,IAAI,CAAC,WAAW,SAAS,eAAe,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE,EAChH,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,kEAAkE;IAClE,IACE,CAAC,IAAI,CAAC,gBAAgB;QACtB,CAAC,IAAI,CAAC,qBAAqB;QAC3B,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAC9C,CAAC;QACD,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,4BAA4B,IAAI,CAAC,IAAI,CAAC,WAAW,oCAAoC,EAChG,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEjE,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QAClB,MAAM,yBAAyB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzF,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,CAAC;IACrF,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE;YAC7C,SAAS,EAAE,IAAI;YACf,gBAAgB,EAAE,IAAI;YACtB,kBAAkB,EAAE,IAAI;YACxB,KAAK,EAAE,IAAI;SACZ,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;AAChE,CAAC;AAUD,SAAS,WAAW,CAClB,IAA6C,EAC7C,KAAc;IAEd,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC;KAClE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,YAAY,CACzB,KAAgD,EAChD,GAAY,EACZ,EAAU,EACV,SAAkB;IAKlB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CACtE,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,EACnD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IACF,wEAAwE;IACxE,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,cAAc;QAAE,MAAM,cAAc,CAAC,KAAK,CAAC;IAE/C,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACrD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9D,sDAAsD;IACxD,CAAC;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,yEAAyE;IACzE,yEAAyE;IACzE,uDAAuD;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,0BAA0B,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CACX,WAAW,CACT,SAAS,CAAC,IAAI,EACd,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,GAAG,IAAI,CAAC,EAAE,CAAC,wEAAwE,SAAS,CAAC,IAAI,CAAC,WAAW,GAAG,EAChH,SAAS,CAAC,IAAI,CAAC,WAAW,CAC3B,CACF,CACF,CAAC;YACF,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,aAAa,GAAG,KAAK;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;SACvB,IAAI,EAAE,CAAC;IACV,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,wEAAwE;QACxE,8DAA8D;QAC9D,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE;YACF,OAAO,EAAE,aAAa;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;YAC1C,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,WAAW,EAAE,CAAC,KAAK,EAAE,EAAE,CACrB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtB,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClB,OAAO,EACL,EAAE,KAAK,MAAM;oBACX,CAAC,CAAC,IAAI,IAAI,iCAAiC;oBAC3C,CAAC,CAAC,gBAAgB,IAAI,iCAAiC;gBAC3D,OAAO,EAAE,CAAC,WAAW,EAAE,MAAM,CAAC;aAC/B,CAAC,CAAC;SACN,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,SAAS,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC;IACF,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CAC1E,KAAK,EACL,KAAK,EAAE,SAAS,EAAE,EAAE;QAClB,IAAI,CAAC;YACH,OAAO,MAAM,eAAe,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,IAAI,EAAE,CAAC;QACT,CAAC;IACH,CAAC,EACD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,UAAU,EAAE,CAAC;QAC1C,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,SAAS,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;;YAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACxC,CAAC;AAED,SAAS,YAAY,CACnB,IAAqB,EACrB,OAAkC,EAClC,QAAoC,EACpC,OAA0B;IAE1B,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;IAClC,4EAA4E;IAC5E,uEAAuE;IACvE,2EAA2E;IAC3E,yDAAyD;IACzD,MAAM,MAAM,GAAG;QACb,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QAClE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;KACvD,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,UAAU,CAAC,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;IAC9D,IAAI,SAAS,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AASD;;;;;;;GAOG;AACH,KAAK,UAAU,sBAAsB,CACnC,EAAU,EACV,MAAc,EACd,EAAiB;IAEjB,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;QACnE,MAAM,QAAQ,GAAG,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC/F,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAClC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,MAAM,KAAK,CAAC;QAClC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,eAAe,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC;IACzF,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,WAAmB,EACnB,SAAiB,EACjB,KAAsD,EACtD,cAAsB;IAEtB,IAAI,CAAC;QACH,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAClD,MAAM,KAAK,CAAC;QACd,CAAC;QAED,wEAAwE;QACxE,iDAAiD;QACjD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE;gBACrC,SAAS,EAAE,IAAI;gBACf,gBAAgB,EAAE,IAAI;gBACtB,kBAAkB,EAAE,IAAI;aACzB,CAAC,CAAC;YACH,MAAM,GAAG,IAAI,CAAC;YACd,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAAC,OAAO,iBAAiB,EAAE,CAAC;YAC3B,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;YACpC,IAAI,MAAM,EAAE,CAAC;gBACX,uEAAuE;gBACvE,wEAAwE;gBACxE,0EAA0E;gBAC1E,6CAA6C;gBAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CACrC,iBAAiB,EACjB,SAAS,CAAC,OAAO,EACjB,cAAc,CACf,CAAC;gBACF,MAAM,IAAI,OAAO,CACf,WAAW,CAAC,IAAI,EAChB,wBAAwB,cAAc,0EAA0E,WAAW,CAAC,OAAO,EAAE,EACrI,cAAc,EACd,iBAAiB,CAClB,CAAC;YACJ,CAAC;YACD,MAAM,iBAAiB,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,oBAAoB;IAC3B,WAAW,EACT,iEAAiE;QACjE,2GAA2G;IAC7G,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO;gBACL,KAAK;gBACL,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,WAAW,IAAI,EAAE,CAAC,EAAE;aAClF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClE,CAAC;IACD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAC3E,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,GAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC/C,6DAA6D;QAC7D,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;QACrF,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QACnD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;QAC/C,OAAO;YACL,UAAU,EAAE;gBACV,KAAK,EAAE,OAAO;gBACd,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3C;YACD,IAAI,EAAE,YAAY,CAAC,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC;YAClD,2EAA2E;YAC3E,uEAAuE;YACvE,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC;SACtE,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename, dirname, resolve } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.ts';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  Problem,\n  rethrowIfAborted,\n} from '../core/errors.ts';\nimport { joinRoster, pathLabel } from '../core/fmt.ts';\nimport { destExists } from '../core/fs.ts';\nimport type { GuardedFileSystem } from '../core/fs.ts';\nimport {\n  confirmKey,\n  describeRefusal,\n  pendingRoundTrip,\n  readAcceptedChoice,\n} from '../core/input-required.ts';\nimport {\n  isPathInsideDirectory,\n  isSamePath,\n  normalizeCaseForComparison,\n  respellCaseOnlyTarget,\n} from '../core/path-utils.ts';\nimport { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.ts';\nimport { PARALLEL_CONCURRENCY } from '../core/util.ts';\nimport type { ToolCtx } from './define.ts';\nimport { defineTool } from './define.ts';\n\nconst MoveItemSchema = z.strictObject({\n  source: RequiredPath.describe('Path of the file or directory to move or copy'),\n  destination: RequiredPath.describe('Destination path'),\n});\n\nconst MoveItemResultSchema = z.strictObject({\n  from: z.string().describe('Resolved absolute source path'),\n  to: z.string().describe('Resolved absolute destination path'),\n});\n\nconst MoveInputSchema = z.strictObject({\n  moves: z.array(MoveItemSchema).min(1).max(100).describe('Operations to perform (max 100)'),\n  copy: defaultFalseBoolean('Copy instead of move; sources are left in place'),\n  overwrite: defaultFalseBoolean(\n    'Copy mode only: overwrite existing destinations without confirmation',\n  ),\n});\n\nconst MoveFailureItemSchema = z.strictObject({\n  source: z.string().describe('Source path that could not be moved'),\n  destination: z.string().describe('Intended destination path for the failed move'),\n  error: PerFileErrorSchema,\n});\n\ntype MoveFailureItem = z.infer<typeof MoveFailureItemSchema>;\n\nconst MoveOutputSchema = z.strictObject({\n  moves: z.array(MoveItemResultSchema).describe('Successfully completed operations'),\n  failures: z\n    .array(MoveFailureItemSchema)\n    .optional()\n    .describe('Operations that failed with per-item error details'),\n  skipped: z\n    .array(z.string())\n    .optional()\n    .describe('Destinations skipped because the user chose Skip'),\n});\n\ntype MoveItemResult = z.infer<typeof MoveItemResultSchema>;\n\ntype PairOp = 'move' | 'copy';\n\nconst VERB: Readonly<Record<PairOp, string>> = { move: 'Move', copy: 'Copy' };\n\n/** A move or copy pre-checked up to the point a confirmation decision is needed. */\ninterface TransferPlan {\n  pair: { source: string; destination: string };\n  /**\n   * The path the mutation runs on: the link itself for a move, the resolved\n   * target for a copy. Every collision check uses the resolved source instead\n   * — see {@link validateTransferSource}.\n   */\n  opSource: string;\n  validDest: string;\n  /**\n   * A rename that only changes the destination's case. Move must perform it —\n   * it is real work — so it is exempt from the destination-exists checks that\n   * would otherwise read the source itself as an existing destination. Never\n   * true for a copy, which treats a case-only target as a self-copy and skips.\n   */\n  isCaseOnlyRename: boolean;\n  /** Whether the destination existed when planned (drives the TOCTOU guard). */\n  destExistedOriginally: boolean;\n  /** Destination exists and is not a self/case-only target → needs overwrite confirmation. */\n  pending: boolean;\n}\n\n/**\n * Phase 1 (no mutation): validate source and destination, reject self-targets\n * and transfers into a subdirectory of the source, and stat the destination to\n * decide whether this pair needs an overwrite confirmation. No `mkdir` happens\n * here — the old flow created the destination's parent before asking, which\n * mutated the filesystem before a confirmation; that now waits for phase 2 (R14).\n *\n * `overwrite` is copy-only — move has no confirmation bypass — so a move always\n * passes false.\n */\nasync function planTransfer(\n  op: PairOp,\n  pair: { source: string; destination: string },\n  fs: ToolCtx['fs'],\n  overwrite: boolean,\n): Promise<TransferPlanResult> {\n  let realSource: string;\n  let opSource: string;\n  let validDest: string;\n  try {\n    ({ realSource, opSource } = await validateTransferSource(op, pair.source, fs));\n    validDest = await fs.pathGuard.validatePathForWrite(pair.destination);\n  } catch (error) {\n    return { status: 'fail', failure: pairFailure(pair, error) };\n  }\n\n  // Comparisons run on the resolved source; only the fs call in phase 2 uses\n  // opSource. validatePathForWrite resolves the destination through a symlink\n  // too, so both sides of every check must be resolved to match.\n  const resolvedSource = resolve(realSource);\n  let resolvedDest = resolve(validDest);\n\n  // validatePathForWrite realpaths an existing destination to its on-disk\n  // spelling, so a case-only rename resolves to the source itself; re-spell\n  // it with the requested basename before deciding self vs. rename.\n  if (resolvedSource === resolvedDest) {\n    validDest = respellCaseOnlyTarget(pair.destination, validDest);\n    resolvedDest = resolve(validDest);\n  }\n\n  const isSelf = resolvedSource === resolvedDest;\n  const isCaseOnlyRename = !isSelf && isSamePath(resolvedSource, resolvedDest);\n\n  // A copy onto a case-only variant of its own source is the same file, so it\n  // is a no-op; the same rename is real work for move and proceeds.\n  if (isSelf || (isCaseOnlyRename && op === 'copy')) {\n    return { status: 'noop' };\n  }\n\n  if (!isCaseOnlyRename && isPathInsideDirectory(resolvedSource, resolvedDest)) {\n    return {\n      status: 'fail',\n      failure: pairFailure(\n        pair,\n        new FsError(\n          ErrorCode.INVALID_INPUT,\n          `Cannot ${op} a directory into its own subdirectory`,\n          pair.source,\n        ),\n      ),\n    };\n  }\n\n  const destExistedOriginally = !isCaseOnlyRename && (await destExists(fs, validDest, op));\n  const pending = destExistedOriginally && !overwrite;\n\n  return {\n    status: 'plan',\n    plan: { pair, opSource, validDest, isCaseOnlyRename, destExistedOriginally, pending },\n  };\n}\n\n/**\n * Phase 2 (mutation): confirm an overwrite if needed, TOCTOU-check the\n * destination, create its parent, then rename (with cross-device fallback) or\n * copy. A declined/missing confirmation throws `CANCELLED`, collected as a\n * per-pair failure by the caller. A destination that appeared between plan and\n * mutation (created during the confirmation gap) also fails closed.\n */\nasync function executeTransfer(\n  op: PairOp,\n  plan: TransferPlan,\n  ctx: Pick<ToolCtx, 'fs' | 'signal' | 'inputResponses' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<TransferExecResult> {\n  if (plan.pending) {\n    const key = confirmKey(pendingSorted.indexOf(plan.validDest));\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: plan.pair.destination };\n    }\n    if (choice !== 'overwrite') {\n      throw new FsError(\n        ErrorCode.CANCELLED,\n        `${VERB[op]} cancelled: overwrite of \"${plan.pair.destination}\" was ${describeRefusal(ctx.inputResponses, key)}`,\n        plan.pair.destination,\n      );\n    }\n  }\n\n  // TOCTOU check before any mutation: a destination that did not exist when\n  // planned but exists now was created during the confirmation gap.\n  if (\n    !plan.isCaseOnlyRename &&\n    !plan.destExistedOriginally &&\n    (await destExists(ctx.fs, plan.validDest, op))\n  ) {\n    throw new FsError(\n      ErrorCode.CANCELLED,\n      `${VERB[op]} cancelled: destination \"${plan.pair.destination}\" was created during confirmation.`,\n      plan.pair.destination,\n    );\n  }\n\n  await ctx.fs.mkdir(dirname(plan.validDest), { recursive: true });\n\n  if (op === 'move') {\n    await performRenameWithFallback(plan.opSource, plan.validDest, ctx.fs, plan.pair.source);\n    ctx.log?.('info', `move: ${plan.pair.source} -> ${plan.pair.destination}`, 'move');\n  } else {\n    await ctx.fs.cp(plan.opSource, plan.validDest, {\n      recursive: true,\n      verbatimSymlinks: true,\n      preserveTimestamps: true,\n      force: true,\n    });\n  }\n  return { value: { from: plan.opSource, to: plan.validDest } };\n}\n\ntype TransferPlanResult =\n  | { status: 'fail'; failure: MoveFailureItem }\n  | { status: 'noop' }\n  | { status: 'plan'; plan: TransferPlan };\n\n/** A discriminated union, so the fold below narrows without a generic cast. */\ntype TransferExecResult = { readonly skipped: string } | { readonly value: MoveItemResult };\n\nfunction pairFailure(\n  pair: { source: string; destination: string },\n  error: unknown,\n): MoveFailureItem {\n  return {\n    source: pair.source,\n    destination: pair.destination,\n    error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, pair.source),\n  };\n}\n\n/**\n * The source→destination sibling of `runOverPaths`: plan every pair, fail closed\n * on a duplicated destination, round-trip the overwrite confirmations as one\n * set, then execute what survived in parallel. `copy` and `move` differ only in\n * their `plan` and `execute` callbacks.\n */\nasync function runTransfers(\n  items: readonly z.infer<typeof MoveItemSchema>[],\n  ctx: ToolCtx,\n  op: PairOp,\n  overwrite: boolean,\n): Promise<\n  | { results: MoveItemResult[]; skipped: string[]; failures: MoveFailureItem[] }\n  | InputRequiredResult\n> {\n  const { results: planned, errors: planErrors } = await processInParallel(\n    items,\n    (pair) => planTransfer(op, pair, ctx.fs, overwrite),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n  // plan callbacks are fail-closed (they return { status: 'fail' }, never\n  // throw), so planErrors should always be empty. Surface the first rather\n  // than silently dropping the item if a future plan callback violates that.\n  const firstPlanError = planErrors[0];\n  if (firstPlanError) throw firstPlanError.error;\n\n  const failures: MoveFailureItem[] = [];\n  const candidates: TransferPlan[] = [];\n  for (const { value } of planned) {\n    if (value.status === 'fail') failures.push(value.failure);\n    else if (value.status === 'plan') candidates.push(value.plan);\n    // 'noop' (self-copy / self-move) is silently skipped.\n  }\n\n  // Two sources targeting the same destination in one batch would otherwise\n  // collapse to a single shared overwrite confirmation and let the second\n  // one silently clobber the first's freshly-written content. Fail closed:\n  // only the first plan per destination proceeds; later ones targeting the\n  // same destination are reported as a per-item failure.\n  const seenDest = new Set<string>();\n  const ready: TransferPlan[] = [];\n  for (const candidate of candidates) {\n    const destKey = normalizeCaseForComparison(candidate.validDest);\n    if (seenDest.has(destKey)) {\n      failures.push(\n        pairFailure(\n          candidate.pair,\n          new FsError(\n            ErrorCode.INVALID_INPUT,\n            `${VERB[op]} cancelled: another entry in this batch already targets destination \"${candidate.pair.destination}\"`,\n            candidate.pair.destination,\n          ),\n        ),\n      );\n      continue;\n    }\n    seenDest.add(destKey);\n    ready.push(candidate);\n  }\n\n  const pendingSorted = ready\n    .filter((p) => p.pending)\n    .map((p) => p.validDest)\n    .sort();\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required; a retry whose verified state does not\n    // bind this overwrite set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip({\n      op,\n      pending: pendingSorted,\n      requestState: ctx.requestState,\n      clientCapabilities: ctx.clientCapabilities,\n      serverCtx: ctx.serverCtx,\n      buildInputs: (dests) =>\n        dests.map((dest, i) => ({\n          key: confirmKey(i),\n          message:\n            op === 'move'\n              ? `\"${dest}\" already exists. Overwrite it?`\n              : `Destination \"${dest}\" already exists. Overwrite it?`,\n          choices: ['overwrite', 'skip'],\n        })),\n    });\n    if (round !== undefined) return round;\n  }\n\n  const total = ready.length;\n  let completed = 0;\n  const tick = (): void => {\n    completed += 1;\n    ctx.onProgress?.({ current: completed, total });\n  };\n  const { results: execResults, errors: execErrors } = await processInParallel(\n    ready,\n    async (readyPlan) => {\n      try {\n        return await executeTransfer(op, readyPlan, ctx, pendingSorted);\n      } finally {\n        tick();\n      }\n    },\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { error, index } of execErrors) {\n    rethrowIfAborted(error);\n    const failed = ready[index];\n    if (failed) failures.push(pairFailure(failed.pair, error));\n  }\n\n  const results: MoveItemResult[] = [];\n  const skipped: string[] = [];\n  for (const { value } of execResults) {\n    if ('skipped' in value) skipped.push(value.skipped);\n    else results.push(value.value);\n  }\n\n  return { results, skipped, failures };\n}\n\nfunction buildSummary(\n  verb: 'move' | 'copy',\n  results: readonly MoveItemResult[],\n  failures: readonly MoveFailureItem[],\n  skipped: readonly string[],\n): string {\n  const failCount = failures.length;\n  // Name each pair. \"move: 2 items\" left the caller to open structuredContent\n  // to learn which two, and a partial failure was unreadable without it.\n  // Skipped destinations are an outcome the user chose, not a failure — name\n  // them, or an all-skipped call reads as \"copy: nothing\".\n  const tokens = [\n    ...results.map((r) => `${pathLabel(r.from)} → ${pathLabel(r.to)}`),\n    ...skipped.map((dest) => `${pathLabel(dest)} SKIPPED`),\n  ];\n  const parts = [`${verb}: ${joinRoster(tokens) || 'nothing'}`];\n  if (failCount > 0) parts.push(`${String(failCount)} failed`);\n  return parts.join(' · ');\n}\n\ninterface TransferSource {\n  /** Symlink resolved — the identity used for every same-target comparison. */\n  realSource: string;\n  /** The path the mutation runs on: symlink preserved for move, resolved for copy. */\n  opSource: string;\n}\n\n/**\n * A move needs two views of its source. Renaming must operate on the link\n * itself, or moving a symlink would rename the file it points at and leave the\n * link dangling. Every collision check must instead compare the resolved\n * target, or a link moved onto itself (or onto its own target) reads as a real\n * move and renames the link over that target, destroying it. A copy reads\n * through the link, so both views are the resolved one.\n */\nasync function validateTransferSource(\n  op: PairOp,\n  source: string,\n  fs: ToolCtx['fs'],\n): Promise<TransferSource> {\n  try {\n    const realSource = await fs.pathGuard.validateExistingPath(source);\n    const opSource = op === 'move' ? await fs.pathGuard.validatePathForDelete(source) : realSource;\n    return { realSource, opSource };\n  } catch (error) {\n    if (isFsError(error)) throw error;\n    throw new FsError(ErrorCode.ACCESS_DENIED, `${VERB[op]} failed for ${source}`, source);\n  }\n}\n\nexport async function performRenameWithFallback(\n  validSource: string,\n  validDest: string,\n  fsOps: Pick<GuardedFileSystem, 'rename' | 'cp' | 'rm'>,\n  originalSource: string,\n): Promise<void> {\n  try {\n    await fsOps.rename(validSource, validDest);\n  } catch (error: unknown) {\n    rethrowIfAborted(error);\n\n    if (!isNodeError(error) || error.code !== 'EXDEV') {\n      throw error;\n    }\n\n    // EXDEV: cross-device rename. Copy then remove, preserving symlinks and\n    // timestamps so link semantics survive the move.\n    let copied = false;\n    try {\n      await fsOps.cp(validSource, validDest, {\n        recursive: true,\n        verbatimSymlinks: true,\n        preserveTimestamps: true,\n      });\n      copied = true;\n      await fsOps.rm(validSource, { recursive: true, force: true });\n    } catch (copyOrRemoveError) {\n      rethrowIfAborted(copyOrRemoveError);\n      if (copied) {\n        // cp succeeded but rm failed: the destination already holds a complete\n        // copy and the source remains. Surface the rm error as the cause so the\n        // caller can recover (clean up the duplicate) instead of a silent generic\n        // failure that hides the partial completion.\n        const baseProblem = Problem.fromUnknown(\n          copyOrRemoveError,\n          ErrorCode.UNKNOWN,\n          originalSource,\n        );\n        throw new FsError(\n          baseProblem.code,\n          `Cross-device move of ${originalSource}: copy succeeded but source removal failed (destination holds a copy): ${baseProblem.message}`,\n          originalSource,\n          copyOrRemoveError,\n        );\n      }\n      throw copyOrRemoveError;\n    }\n  }\n}\n\nexport const MOVE = defineTool({\n  name: 'move',\n  title: 'Move or Copy Files',\n  description:\n    'Move, rename, or copy files and directories, like mv or cp -r. ' +\n    'Each destination is the full new path, not a folder to move into; missing parent directories are created.',\n  input: MoveInputSchema,\n  output: MoveOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  progress: (args) => {\n    const label = args.copy ? 'Copy' : 'Move';\n    if (args.moves.length === 1) {\n      const move = args.moves[0];\n      return {\n        label,\n        subject: `${basename(move?.source ?? '')} → ${basename(move?.destination ?? '')}`,\n      };\n    }\n    return { label, subject: `${String(args.moves.length)} files` };\n  },\n  accessPaths: (args) => args.moves.flatMap((m) => [m.source, m.destination]),\n  run: async (args, ctx) => {\n    const op: PairOp = args.copy ? 'copy' : 'move';\n    // `overwrite` is copy-only; move has no confirmation bypass.\n    const outcome = await runTransfers(args.moves, ctx, op, args.copy && args.overwrite);\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(outcome)) return outcome;\n    const { results, skipped, failures } = outcome;\n    return {\n      structured: {\n        moves: results,\n        ...(failures.length > 0 ? { failures } : {}),\n        ...(skipped.length > 0 ? { skipped } : {}),\n      },\n      text: buildSummary(op, results, failures, skipped),\n      // Every requested pair failed: no move, no copy, no user-chosen skip - the\n      // call did nothing. A skip is work the caller asked for, so it counts.\n      isError: failures.length > 0 && results.length + skipped.length === 0,\n    };\n  },\n});\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"patch.d.ts","sourceRoot":"","sources":["../../src/tools/patch.ts"],"names":[],"mappings":"AAwDA,eAAO,MAAM,KAAK,mCAsHhB,CAAC"}
+{"version":3,"file":"patch.d.ts","sourceRoot":"","sources":["../../src/tools/patch.ts"],"names":[],"mappings":"AA6DA,eAAO,MAAM,KAAK,mCA2HhB,CAAC"}

package/dist/tools/patch.js

@@ -20,7 +20,10 @@ const PatchOutputSchema = z.strictObject({
     lineCount: NonNegInt.describe('Number of lines in the file after patching'),
     mimeType: z.string().describe('Detected MIME type of the file'),
     kind: FileKind.describe('Broad file kind: text, binary, image, audio, or pdf'),
-    resourceUri: z.string().optional().describe('Resource URI pointing to the patched file content'),
+    resourceUri: z
+        .string()
+        .optional()
+        .describe('Resource URI pointing to the patched file content; omitted on dryRun or when the resulting file exceeds the text-size cap, which the store would reject'),
     modified: IsoDateTime.describe('Last modification timestamp after patching (ISO 8601 UTC)'),
     linesAdded: NonNegInt.describe('Number of lines added by the patch'),
     linesRemoved: NonNegInt.describe('Number of lines removed by the patch'),
@@ -111,7 +114,7 @@ export const PATCH = defineTool({
         // follow-up `read` when the caller actually wants the bytes.
         const summaryText = `patch: ${basename(args.path)} +${String(linesAdded)} -${String(linesRemoved)}`;
         if (!args.dryRun) {
-            await ctx.fs.writeFile(args.path, patched, { encoding: 'utf-8', signal: ctx.signal });
+            await ctx.fs.writeFile(args.path, patched, { signal: ctx.signal });
             ctx.log?.('info', `patch: ${args.path} (+${linesAdded}/-${linesRemoved})`, 'patch');
         }
         // `modified` is read from a post-write stat and is advisory: under a concurrent
@@ -120,7 +123,12 @@ export const PATCH = defineTool({
         const fileStats = args.dryRun
             ? stats
             : (await ctx.fs.stat(args.path, { signal: ctx.signal })).stats;
-        const meta = buildWrittenFileMeta(validPath, patched, ctx.resourceStore);
+        const meta = buildWrittenFileMeta({
+            validPath,
+            content: patched,
+            resourceStore: ctx.resourceStore,
+            dryRun: args.dryRun,
+        });
         return {
             structured: {
                 path: validPath,

package/dist/tools/patch.js.map

@@ -1 +1 @@
-{"version":3,"file":"patch.js","sourceRoot":"","sources":["../../src/tools/patch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EACL,mBAAmB,EACnB,QAAQ,EACR,WAAW,EACX,SAAS,EACT,YAAY,GACb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,2BAA2B,CAAC;IACxD,IAAI,EAAE,CAAC;SACJ,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,QAAQ,CAAC,kFAAkF,CAAC;IAC/F,MAAM,EAAE,mBAAmB,CAAC,qDAAqD,CAAC;CACnF,CAAC,CAAC;AAEH,MAAM,iBAAiB,GAAG,CAAC,CAAC,YAAY,CAAC;IACvC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,4CAA4C,CAAC;IACvE,IAAI,EAAE,SAAS,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IAC7D,SAAS,EAAE,SAAS,CAAC,QAAQ,CAAC,4CAA4C,CAAC;IAC3E,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gCAAgC,CAAC;IAC/D,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,qDAAqD,CAAC;IAC9E,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,mDAAmD,CAAC;IAChG,QAAQ,EAAE,WAAW,CAAC,QAAQ,CAAC,2DAA2D,CAAC;IAC3F,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,oCAAoC,CAAC;IACpE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,sCAAsC,CAAC;IACxE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oDAAoD,CAAC;CAC3F,CAAC,CAAC;AAEH,0EAA0E;AAC1E,8EAA8E;AAC9E,SAAS,iBAAiB,CAAC,WAAkD;IAI3E,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC;iBACrC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,YAAY,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC;AACtC,CAAC;AAED,MAAM,CAAC,MAAM,KAAK,GAAG,UAAU,CAAC;IAC9B,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,OAAO;IACd,WAAW,EACT,8EAA8E;QAC9E,4FAA4F;QAC5F,qEAAqE;IACvE,KAAK,EAAE,gBAAgB;IACvB,MAAM,EAAE,iBAAiB;IACzB,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,OAAO;QAChD,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;KAC7B,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAClC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE;YAC7E,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,IAAI,EAAE,OAAO;SACd,CAAC,CAAC;QAEH,+EAA+E;QAC/E,gFAAgF;QAChF,kCAAkC;QAClC,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,sDAAsD,MAAM,CAAC,MAAM,UAAU,EAC7E,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QACD,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,0FAA0F,EAC1F,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QACD,0EAA0E;QAC1E,yEAAyE;QACzE,yEAAyE;QACzE,2EAA2E;QAC3E,+CAA+C;QAC/C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAChD,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;oBAAE,eAAe,EAAE,CAAC;qBACtD,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;oBAAE,eAAe,GAAG,CAAC,CAAC;YAC7E,CAAC;YACD,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,eAAe,CAAC;YACnD,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,iFAAiF;QACjF,qEAAqE;QACrE,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,EAAE,GAAG,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/D,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,qGAAqG,EACrG,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QAED,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;QACpE,2EAA2E;QAC3E,0EAA0E;QAC1E,IAAI,UAAU,CAAC,OAAO,CAAC,KAAK,UAAU,CAAC,OAAO,CAAC,GAAG,UAAU,GAAG,YAAY,EAAE,CAAC;YAC5E,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,wGAAwG,EACxG,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QACD,4EAA4E;QAC5E,4EAA4E;QAC5E,yEAAyE;QACzE,6DAA6D;QAC7D,MAAM,WAAW,GAAG,UAAU,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,UAAU,CAAC,KAAK,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;QAEpG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACtF,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,IAAI,MAAM,UAAU,KAAK,YAAY,GAAG,EAAE,OAAO,CAAC,CAAC;QACtF,CAAC;QAED,gFAAgF;QAChF,gFAAgF;QAChF,sEAAsE;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM;YAC3B,CAAC,CAAC,KAAK;YACP,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QACjE,MAAM,IAAI,GAAG,oBAAoB,CAAC,SAAS,EAAE,OAAO,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;QACzE,OAAO;YACL,UAAU,EAAE;gBACV,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE;gBACvC,UAAU;gBACV,YAAY;gBACZ,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5E,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5C;YACD,sEAAsE;YACtE,qEAAqE;YACrE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW;YACzC,GAAG,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC/E,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\nimport { applyPatch, parsePatch } from 'diff';\n\nimport { ErrorCode, FsError } from '../core/errors.ts';\nimport { buildWrittenFileMeta } from '../core/file-uri.ts';\nimport { countLines } from '../core/read.ts';\nimport {\n  defaultFalseBoolean,\n  FileKind,\n  IsoDateTime,\n  NonNegInt,\n  RequiredPath,\n} from '../core/schema.ts';\nimport { defineTool } from './define.ts';\n\nconst PatchInputSchema = z.strictObject({\n  path: RequiredPath.describe('File to apply the diff to'),\n  diff: z\n    .string()\n    .min(1)\n    .describe('Single-file unified diff to apply (as produced by the diff tool or edit dry-run)'),\n  dryRun: defaultFalseBoolean('Preview the result without writing (default: false)'),\n});\n\nconst PatchOutputSchema = z.strictObject({\n  path: z.string().describe('Resolved absolute path of the patched file'),\n  size: NonNegInt.describe('File size in bytes after patching'),\n  lineCount: NonNegInt.describe('Number of lines in the file after patching'),\n  mimeType: z.string().describe('Detected MIME type of the file'),\n  kind: FileKind.describe('Broad file kind: text, binary, image, audio, or pdf'),\n  resourceUri: z.string().optional().describe('Resource URI pointing to the patched file content'),\n  modified: IsoDateTime.describe('Last modification timestamp after patching (ISO 8601 UTC)'),\n  linesAdded: NonNegInt.describe('Number of lines added by the patch'),\n  linesRemoved: NonNegInt.describe('Number of lines removed by the patch'),\n  diff: z.string().optional().describe('Unified diff preview (present only in dryRun mode)'),\n});\n\n// Hunk lines are the raw unified lines with their +/-/ leading prefix (no\n// +++/--- file headers inside hunks), so the first char is a reliable marker.\nfunction countAddedRemoved(parsedPatch: ReturnType<typeof parsePatch>[number]): {\n  linesAdded: number;\n  linesRemoved: number;\n} {\n  let linesAdded = 0;\n  let linesRemoved = 0;\n  for (const hunk of parsedPatch.hunks) {\n    for (const line of hunk.lines) {\n      if (line.startsWith('+')) linesAdded += 1;\n      else if (line.startsWith('-')) linesRemoved += 1;\n    }\n  }\n  return { linesAdded, linesRemoved };\n}\n\nexport const PATCH = defineTool({\n  name: 'patch',\n  title: 'Patch',\n  description:\n    'Apply a single-file unified diff to one existing text file, like git apply. ' +\n    'Nothing is written unless every hunk applies in file order with exactly matching context; ' +\n    'hunks are found by their context, so start line numbers may be off.',\n  input: PatchInputSchema,\n  output: PatchOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  progress: (args) => ({\n    label: args.dryRun ? 'Patch [dry run]' : 'Patch',\n    subject: basename(args.path),\n  }),\n  accessPaths: (args) => [args.path],\n  run: async (args, ctx) => {\n    const { validPath, content, stats } = await ctx.fs.readEditableText(args.path, {\n      signal: ctx.signal,\n      tool: 'patch',\n    });\n\n    // patch is single-file only: a multi-file unified diff (parsePatch length > 1)\n    // is rejected. Multi-file application needs per-file PathGuard-resolved loaders\n    // and is deferred (out of scope).\n    const parsed = parsePatch(args.diff);\n    if (parsed.length !== 1) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        `patch accepts a single-file unified diff; received ${parsed.length} file(s)`,\n        args.path,\n      );\n    }\n    const parsedPatch = parsed[0];\n    if (!parsedPatch || parsedPatch.hunks.length === 0) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        'patch accepts a single-file unified diff with at least one hunk; received an empty patch',\n        args.path,\n      );\n    }\n    // jsdiff tries each hunk at its header line before bounding the search by\n    // the previous hunk, so a header pointing back into text an earlier hunk\n    // already consumed applies there and emits that region twice. Start each\n    // hunk no earlier than where the previous hunk's changes end; its trailing\n    // context may still overlap, as jsdiff allows.\n    let floor = 0;\n    const hunks = parsedPatch.hunks.map((hunk) => {\n      const oldStart = Math.max(hunk.oldStart, floor);\n      let trailingContext = 0;\n      for (const line of hunk.lines) {\n        if (line === '' || line.startsWith(' ')) trailingContext++;\n        else if (line.startsWith('+') || line.startsWith('-')) trailingContext = 0;\n      }\n      floor = oldStart + hunk.oldLines - trailingContext;\n      return { ...hunk, oldStart };\n    });\n    // applyPatch returns false (strict) on hunk mismatch — not a falsy empty string,\n    // so `=== false` distinguishes a no-op patch ('') from a failed one.\n    const patched = applyPatch(content, { ...parsedPatch, hunks });\n    if (patched === false) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        'patch did not apply cleanly: hunk context does not match file content (hunks must be in file order)',\n        args.path,\n      );\n    }\n\n    const { linesAdded, linesRemoved } = countAddedRemoved(parsedPatch);\n    // Backstop for placements the clamp cannot see, such as zero-context hunks\n    // whose headers point past the end of the file: refuse rather than write.\n    if (countLines(patched) !== countLines(content) + linesAdded - linesRemoved) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        'patch would duplicate or drop lines: a hunk overlaps an earlier one or starts past the end of the file',\n        args.path,\n      );\n    }\n    // The patched file used to come back whole in the text block, so a one-line\n    // hunk against a 5000-line file returned 5000 lines. Every other write tool\n    // answers with a summary; the result is reachable via `resourceUri` or a\n    // follow-up `read` when the caller actually wants the bytes.\n    const summaryText = `patch: ${basename(args.path)} +${String(linesAdded)} -${String(linesRemoved)}`;\n\n    if (!args.dryRun) {\n      await ctx.fs.writeFile(args.path, patched, { encoding: 'utf-8', signal: ctx.signal });\n      ctx.log?.('info', `patch: ${args.path} (+${linesAdded}/-${linesRemoved})`, 'patch');\n    }\n\n    // `modified` is read from a post-write stat and is advisory: under a concurrent\n    // writer it may reflect that writer's mtime while `size`/content come from this\n    // patch's atomic write. The file content itself is always consistent.\n    const fileStats = args.dryRun\n      ? stats\n      : (await ctx.fs.stat(args.path, { signal: ctx.signal })).stats;\n    const meta = buildWrittenFileMeta(validPath, patched, ctx.resourceStore);\n    return {\n      structured: {\n        path: validPath,\n        size: meta.size,\n        lineCount: meta.lineCount,\n        mimeType: meta.mimeType,\n        kind: meta.kind,\n        modified: fileStats.mtime.toISOString(),\n        linesAdded,\n        linesRemoved,\n        ...(meta.resourceUri !== undefined ? { resourceUri: meta.resourceUri } : {}),\n        ...(args.dryRun ? { diff: args.diff } : {}),\n      },\n      // A dry run exists to be previewed, so it keeps returning the patched\n      // text; only the write path summarizes, where the bytes are on disk.\n      text: args.dryRun ? patched : summaryText,\n      ...(meta.resourceLink !== undefined ? { resources: [meta.resourceLink] } : {}),\n    };\n  },\n});\n"]}
+{"version":3,"file":"patch.js","sourceRoot":"","sources":["../../src/tools/patch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EACL,mBAAmB,EACnB,QAAQ,EACR,WAAW,EACX,SAAS,EACT,YAAY,GACb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,2BAA2B,CAAC;IACxD,IAAI,EAAE,CAAC;SACJ,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,QAAQ,CAAC,kFAAkF,CAAC;IAC/F,MAAM,EAAE,mBAAmB,CAAC,qDAAqD,CAAC;CACnF,CAAC,CAAC;AAEH,MAAM,iBAAiB,GAAG,CAAC,CAAC,YAAY,CAAC;IACvC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,4CAA4C,CAAC;IACvE,IAAI,EAAE,SAAS,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IAC7D,SAAS,EAAE,SAAS,CAAC,QAAQ,CAAC,4CAA4C,CAAC;IAC3E,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gCAAgC,CAAC;IAC/D,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,qDAAqD,CAAC;IAC9E,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,yJAAyJ,CAC1J;IACH,QAAQ,EAAE,WAAW,CAAC,QAAQ,CAAC,2DAA2D,CAAC;IAC3F,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,oCAAoC,CAAC;IACpE,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,sCAAsC,CAAC;IACxE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oDAAoD,CAAC;CAC3F,CAAC,CAAC;AAEH,0EAA0E;AAC1E,8EAA8E;AAC9E,SAAS,iBAAiB,CAAC,WAAkD;IAI3E,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC;iBACrC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,YAAY,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC;AACtC,CAAC;AAED,MAAM,CAAC,MAAM,KAAK,GAAG,UAAU,CAAC;IAC9B,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,OAAO;IACd,WAAW,EACT,8EAA8E;QAC9E,4FAA4F;QAC5F,qEAAqE;IACvE,KAAK,EAAE,gBAAgB;IACvB,MAAM,EAAE,iBAAiB;IACzB,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,OAAO;QAChD,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;KAC7B,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAClC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE;YAC7E,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,IAAI,EAAE,OAAO;SACd,CAAC,CAAC;QAEH,+EAA+E;QAC/E,gFAAgF;QAChF,kCAAkC;QAClC,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,sDAAsD,MAAM,CAAC,MAAM,UAAU,EAC7E,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QACD,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,0FAA0F,EAC1F,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QACD,0EAA0E;QAC1E,yEAAyE;QACzE,yEAAyE;QACzE,2EAA2E;QAC3E,+CAA+C;QAC/C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAChD,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;oBAAE,eAAe,EAAE,CAAC;qBACtD,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;oBAAE,eAAe,GAAG,CAAC,CAAC;YAC7E,CAAC;YACD,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,eAAe,CAAC;YACnD,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,iFAAiF;QACjF,qEAAqE;QACrE,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,EAAE,GAAG,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/D,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,qGAAqG,EACrG,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QAED,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;QACpE,2EAA2E;QAC3E,0EAA0E;QAC1E,IAAI,UAAU,CAAC,OAAO,CAAC,KAAK,UAAU,CAAC,OAAO,CAAC,GAAG,UAAU,GAAG,YAAY,EAAE,CAAC;YAC5E,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,wGAAwG,EACxG,IAAI,CAAC,IAAI,CACV,CAAC;QACJ,CAAC;QACD,4EAA4E;QAC5E,4EAA4E;QAC5E,yEAAyE;QACzE,6DAA6D;QAC7D,MAAM,WAAW,GAAG,UAAU,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,UAAU,CAAC,KAAK,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;QAEpG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACnE,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,IAAI,MAAM,UAAU,KAAK,YAAY,GAAG,EAAE,OAAO,CAAC,CAAC;QACtF,CAAC;QAED,gFAAgF;QAChF,gFAAgF;QAChF,sEAAsE;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM;YAC3B,CAAC,CAAC,KAAK;YACP,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QACjE,MAAM,IAAI,GAAG,oBAAoB,CAAC;YAChC,SAAS;YACT,OAAO,EAAE,OAAO;YAChB,aAAa,EAAE,GAAG,CAAC,aAAa;YAChC,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC;QACH,OAAO;YACL,UAAU,EAAE;gBACV,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE;gBACvC,UAAU;gBACV,YAAY;gBACZ,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5E,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5C;YACD,sEAAsE;YACtE,qEAAqE;YACrE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW;YACzC,GAAG,CAAC,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC/E,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\nimport { applyPatch, parsePatch } from 'diff';\n\nimport { ErrorCode, FsError } from '../core/errors.ts';\nimport { buildWrittenFileMeta } from '../core/file-uri.ts';\nimport { countLines } from '../core/read.ts';\nimport {\n  defaultFalseBoolean,\n  FileKind,\n  IsoDateTime,\n  NonNegInt,\n  RequiredPath,\n} from '../core/schema.ts';\nimport { defineTool } from './define.ts';\n\nconst PatchInputSchema = z.strictObject({\n  path: RequiredPath.describe('File to apply the diff to'),\n  diff: z\n    .string()\n    .min(1)\n    .describe('Single-file unified diff to apply (as produced by the diff tool or edit dry-run)'),\n  dryRun: defaultFalseBoolean('Preview the result without writing (default: false)'),\n});\n\nconst PatchOutputSchema = z.strictObject({\n  path: z.string().describe('Resolved absolute path of the patched file'),\n  size: NonNegInt.describe('File size in bytes after patching'),\n  lineCount: NonNegInt.describe('Number of lines in the file after patching'),\n  mimeType: z.string().describe('Detected MIME type of the file'),\n  kind: FileKind.describe('Broad file kind: text, binary, image, audio, or pdf'),\n  resourceUri: z\n    .string()\n    .optional()\n    .describe(\n      'Resource URI pointing to the patched file content; omitted on dryRun or when the resulting file exceeds the text-size cap, which the store would reject',\n    ),\n  modified: IsoDateTime.describe('Last modification timestamp after patching (ISO 8601 UTC)'),\n  linesAdded: NonNegInt.describe('Number of lines added by the patch'),\n  linesRemoved: NonNegInt.describe('Number of lines removed by the patch'),\n  diff: z.string().optional().describe('Unified diff preview (present only in dryRun mode)'),\n});\n\n// Hunk lines are the raw unified lines with their +/-/ leading prefix (no\n// +++/--- file headers inside hunks), so the first char is a reliable marker.\nfunction countAddedRemoved(parsedPatch: ReturnType<typeof parsePatch>[number]): {\n  linesAdded: number;\n  linesRemoved: number;\n} {\n  let linesAdded = 0;\n  let linesRemoved = 0;\n  for (const hunk of parsedPatch.hunks) {\n    for (const line of hunk.lines) {\n      if (line.startsWith('+')) linesAdded += 1;\n      else if (line.startsWith('-')) linesRemoved += 1;\n    }\n  }\n  return { linesAdded, linesRemoved };\n}\n\nexport const PATCH = defineTool({\n  name: 'patch',\n  title: 'Patch',\n  description:\n    'Apply a single-file unified diff to one existing text file, like git apply. ' +\n    'Nothing is written unless every hunk applies in file order with exactly matching context; ' +\n    'hunks are found by their context, so start line numbers may be off.',\n  input: PatchInputSchema,\n  output: PatchOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  progress: (args) => ({\n    label: args.dryRun ? 'Patch [dry run]' : 'Patch',\n    subject: basename(args.path),\n  }),\n  accessPaths: (args) => [args.path],\n  run: async (args, ctx) => {\n    const { validPath, content, stats } = await ctx.fs.readEditableText(args.path, {\n      signal: ctx.signal,\n      tool: 'patch',\n    });\n\n    // patch is single-file only: a multi-file unified diff (parsePatch length > 1)\n    // is rejected. Multi-file application needs per-file PathGuard-resolved loaders\n    // and is deferred (out of scope).\n    const parsed = parsePatch(args.diff);\n    if (parsed.length !== 1) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        `patch accepts a single-file unified diff; received ${parsed.length} file(s)`,\n        args.path,\n      );\n    }\n    const parsedPatch = parsed[0];\n    if (!parsedPatch || parsedPatch.hunks.length === 0) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        'patch accepts a single-file unified diff with at least one hunk; received an empty patch',\n        args.path,\n      );\n    }\n    // jsdiff tries each hunk at its header line before bounding the search by\n    // the previous hunk, so a header pointing back into text an earlier hunk\n    // already consumed applies there and emits that region twice. Start each\n    // hunk no earlier than where the previous hunk's changes end; its trailing\n    // context may still overlap, as jsdiff allows.\n    let floor = 0;\n    const hunks = parsedPatch.hunks.map((hunk) => {\n      const oldStart = Math.max(hunk.oldStart, floor);\n      let trailingContext = 0;\n      for (const line of hunk.lines) {\n        if (line === '' || line.startsWith(' ')) trailingContext++;\n        else if (line.startsWith('+') || line.startsWith('-')) trailingContext = 0;\n      }\n      floor = oldStart + hunk.oldLines - trailingContext;\n      return { ...hunk, oldStart };\n    });\n    // applyPatch returns false (strict) on hunk mismatch — not a falsy empty string,\n    // so `=== false` distinguishes a no-op patch ('') from a failed one.\n    const patched = applyPatch(content, { ...parsedPatch, hunks });\n    if (patched === false) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        'patch did not apply cleanly: hunk context does not match file content (hunks must be in file order)',\n        args.path,\n      );\n    }\n\n    const { linesAdded, linesRemoved } = countAddedRemoved(parsedPatch);\n    // Backstop for placements the clamp cannot see, such as zero-context hunks\n    // whose headers point past the end of the file: refuse rather than write.\n    if (countLines(patched) !== countLines(content) + linesAdded - linesRemoved) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        'patch would duplicate or drop lines: a hunk overlaps an earlier one or starts past the end of the file',\n        args.path,\n      );\n    }\n    // The patched file used to come back whole in the text block, so a one-line\n    // hunk against a 5000-line file returned 5000 lines. Every other write tool\n    // answers with a summary; the result is reachable via `resourceUri` or a\n    // follow-up `read` when the caller actually wants the bytes.\n    const summaryText = `patch: ${basename(args.path)} +${String(linesAdded)} -${String(linesRemoved)}`;\n\n    if (!args.dryRun) {\n      await ctx.fs.writeFile(args.path, patched, { signal: ctx.signal });\n      ctx.log?.('info', `patch: ${args.path} (+${linesAdded}/-${linesRemoved})`, 'patch');\n    }\n\n    // `modified` is read from a post-write stat and is advisory: under a concurrent\n    // writer it may reflect that writer's mtime while `size`/content come from this\n    // patch's atomic write. The file content itself is always consistent.\n    const fileStats = args.dryRun\n      ? stats\n      : (await ctx.fs.stat(args.path, { signal: ctx.signal })).stats;\n    const meta = buildWrittenFileMeta({\n      validPath,\n      content: patched,\n      resourceStore: ctx.resourceStore,\n      dryRun: args.dryRun,\n    });\n    return {\n      structured: {\n        path: validPath,\n        size: meta.size,\n        lineCount: meta.lineCount,\n        mimeType: meta.mimeType,\n        kind: meta.kind,\n        modified: fileStats.mtime.toISOString(),\n        linesAdded,\n        linesRemoved,\n        ...(meta.resourceUri !== undefined ? { resourceUri: meta.resourceUri } : {}),\n        ...(args.dryRun ? { diff: args.diff } : {}),\n      },\n      // A dry run exists to be previewed, so it keeps returning the patched\n      // text; only the write path summarizes, where the bytes are on disk.\n      text: args.dryRun ? patched : summaryText,\n      ...(meta.resourceLink !== undefined ? { resources: [meta.resourceLink] } : {}),\n    };\n  },\n});\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../src/tools/read.ts"],"names":[],"mappings":"AAkYA,eAAO,MAAM,IAAI,mCA+Jf,CAAC"}
+{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../src/tools/read.ts"],"names":[],"mappings":"AAgXA,eAAO,MAAM,IAAI,mCA+Jf,CAAC"}

package/dist/tools/read.js

@@ -6,7 +6,7 @@ import { ErrorCode } from "../core/errors.js";
 import { buildFileResourceLinkFor, buildFileResourceUri } from "../core/file-uri.js";
 import { detectMimeFromContent, detectMimeType } from "../core/mime.js";
 import { readFileWithStats } from "../core/read.js";
-import { ContinuationSchema, defaultFalseBoolean, FileKind, NonNegInt, OperationSummarySchema, PerFileErrorSchema, PositiveInt, Sha256Hex, singleOrBatchAccessPaths, singleOrBatchPathsInput, validateReadRange, } from "../core/schema.js";
+import { ContinuationSchema, defaultFalseBoolean, FileKind, NonNegInt, OperationSummarySchema, perPathEnvelope, PositiveInt, Sha256Hex, singleOrBatchAccessPaths, singleOrBatchPathsInput, validateReadRange, } from "../core/schema.js";
 import { DEFAULT_CONTINUATION_CHUNK_SIZE, DEFAULT_SEARCH_TIMEOUT_MS, getMaxTextFileSize, PARALLEL_CONCURRENCY, READ_MANY_MAX_TOTAL_BYTES, } from "../core/util.js";
 import { isTotalFailure, runOverPaths } from "./batch.js";
 import { defineTool } from "./define.js";
@@ -74,11 +74,7 @@ const ReadPerPathValueSchema = z.strictObject({
     endLine: PositiveInt.optional().describe('End line'),
     contentHash: Sha256Hex.optional().describe('SHA-256 hex digest of the returned content (present when includeHash=true)'),
 });
-const ReadPerPathSchema = z.strictObject({
-    path: z.string().describe('Requested file path'),
-    value: ReadPerPathValueSchema.optional().describe('Read result; present on success'),
-    error: PerFileErrorSchema.optional().describe('Error details; present on failure'),
-});
+const ReadPerPathSchema = perPathEnvelope(ReadPerPathValueSchema, 'Read result; present on success');
 const ReadFileOutputSchema = z.strictObject({
     results: z.array(ReadPerPathSchema).describe('Per-path results ordered to match the input paths'),
     summary: OperationSummarySchema,
@@ -159,42 +155,24 @@ async function collectFileBudget(filePaths, maxTotalSize, maxSize, ctx) {
     let total = 0;
     const skippedResults = new Map();
     const survivors = [];
-    let overflowed = false;
     for (let i = 0; i < filePaths.length; i += 1) {
         const path = filePaths[i];
         if (path === undefined)
             continue;
         const size = byIndex.get(i);
-        if (overflowed) {
-            // Only files that were actually stat'd get the TOO_LARGE result; a failed
-            // stat falls through to survivors so its read surfaces the real error —
-            // not a misleading TOO_LARGE.
-            if (size !== undefined) {
-                skippedResults.set(i, {
-                    path,
-                    error: {
-                        code: ErrorCode.TOO_LARGE,
-                        message: `Skipped: combined estimated read would exceed maxTotalSize (${String(maxTotalSize)} bytes)`,
-                        path,
-                    },
-                });
-            }
-            else {
-                survivors.push(path);
-            }
-            continue;
-        }
+        // A failed stat falls through to survivors so its read surfaces the real
+        // error, not a misleading TOO_LARGE.
         if (size === undefined) {
             survivors.push(path);
             continue;
         }
+        // Skip this file only; a later, smaller file that still fits is read.
         if (total + size > maxTotalSize) {
-            overflowed = true;
             skippedResults.set(i, {
                 path,
                 error: {
                     code: ErrorCode.TOO_LARGE,
-                    message: `Skipped: combined estimated read would exceed maxTotalSize (${String(maxTotalSize)} bytes)`,
+                    message: `Skipped: this file alone would push the batch past maxTotalSize (${String(maxTotalSize)} bytes). Read it on its own with path instead of paths.`,
                     path,
                 },
             });
@@ -344,7 +322,7 @@ export const READ = defineTool({
         // results are already built — return those rather than failing the call.
         const batch = survivors.length === 0
             ? { results: [] }
-            : await runOverPaths(batchInput, ctx, ({ path }) => readOnePath(path, args, ctx, known.get(path)), { defaultErrorCode: ErrorCode.NOT_FILE });
+            : await runOverPaths(batchInput, ctx, ErrorCode.NOT_FILE, ({ path }) => readOnePath(path, args, ctx, known.get(path)));
         const resultMap = new Map(batch.results.map((r) => [r.path, r]));
         const ordered = pathList.map((path, idx) => {
             const skipped = skippedResults.get(idx);