@smthrs/std 1.0.0-rc.8 → 1.0.0-rc.9

package/dist/esm/PortableSearch.js.map

@@ -1 +1 @@
-{"version":3,"file":"PortableSearch.js","sourceRoot":"","sources":["../../src/PortableSearch.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAgB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAC5D,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAC/C,OAAO,KAAK,QAAQ,MAAM,wBAAwB,CAAA;AAClD,OAAO,KAAK,WAAW,MAAM,2BAA2B,CAAA;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAA;AAC1D,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAA;AAC1D,OAAO,KAAK,IAAI,MAAM,oBAAoB,CAAA;AAC1C,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAA;AAC/C,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CACjB,UAAiC,EACjC,IAAe,EACf,MAAmB,EACnB,IAAY,EACZ,KAA4B,EACU,EAAE,CACxC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,IAAI,MAAM,CAAC,YAAY;QAAE,OAAO,MAAM,CAAC,KAAK,CAAA;IAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAC5C,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAChG,CAAA;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAA;IAC7D,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAA;AAC7D,CAAC,CAAC,CAAA;AAEJ,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE;IACvC,IAAI,IAAI,GAAG,EAAE,CAAA;IACb,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,MAAM,SAAS,IAAI,IAAI,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,KAAK,GAAG;YAAE,MAAK;QAC3B,IAAI,IAAI,SAAS,CAAA;IACnB,CAAC;IACD,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAA;AACxD,CAAC,CAAA;AAED,MAAM,IAAI,GAAG,CACX,KAAuB,EACiE,EAAE,CAC1F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC7B,MAAM,eAAe,GAAG,CAAC,QAAgB,EAAE,QAAgB,EAAE,EAAE,CAC7D,QAAQ,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAA;IAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAA;IAC7G,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;IACzF,MAAM,KAAK,GAAG,WAAW,CAAC,OAAO,CAC/B,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAC/D,WAAW,CACZ,CAAA;IACD,MAAM,YAAY,GAA4B,EAAE,CAAA;IAChD,MAAM,UAAU,GAAkB,EAAE,CAAA;IACpC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,aAAa,GAAG,CAAC,CAAA;IACrB,IAAI,aAAa,GAAG,CAAC,CAAA;IAErB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IACrF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,sEAAsE;QACtE,aAAa,EAAE,CAAA;QACf,MAAM,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,CAAA;QAChF,MAAM,OAAO,GAAkB,EAAE,CAAA;QACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAA;QACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAA;QACjD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,EAAE,CAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,UAAU,EAAE,CAAA;YACZ,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnC,IAAI,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,CAAA;gBAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;oBAClB,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAA;oBACtB,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,CAAA;gBAC1B,CAAC;gBACD,OAAO,GAAG,IAAI,CAAC,KAAK,CAAA;YACtB,CAAC;YACD,IAAI,OAAO;gBAAE,KAAK,EAAE,CAAA;YACpB,IAAI,SAAS,IAAI,CAAC;gBAAE,OAAM;YAC1B,mEAAmE;YACnE,kEAAkE;YAClE,MAAM,MAAM,GAAG,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,CAAA;YACxD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,CAAA;YAC/C,IAAI,MAAM,IAAI,UAAU,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC7E,MAAM,GAAG,GAAoB;oBAC3B,IAAI;oBACJ,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;oBACnB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;iBACnC,CAAA;gBACD,IAAI,MAAM,EAAE,CAAC;oBACX,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;oBACxB,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,MAAM;wBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;oBACrE,OAAO,GAAG,UAAU,GAAG,KAAK,CAAC,YAAY,CAAA;gBAC3C,CAAC;gBACD,IAAI,MAAM,IAAI,UAAU,IAAI,OAAO;oBAAE,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;gBAClE,IAAI,QAAQ,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;YACtE,CAAC;YACD,MAAM,CAAC,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC,CAAA;YAC/C,IAAI,OAAO,CAAC,MAAM,IAAI,SAAS,GAAG,CAAC;gBAAE,MAAM,CAAC,KAAK,EAAE,CAAA;QACrD,CAAC,CAAC,CAAA;QACJ,sEAAsE;QACtE,gEAAgE;QAChE,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;QACjC,IAAI,SAAS,GAAkB,EAAE,CAAA;QACjC,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,EAAE,CAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,IAAI,IAAI,GAAG,CAAC,CAAA;YACZ,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YACjC,OAAO,OAAO,IAAI,CAAC,EAAE,CAAC;gBACpB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAA;gBAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC/B,SAAS,GAAG,EAAE,CAAA;gBACd,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC/D,IAAI,GAAG,OAAO,GAAG,CAAC,CAAA;gBAClB,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACrC,CAAC;YACD,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;QAC5D,CAAC,CAAC,CAAA;QACJ,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,oEAAoE;YACpE,qEAAqE;YACrE,oEAAoE;YACpE,kEAAkE;YAClE,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CACjC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EACpG,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC1B,OAAO,GAAG,IAAI,CAAA;gBACd,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtB,OAAO,MAAM,CAAC,IAAI,CAChB,IAAI,QAAQ,CAAC,QAAQ,CAAC;wBACpB,IAAI,EAAE,aAAa;wBACnB,OAAO,EAAE,8BAA8B,IAAI,EAAE;wBAC7C,IAAI,EAAE,IAAI;qBACX,CAAC,CACH,CAAA;gBACH,CAAC;gBACD,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;YACzD,CAAC,CAAC,CACH,CAAA;YACD,KAAK,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;YAChC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;YAC7D,OAAO,IAAI,CAAA;QACb,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,IAAI,KAAK,YAAY,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACvC,IAAI,MAAM,CAAC,YAAY;oBAAE,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAClD,aAAa,EAAE,CAAA;YACjB,CAAC;YACD,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAC9B,CAAC,CAAC,CAAC,CAAA;QACH,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC;YAAE,SAAQ;QACrC,KAAK,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;QAC3C,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;YAC3B,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK;gBAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC1D,SAAQ;QACV,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;aACjG,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;QACtB,qEAAqE;QACrE,oEAAoE;QACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAA;QACzD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAA;YACjG,IAAI,MAAM,KAAK,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;QAC5E,CAAC;QACD,YAAY,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACrC,MAAM,aAAa,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QAChF,UAAU;QACV,IAAI;QACJ,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,OAAO,EAAE,MAAM,CAAC,OAAO;KACxB,CAAC,CAAA;IACF,OAAO;QACL,OAAO,EAAE,YAAY;QACrB,KAAK,EAAE,UAAU;QACjB,aAAa;QACb,aAAa;QACb,SAAS;QACT,GAAG,CAAC,SAAS;YACX,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;YACtF,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;KAClE,CAAA;AACH,CAAC,CAAC,CAAA;AAEJ,MAAM,IAAI,GAAG,CACX,KAAuB,EACiE,EAAE,CAC1F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC7B,MAAM,eAAe,GAAG,CAAC,QAAgB,EAAE,QAAgB,EAAE,EAAE,CAC7D,QAAQ,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAA;IAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAA;IAC7G,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;IACzF,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAA;IACrC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IAC5C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QAC1F,UAAU;QACV,IAAI;QACJ,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC;QACtB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,OAAO,EAAE,MAAM,CAAC,OAAO;KACxB,CAAC,CAAA;IACF,OAAO;QACL,KAAK;QACL,KAAK,EAAE,QAAQ,CAAC,MAAM;QACtB,SAAS,EAAE,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK;QACxC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtG,GAAG,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;KAClE,CAAA;AACH,CAAC,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,QAA4D,EAAiB,EAAE,CAClG,MAAM,CAAC,IAAI,CAAC;IACV,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC;IACtD,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC;CACvD,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAyE,KAAK,CAAC,MAAM,CACrG,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAqC,EAAE,IAAI,CAAC,CACtE,CAAA","sourcesContent":["/**\n * The in-process implementation of the ripgrep search contract.\n *\n * @since 1.0.0\n */\n\nimport * as Path from \"@smthrs/kernel/Path\"\nimport { type Context, Effect, Layer, Stream } from \"effect\"\nimport * as FileSystem from \"effect/FileSystem\"\nimport * as Grouping from \"./internal/Grouping.ts\"\nimport * as LinearRegex from \"./internal/LinearRegex.ts\"\nimport { escapeRegex } from \"./internal/SearchContract.ts\"\nimport { notice, truncateBytes } from \"./internal/Text.ts\"\nimport * as Walk from \"./internal/Walk.ts\"\nimport * as Search from \"./Search.ts\"\nimport * as Contract from \"./SearchContract.ts\"\nimport * as StdError from \"./StdError.ts\"\n\n/**\n * Narrows a walk to the files a search reports.\n *\n * A root that names one file is that file: `rg` searches a path given on the\n * command line whatever `-g` says, and follows it even when it is a symlink.\n * Everything a walk found is filtered by the globs first and probed for\n * symlinks second, so the probe runs over the far smaller included set.\n */\nconst candidates = (\n  fileSystem: FileSystem.FileSystem,\n  path: Path.Path,\n  walked: Walk.Walked,\n  root: string,\n  globs: ReadonlyArray<string>\n): Effect.Effect<ReadonlyArray<string>> =>\n  Effect.gen(function*() {\n    if (walked.explicitFile) return walked.files\n    const included = walked.files.filter((file) =>\n      Contract.includedByGlobs(globs, Walk.relativeForPattern(path, root, file), path.basename(file))\n    )\n    const links = yield* Walk.symbolicLinks(fileSystem, included)\n    return included.filter((_, index) => links[index] !== true)\n  })\n\nconst preview = (line: string): string => {\n  let head = \"\"\n  let length = 0\n  for (const character of line) {\n    if (length++ === 500) break\n    head += character\n  }\n  return truncateBytes(head, 500, { keep: \"head\" }).text\n}\n\nconst grep = (\n  input: Search.GrepInput\n): Effect.Effect<Search.GrepOutput, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const includedByGlobs = (relative: string, basename: string) =>\n      Contract.includedByGlobs(input.globs, relative, basename)\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs)\n    const insensitive = input.ignoreCase || (input.smartCase && !/[A-Z]/.test(input.pattern))\n    const regex = LinearRegex.compile(\n      input.fixedStrings ? escapeRegex(input.pattern) : input.pattern,\n      insensitive\n    )\n    const shownMatches: Array<Search.GrepMatch> = []\n    const shownFiles: Array<string> = []\n    let total = 0\n    let filesSearched = 0\n    let skippedBinary = 0\n\n    const included = yield* candidates(fileSystem, path, walked, input.root, input.globs)\n    for (const file of included) {\n      // Count every admitted file, including unreadable files and binaries.\n      filesSearched++\n      const remaining = input.filesWithMatches ? 0 : input.limit - shownMatches.length\n      const matched: Array<number> = []\n      const selected = new Map<number, Search.GrepLine>()\n      const recent = new Map<number, Search.GrepLine>()\n      let count = 0\n      let lineNumber = 0\n      let through = 0\n      const scanLine = (text: string) =>\n        Effect.gen(function*() {\n          lineNumber++\n          let matches = false\n          if (input.maxCount === undefined || count < input.maxCount) {\n            const evaluation = regex.test(text)\n            let step = evaluation.next()\n            while (!step.done) {\n              yield* Effect.yieldNow\n              step = evaluation.next()\n            }\n            matches = step.value\n          }\n          if (matches) count++\n          if (remaining <= 0) return\n          // The first overflow hit is a boundary: context nearest to it must\n          // not migrate to the last retained hit when the limit is applied.\n          const retain = matches && matched.length < remaining + 1\n          const awaiting = matched.length < remaining + 1\n          if (retain || lineNumber <= through || (awaiting && input.beforeContext > 0)) {\n            const row: Search.GrepLine = {\n              file,\n              line: lineNumber,\n              text: preview(text),\n              kind: retain ? \"match\" : \"context\"\n            }\n            if (retain) {\n              matched.push(lineNumber)\n              for (const [number, context] of recent) selected.set(number, context)\n              through = lineNumber + input.afterContext\n            }\n            if (retain || lineNumber <= through) selected.set(lineNumber, row)\n            if (awaiting && input.beforeContext > 0) recent.set(lineNumber, row)\n          }\n          recent.delete(lineNumber - input.beforeContext)\n          if (matched.length >= remaining + 1) recent.clear()\n        })\n      // Split only on LF (stripping a preceding CR), just like sourceLines.\n      // Stream.splitLines also treats a standalone CR as a delimiter.\n      const decoder = new TextDecoder()\n      let fragments: Array<string> = []\n      const consume = (chunk: string) =>\n        Effect.gen(function*() {\n          let from = 0\n          let newline = chunk.indexOf(\"\\n\")\n          while (newline >= 0) {\n            fragments.push(chunk.slice(from, newline))\n            const line = fragments.join(\"\")\n            fragments = []\n            yield* scanLine(line.endsWith(\"\\r\") ? line.slice(0, -1) : line)\n            from = newline + 1\n            newline = chunk.indexOf(\"\\n\", from)\n          }\n          if (from < chunk.length) fragments.push(chunk.slice(from))\n        })\n      const scanned = yield* Effect.gen(function*() {\n        let started = false\n        // A guarded disk host can safely expose atomic reads while refusing\n        // open streaming handles. Retry through that same filesystem service\n        // only before any bytes arrive, so a failed partial stream is never\n        // combined with a second reading of a file that may have changed.\n        yield* fileSystem.stream(file).pipe(\n          Stream.catch((error) => started ? Stream.fail(error) : Stream.fromEffect(fileSystem.readFile(file))),\n          Stream.runForEach((bytes) => {\n            started = true\n            if (bytes.includes(0)) {\n              return Effect.fail(\n                new StdError.StdError({\n                  code: \"binary_file\",\n                  message: `Cannot search binary file: ${file}`,\n                  path: file\n                })\n              )\n            }\n            return consume(decoder.decode(bytes, { stream: true }))\n          })\n        )\n        yield* consume(decoder.decode())\n        if (fragments.length > 0) yield* scanLine(fragments.join(\"\"))\n        return true\n      }).pipe(Effect.catch((error) => {\n        if (error instanceof StdError.StdError) {\n          if (walked.explicitFile) return Effect.fail(error)\n          skippedBinary++\n        }\n        return Effect.succeed(false)\n      }))\n      if (!scanned || count === 0) continue\n      total += input.filesWithMatches ? 1 : count\n      if (input.filesWithMatches) {\n        if (shownFiles.length < input.limit) shownFiles.push(file)\n        continue\n      }\n      if (matched.length === 0) continue\n      const grouped = Grouping.group([...selected.values()].sort((left, right) => left.line - right.line))\n        .slice(0, remaining)\n      // Source is needed only for returned symbols, and is released before\n      // moving to the next file. Overflow files never load symbol source.\n      const contents = new Map<string, ReadonlyArray<string>>()\n      if (input.symbols) {\n        const source = yield* fileSystem.readFileString(file).pipe(Effect.orElseSucceed(() => undefined))\n        if (source !== undefined) contents.set(file, Grouping.sourceLines(source))\n      }\n      shownMatches.push(...Grouping.annotate(grouped, contents))\n    }\n\n    const truncated = total > input.limit\n    const unsatisfiable = total > 0 ? undefined : yield* Contract.unsatisfiableNotice({\n      fileSystem,\n      path,\n      root: input.root,\n      globs: input.globs,\n      hidden: input.hidden,\n      noIgnore: input.noIgnore,\n      ignored: walked.ignored\n    })\n    return {\n      matches: shownMatches,\n      files: shownFiles,\n      filesSearched,\n      skippedBinary,\n      truncated,\n      ...(truncated\n        ? { notice: notice(input.filesWithMatches ? \"files\" : \"matches\", input.limit, total) }\n        : {}),\n      ...(unsatisfiable === undefined ? {} : { notice: unsatisfiable })\n    }\n  })\n\nconst glob = (\n  input: Search.GlobInput\n): Effect.Effect<Search.GlobOutput, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const includedByGlobs = (relative: string, basename: string) =>\n      Contract.includedByGlobs([input.pattern], relative, basename)\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs)\n    const included = yield* candidates(fileSystem, path, walked, input.root, [input.pattern])\n    const matching = [...included].sort()\n    const paths = matching.slice(0, input.limit)\n    const unsatisfiable = matching.length > 0 ? undefined : yield* Contract.unsatisfiableNotice({\n      fileSystem,\n      path,\n      root: input.root,\n      globs: [input.pattern],\n      hidden: input.hidden,\n      noIgnore: input.noIgnore,\n      ignored: walked.ignored\n    })\n    return {\n      paths,\n      total: matching.length,\n      truncated: matching.length > input.limit,\n      ...(matching.length > input.limit ? { notice: notice(\"entries\", paths.length, matching.length) } : {}),\n      ...(unsatisfiable === undefined ? {} : { notice: unsatisfiable })\n    }\n  })\n\n/**\n * Captures filesystem and path services in the portable peer.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const make = (services: Context.Context<FileSystem.FileSystem | Path.Path>): Search.Search =>\n  Search.make({\n    grep: (input) => Effect.provide(grep(input), services),\n    glob: (input) => Effect.provide(glob(input), services)\n  })\n\n/**\n * Provides the in-process peer.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layer: Layer.Layer<Search.Search, never, FileSystem.FileSystem | Path.Path> = Layer.effect(\n  Search.Search,\n  Effect.map(Effect.context<FileSystem.FileSystem | Path.Path>(), make)\n)\n"]}
+{"version":3,"file":"PortableSearch.js","sourceRoot":"","sources":["../../src/PortableSearch.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAgB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAC5D,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAC/C,OAAO,KAAK,QAAQ,MAAM,wBAAwB,CAAA;AAClD,OAAO,KAAK,WAAW,MAAM,2BAA2B,CAAA;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAA;AAC1D,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAA;AAC1D,OAAO,KAAK,IAAI,MAAM,oBAAoB,CAAA;AAC1C,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,KAAK,QAAQ,MAAM,qBAAqB,CAAA;AAC/C,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CACjB,UAAiC,EACjC,IAAe,EACf,MAAmB,EACnB,IAAY,EACZ,KAA4B,EACU,EAAE,CACxC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,IAAI,MAAM,CAAC,YAAY;QAAE,OAAO,MAAM,CAAC,KAAK,CAAA;IAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAC5C,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAChG,CAAA;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAA;IAC7D,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAA;AAC7D,CAAC,CAAC,CAAA;AAEJ,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE;IACvC,IAAI,IAAI,GAAG,EAAE,CAAA;IACb,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,MAAM,SAAS,IAAI,IAAI,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,KAAK,GAAG;YAAE,MAAK;QAC3B,IAAI,IAAI,SAAS,CAAA;IACnB,CAAC;IACD,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAA;AACxD,CAAC,CAAA;AAED,MAAM,IAAI,GAAG,CACX,KAAuB,EACiE,EAAE,CAC1F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC7B,MAAM,eAAe,GAAG,CAAC,QAAgB,EAAE,QAAgB,EAAE,EAAE,CAC7D,QAAQ,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAA;IAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAA;IAC7G,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;IACzF,MAAM,KAAK,GAAG,WAAW,CAAC,OAAO,CAC/B,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAC/D,WAAW,CACZ,CAAA;IACD,MAAM,YAAY,GAA4B,EAAE,CAAA;IAChD,MAAM,UAAU,GAAkB,EAAE,CAAA;IACpC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,aAAa,GAAG,CAAC,CAAA;IACrB,IAAI,aAAa,GAAG,CAAC,CAAA;IAErB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IACrF,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,sEAAsE;QACtE,aAAa,EAAE,CAAA;QACf,MAAM,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,CAAA;QAChF,MAAM,OAAO,GAAkB,EAAE,CAAA;QACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAA;QACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAA;QACjD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,EAAE,CAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,UAAU,EAAE,CAAA;YACZ,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;gBAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACnC,IAAI,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,CAAA;gBAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;oBAClB,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAA;oBACtB,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,CAAA;gBAC1B,CAAC;gBACD,OAAO,GAAG,IAAI,CAAC,KAAK,CAAA;YACtB,CAAC;YACD,IAAI,OAAO;gBAAE,KAAK,EAAE,CAAA;YACpB,IAAI,SAAS,IAAI,CAAC;gBAAE,OAAM;YAC1B,mEAAmE;YACnE,kEAAkE;YAClE,MAAM,MAAM,GAAG,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,CAAA;YACxD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,CAAA;YAC/C,IAAI,MAAM,IAAI,UAAU,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC7E,MAAM,GAAG,GAAoB;oBAC3B,IAAI;oBACJ,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;oBACnB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;iBACnC,CAAA;gBACD,IAAI,MAAM,EAAE,CAAC;oBACX,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;oBACxB,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,MAAM;wBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;oBACrE,OAAO,GAAG,UAAU,GAAG,KAAK,CAAC,YAAY,CAAA;gBAC3C,CAAC;gBACD,IAAI,MAAM,IAAI,UAAU,IAAI,OAAO;oBAAE,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;gBAClE,IAAI,QAAQ,IAAI,KAAK,CAAC,aAAa,GAAG,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;YACtE,CAAC;YACD,MAAM,CAAC,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC,CAAA;YAC/C,IAAI,OAAO,CAAC,MAAM,IAAI,SAAS,GAAG,CAAC;gBAAE,MAAM,CAAC,KAAK,EAAE,CAAA;QACrD,CAAC,CAAC,CAAA;QACJ,sEAAsE;QACtE,gEAAgE;QAChE,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;QACjC,IAAI,SAAS,GAAkB,EAAE,CAAA;QACjC,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,EAAE,CAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,IAAI,IAAI,GAAG,CAAC,CAAA;YACZ,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YACjC,OAAO,OAAO,IAAI,CAAC,EAAE,CAAC;gBACpB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAA;gBAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC/B,SAAS,GAAG,EAAE,CAAA;gBACd,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC/D,IAAI,GAAG,OAAO,GAAG,CAAC,CAAA;gBAClB,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACrC,CAAC;YACD,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;QAC5D,CAAC,CAAC,CAAA;QACJ,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,oEAAoE;YACpE,qEAAqE;YACrE,oEAAoE;YACpE,kEAAkE;YAClE,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CACjC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EACpG,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC1B,OAAO,GAAG,IAAI,CAAA;gBACd,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtB,OAAO,MAAM,CAAC,IAAI,CAChB,IAAI,QAAQ,CAAC,QAAQ,CAAC;wBACpB,IAAI,EAAE,aAAa;wBACnB,OAAO,EAAE,8BAA8B,IAAI,EAAE;wBAC7C,IAAI,EAAE,IAAI;qBACX,CAAC,CACH,CAAA;gBACH,CAAC;gBACD,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;YACzD,CAAC,CAAC,CACH,CAAA;YACD,KAAK,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;YAChC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;YAC7D,OAAO,IAAI,CAAA;QACb,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YAC7B,IAAI,KAAK,YAAY,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACvC,IAAI,MAAM,CAAC,YAAY;oBAAE,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAClD,aAAa,EAAE,CAAA;YACjB,CAAC;YACD,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAC9B,CAAC,CAAC,CAAC,CAAA;QACH,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC;YAAE,SAAQ;QACrC,KAAK,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;QAC3C,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;YAC3B,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK;gBAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC1D,SAAQ;QACV,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;aACjG,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;QACtB,qEAAqE;QACrE,oEAAoE;QACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAA;QACzD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAA;YACjG,IAAI,MAAM,KAAK,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;QAC5E,CAAC;QACD,YAAY,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACrC,MAAM,aAAa,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QAChF,UAAU;QACV,IAAI;QACJ,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,OAAO,EAAE,MAAM,CAAC,OAAO;KACxB,CAAC,CAAA;IACF,OAAO;QACL,OAAO,EAAE,YAAY;QACrB,KAAK,EAAE,UAAU;QACjB,aAAa;QACb,aAAa;QACb,SAAS;QACT,GAAG,CAAC,SAAS;YACX,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;YACtF,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;KAClE,CAAA;AACH,CAAC,CAAC,CAAA;AAEJ,MAAM,IAAI,GAAG,CACX,KAAuB,EACiE,EAAE,CAC1F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC7B,MAAM,eAAe,GAAG,CAAC,QAAgB,EAAE,QAAgB,EAAE,EAAE,CAC7D,QAAQ,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAA;IAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAA;IAC7G,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAA;IACzF,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAA;IACrC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IAC5C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QAC1F,UAAU;QACV,IAAI;QACJ,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC;QACtB,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,OAAO,EAAE,MAAM,CAAC,OAAO;KACxB,CAAC,CAAA;IACF,OAAO;QACL,KAAK;QACL,KAAK,EAAE,QAAQ,CAAC,MAAM;QACtB,SAAS,EAAE,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK;QACxC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtG,GAAG,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;KAClE,CAAA;AACH,CAAC,CAAC,CAAA;AAEJ;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,KAAuE,EACqB,EAAE,CAC9F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,CAAA;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAA;IAC5F,OAAO,KAAK,CAAC,CAAC,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;AAC7E,CAAC,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,QAA4D,EAAiB,EAAE,CAClG,MAAM,CAAC,IAAI,CAAC;IACV,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC;IACtD,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC;CACvD,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAyE,KAAK,CAAC,MAAM,CACrG,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAqC,EAAE,IAAI,CAAC,CACtE,CAAA","sourcesContent":["/**\n * The in-process implementation of the ripgrep search contract.\n *\n * @since 1.0.0\n */\n\nimport * as Path from \"@smthrs/kernel/Path\"\nimport { type Context, Effect, Layer, Stream } from \"effect\"\nimport * as FileSystem from \"effect/FileSystem\"\nimport * as Grouping from \"./internal/Grouping.ts\"\nimport * as LinearRegex from \"./internal/LinearRegex.ts\"\nimport { escapeRegex } from \"./internal/SearchContract.ts\"\nimport { notice, truncateBytes } from \"./internal/Text.ts\"\nimport * as Walk from \"./internal/Walk.ts\"\nimport * as Search from \"./Search.ts\"\nimport * as Contract from \"./SearchContract.ts\"\nimport * as StdError from \"./StdError.ts\"\n\n/**\n * Narrows a walk to the files a search reports.\n *\n * A root that names one file is that file: `rg` searches a path given on the\n * command line whatever `-g` says, and follows it even when it is a symlink.\n * Everything a walk found is filtered by the globs first and probed for\n * symlinks second, so the probe runs over the far smaller included set.\n */\nconst candidates = (\n  fileSystem: FileSystem.FileSystem,\n  path: Path.Path,\n  walked: Walk.Walked,\n  root: string,\n  globs: ReadonlyArray<string>\n): Effect.Effect<ReadonlyArray<string>> =>\n  Effect.gen(function*() {\n    if (walked.explicitFile) return walked.files\n    const included = walked.files.filter((file) =>\n      Contract.includedByGlobs(globs, Walk.relativeForPattern(path, root, file), path.basename(file))\n    )\n    const links = yield* Walk.symbolicLinks(fileSystem, included)\n    return included.filter((_, index) => links[index] !== true)\n  })\n\nconst preview = (line: string): string => {\n  let head = \"\"\n  let length = 0\n  for (const character of line) {\n    if (length++ === 500) break\n    head += character\n  }\n  return truncateBytes(head, 500, { keep: \"head\" }).text\n}\n\nconst grep = (\n  input: Search.GrepInput\n): Effect.Effect<Search.GrepOutput, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const includedByGlobs = (relative: string, basename: string) =>\n      Contract.includedByGlobs(input.globs, relative, basename)\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs)\n    const insensitive = input.ignoreCase || (input.smartCase && !/[A-Z]/.test(input.pattern))\n    const regex = LinearRegex.compile(\n      input.fixedStrings ? escapeRegex(input.pattern) : input.pattern,\n      insensitive\n    )\n    const shownMatches: Array<Search.GrepMatch> = []\n    const shownFiles: Array<string> = []\n    let total = 0\n    let filesSearched = 0\n    let skippedBinary = 0\n\n    const included = yield* candidates(fileSystem, path, walked, input.root, input.globs)\n    for (const file of included) {\n      // Count every admitted file, including unreadable files and binaries.\n      filesSearched++\n      const remaining = input.filesWithMatches ? 0 : input.limit - shownMatches.length\n      const matched: Array<number> = []\n      const selected = new Map<number, Search.GrepLine>()\n      const recent = new Map<number, Search.GrepLine>()\n      let count = 0\n      let lineNumber = 0\n      let through = 0\n      const scanLine = (text: string) =>\n        Effect.gen(function*() {\n          lineNumber++\n          let matches = false\n          if (input.maxCount === undefined || count < input.maxCount) {\n            const evaluation = regex.test(text)\n            let step = evaluation.next()\n            while (!step.done) {\n              yield* Effect.yieldNow\n              step = evaluation.next()\n            }\n            matches = step.value\n          }\n          if (matches) count++\n          if (remaining <= 0) return\n          // The first overflow hit is a boundary: context nearest to it must\n          // not migrate to the last retained hit when the limit is applied.\n          const retain = matches && matched.length < remaining + 1\n          const awaiting = matched.length < remaining + 1\n          if (retain || lineNumber <= through || (awaiting && input.beforeContext > 0)) {\n            const row: Search.GrepLine = {\n              file,\n              line: lineNumber,\n              text: preview(text),\n              kind: retain ? \"match\" : \"context\"\n            }\n            if (retain) {\n              matched.push(lineNumber)\n              for (const [number, context] of recent) selected.set(number, context)\n              through = lineNumber + input.afterContext\n            }\n            if (retain || lineNumber <= through) selected.set(lineNumber, row)\n            if (awaiting && input.beforeContext > 0) recent.set(lineNumber, row)\n          }\n          recent.delete(lineNumber - input.beforeContext)\n          if (matched.length >= remaining + 1) recent.clear()\n        })\n      // Split only on LF (stripping a preceding CR), just like sourceLines.\n      // Stream.splitLines also treats a standalone CR as a delimiter.\n      const decoder = new TextDecoder()\n      let fragments: Array<string> = []\n      const consume = (chunk: string) =>\n        Effect.gen(function*() {\n          let from = 0\n          let newline = chunk.indexOf(\"\\n\")\n          while (newline >= 0) {\n            fragments.push(chunk.slice(from, newline))\n            const line = fragments.join(\"\")\n            fragments = []\n            yield* scanLine(line.endsWith(\"\\r\") ? line.slice(0, -1) : line)\n            from = newline + 1\n            newline = chunk.indexOf(\"\\n\", from)\n          }\n          if (from < chunk.length) fragments.push(chunk.slice(from))\n        })\n      const scanned = yield* Effect.gen(function*() {\n        let started = false\n        // A guarded disk host can safely expose atomic reads while refusing\n        // open streaming handles. Retry through that same filesystem service\n        // only before any bytes arrive, so a failed partial stream is never\n        // combined with a second reading of a file that may have changed.\n        yield* fileSystem.stream(file).pipe(\n          Stream.catch((error) => started ? Stream.fail(error) : Stream.fromEffect(fileSystem.readFile(file))),\n          Stream.runForEach((bytes) => {\n            started = true\n            if (bytes.includes(0)) {\n              return Effect.fail(\n                new StdError.StdError({\n                  code: \"binary_file\",\n                  message: `Cannot search binary file: ${file}`,\n                  path: file\n                })\n              )\n            }\n            return consume(decoder.decode(bytes, { stream: true }))\n          })\n        )\n        yield* consume(decoder.decode())\n        if (fragments.length > 0) yield* scanLine(fragments.join(\"\"))\n        return true\n      }).pipe(Effect.catch((error) => {\n        if (error instanceof StdError.StdError) {\n          if (walked.explicitFile) return Effect.fail(error)\n          skippedBinary++\n        }\n        return Effect.succeed(false)\n      }))\n      if (!scanned || count === 0) continue\n      total += input.filesWithMatches ? 1 : count\n      if (input.filesWithMatches) {\n        if (shownFiles.length < input.limit) shownFiles.push(file)\n        continue\n      }\n      if (matched.length === 0) continue\n      const grouped = Grouping.group([...selected.values()].sort((left, right) => left.line - right.line))\n        .slice(0, remaining)\n      // Source is needed only for returned symbols, and is released before\n      // moving to the next file. Overflow files never load symbol source.\n      const contents = new Map<string, ReadonlyArray<string>>()\n      if (input.symbols) {\n        const source = yield* fileSystem.readFileString(file).pipe(Effect.orElseSucceed(() => undefined))\n        if (source !== undefined) contents.set(file, Grouping.sourceLines(source))\n      }\n      shownMatches.push(...Grouping.annotate(grouped, contents))\n    }\n\n    const truncated = total > input.limit\n    const unsatisfiable = total > 0 ? undefined : yield* Contract.unsatisfiableNotice({\n      fileSystem,\n      path,\n      root: input.root,\n      globs: input.globs,\n      hidden: input.hidden,\n      noIgnore: input.noIgnore,\n      ignored: walked.ignored\n    })\n    return {\n      matches: shownMatches,\n      files: shownFiles,\n      filesSearched,\n      skippedBinary,\n      truncated,\n      ...(truncated\n        ? { notice: notice(input.filesWithMatches ? \"files\" : \"matches\", input.limit, total) }\n        : {}),\n      ...(unsatisfiable === undefined ? {} : { notice: unsatisfiable })\n    }\n  })\n\nconst glob = (\n  input: Search.GlobInput\n): Effect.Effect<Search.GlobOutput, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const includedByGlobs = (relative: string, basename: string) =>\n      Contract.includedByGlobs([input.pattern], relative, basename)\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs)\n    const included = yield* candidates(fileSystem, path, walked, input.root, [input.pattern])\n    const matching = [...included].sort()\n    const paths = matching.slice(0, input.limit)\n    const unsatisfiable = matching.length > 0 ? undefined : yield* Contract.unsatisfiableNotice({\n      fileSystem,\n      path,\n      root: input.root,\n      globs: [input.pattern],\n      hidden: input.hidden,\n      noIgnore: input.noIgnore,\n      ignored: walked.ignored\n    })\n    return {\n      paths,\n      total: matching.length,\n      truncated: matching.length > input.limit,\n      ...(matching.length > input.limit ? { notice: notice(\"entries\", paths.length, matching.length) } : {}),\n      ...(unsatisfiable === undefined ? {} : { notice: unsatisfiable })\n    }\n  })\n\n/**\n * The files this peer's `grep` reads for `input`, in the order it reads\n * them: the walk under `input.root` with its `.gitignore` rules and\n * `input.globs` applied and symbolic links left out, or the root itself when\n * it names one file. A peer that has to bring a tree's bytes to this process\n * before it can search them (`RemoteSearch`) fetches exactly these.\n *\n * @category queries\n * @since 1.0.0-rc.8\n */\nexport const searched = (\n  input: Pick<Search.GrepInput, \"root\" | \"hidden\" | \"noIgnore\" | \"globs\">\n): Effect.Effect<ReadonlyArray<string>, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore)\n    return yield* candidates(fileSystem, path, walked, input.root, input.globs)\n  })\n\n/**\n * Captures filesystem and path services in the portable peer.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const make = (services: Context.Context<FileSystem.FileSystem | Path.Path>): Search.Search =>\n  Search.make({\n    grep: (input) => Effect.provide(grep(input), services),\n    glob: (input) => Effect.provide(glob(input), services)\n  })\n\n/**\n * Provides the in-process peer.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layer: Layer.Layer<Search.Search, never, FileSystem.FileSystem | Path.Path> = Layer.effect(\n  Search.Search,\n  Effect.map(Effect.context<FileSystem.FileSystem | Path.Path>(), make)\n)\n"]}

package/dist/esm/RemoteSearch.d.ts

@@ -0,0 +1,54 @@
+/**
+ * The search contract for a tree on another machine, in two round trips.
+ *
+ * `PortableSearch` asks `FileSystem` one question per directory, per entry
+ * and per file. On a machine reached through a transport, such as a
+ * benchmark's task container behind `docker exec`, every question is a
+ * process start, so one `grep` over a 6,000-file repository is some 20,000 of
+ * them. This peer asks the machine's own shell twice instead. `find` lists
+ * the tree under the root, leaving out the directories every walk skips, and
+ * `tar` returns its `.gitignore` files with the listing. The in-process peer
+ * then decides which files the search reads, a second `tar` returns exactly
+ * those, and `PortableSearch` answers over that copy. Every result, notice,
+ * and refusal is therefore the in-process peer's own: this module decides
+ * only where the bytes come from.
+ *
+ * It runs through the machine's own `ChildProcessSpawner`, the one
+ * `Sandbox.hostContext` serves beside the machine's `FileSystem`. The machine
+ * needs `sh`, `find`, `xargs`, `tar`, `head`, and `base64`; GNU, BusyBox, and
+ * BSD userlands all have them. Output crosses as base64, so a transport whose
+ * channel carries only text returns it intact. A search reads at most
+ * {@link maxBytes} of file content and refuses beyond that, naming the root
+ * to narrow.
+ *
+ * @since 1.0.0-rc.8
+ */
+import type * as ChildProcessSpawner from "@smthrs/kernel/ChildProcessSpawner";
+import * as Path from "@smthrs/kernel/Path";
+import { Context } from "effect";
+import * as Search from "./Search.ts";
+/**
+ * The most file content one search brings back from the machine.
+ *
+ * The copy is held in memory while the in-process peer reads it, so the
+ * bound is on this process's memory rather than on the search: a root that
+ * holds more is refused with `response_too_large` and a narrower root or
+ * globs answer it.
+ *
+ * @category constants
+ * @since 1.0.0-rc.8
+ */
+export declare const maxBytes: number;
+/**
+ * Builds the peer over a machine's spawner and its `Path`, which resolves a
+ * relative root where the machine's file operations do. `maxBytes` lowers
+ * the bound on the file content one search brings back; the default is
+ * {@link maxBytes}.
+ *
+ * @category constructors
+ * @since 1.0.0-rc.8
+ */
+export declare const make: (services: Context.Context<ChildProcessSpawner.ChildProcessSpawner | Path.Path>, options?: {
+    readonly maxBytes?: number | undefined;
+}) => Search.Search;
+//# sourceMappingURL=RemoteSearch.d.ts.map

package/dist/esm/RemoteSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RemoteSearch.d.ts","sourceRoot":"","sources":["../../src/RemoteSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,KAAK,mBAAmB,MAAM,oCAAoC,CAAA;AAC9E,OAAO,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,OAAO,EAAU,MAAM,QAAQ,CAAA;AASxC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAGrC;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,QAAoB,CAAA;AA+FzC;;;;;;;;GAQG;AACH,eAAO,MAAM,IAAI,GACf,UAAU,OAAO,CAAC,OAAO,CAAC,mBAAmB,CAAC,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,EAC9E,UAAU;IAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,KACnD,MAAM,CAAC,MAwCT,CAAA"}

package/dist/esm/RemoteSearch.js

@@ -0,0 +1,162 @@
+/**
+ * The search contract for a tree on another machine, in two round trips.
+ *
+ * `PortableSearch` asks `FileSystem` one question per directory, per entry
+ * and per file. On a machine reached through a transport, such as a
+ * benchmark's task container behind `docker exec`, every question is a
+ * process start, so one `grep` over a 6,000-file repository is some 20,000 of
+ * them. This peer asks the machine's own shell twice instead. `find` lists
+ * the tree under the root, leaving out the directories every walk skips, and
+ * `tar` returns its `.gitignore` files with the listing. The in-process peer
+ * then decides which files the search reads, a second `tar` returns exactly
+ * those, and `PortableSearch` answers over that copy. Every result, notice,
+ * and refusal is therefore the in-process peer's own: this module decides
+ * only where the bytes come from.
+ *
+ * It runs through the machine's own `ChildProcessSpawner`, the one
+ * `Sandbox.hostContext` serves beside the machine's `FileSystem`. The machine
+ * needs `sh`, `find`, `xargs`, `tar`, `head`, and `base64`; GNU, BusyBox, and
+ * BSD userlands all have them. Output crosses as base64, so a transport whose
+ * channel carries only text returns it intact. A search reads at most
+ * {@link maxBytes} of file content and refuses beyond that, naming the root
+ * to narrow.
+ *
+ * @since 1.0.0-rc.8
+ */
+import * as Path from "@smthrs/kernel/Path";
+import { Context, Effect } from "effect";
+import * as Base64 from "effect/encoding/Base64";
+import * as FileSystem from "effect/FileSystem";
+import * as Result from "effect/Result";
+import * as Exec from "./internal/Exec.js";
+import * as Prune from "./internal/Prune.js";
+import * as RemoteTree from "./internal/RemoteTree.js";
+import * as Tar from "./internal/Tar.js";
+import * as PortableSearch from "./PortableSearch.js";
+import * as Search from "./Search.js";
+import * as StdError from "./StdError.js";
+/**
+ * The most file content one search brings back from the machine.
+ *
+ * The copy is held in memory while the in-process peer reads it, so the
+ * bound is on this process's memory rather than on the search: a root that
+ * holds more is refused with `response_too_large` and a narrower root or
+ * globs answer it.
+ *
+ * @category constants
+ * @since 1.0.0-rc.8
+ */
+export const maxBytes = 256 * 1024 * 1024;
+/** The most a listing, with its `.gitignore` files, may take. */
+const maxListingBytes = 64 * 1024 * 1024;
+const quoted = (value) => `'${value.replaceAll("'", `'\\''`)}'`;
+const pruned = `\\( ${Prune.repositoryDirectories.map((name) => `-name ${quoted(name)}`).join(" -o ")} \\) -prune`;
+/** The refusal for a machine without one of the tools a search runs. */
+const missing = (tool) => `searching this machine needs ${tool}, which it does not have`;
+const requireTools = `for t in find xargs tar head; do command -v "$t" >/dev/null || { ` +
+    `echo "${missing("$t")}" >&2; exit 3; }; done`;
+/**
+ * `$1` is the root, `$2` the byte bound, and `$3` is `1` to send the
+ * `.gitignore` files after the listing. Records are NUL-terminated `<kind><path>`;
+ * an `E` record ends the listing, and a tar stream of the ignore files follows.
+ */
+const listing = [
+    "set -f",
+    requireTools,
+    "r=$1",
+    "{",
+    "  if [ -d \"$r\" ]; then if [ -r \"$r\" ] && [ -x \"$r\" ]; then printf 'd%s\\0' \"$r\"; else printf 'u%s\\0' \"$r\"; fi",
+    "  elif [ -f \"$r\" ]; then printf 'f%s\\0' \"$r\"",
+    "  elif [ -e \"$r\" ]; then printf 'o%s\\0' \"$r\"",
+    "  fi",
+    // No `-exec … {} +` inside parentheses: BusyBox `find` never runs one there.
+    `  find -H "$r" -mindepth 1 ${pruned} -o -type d -exec printf 'd%s\\0' {} + ` +
+        `-o -type f -exec printf 'f%s\\0' {} + ` +
+        `-o -type l -exec sh -c 'for p do if [ -d "$p" ]; then k=D; elif [ -f "$p" ]; then k=F; else k=L; fi; ` +
+        `printf "%s%s\\0" "$k" "$p"; done' sh {} + -o -exec printf 'o%s\\0' {} + 2>/dev/null`,
+    "  printf 'E\\0'",
+    `  if [ "$3" = 1 ]; then find -H "$r" -mindepth 1 ${pruned} -o -type f -name .gitignore -print0 2>/dev/null | ` +
+        "(cd / && COPYFILE_DISABLE=1 xargs -0 -r tar -cf - -- 2>/dev/null); fi",
+    "} | head -c \"$2\" | base64"
+].join("\n");
+/** `$1` is the byte bound; standard input is the NUL-terminated absolute paths to send. */
+const fetching = [
+    requireTools,
+    "cd / && COPYFILE_DISABLE=1 xargs -0 -r tar -chf - -- 2>/dev/null | head -c \"$1\" | base64"
+].join("\n");
+const failed = (root, reason) => new StdError.StdError({
+    code: "command_failed",
+    message: `Could not search ${root} on this machine: ${reason}`,
+    path: root
+});
+const tooLarge = (root, bound) => new StdError.StdError({
+    code: "response_too_large",
+    message: `The files under ${root} come to more than ${bound} bytes; narrow the root or the globs`,
+    path: root
+});
+/**
+ * Reads the program from the first line of standard input, as base64, and
+ * runs it with the arguments and the rest of standard input. A program in
+ * the argv would be quoted once by the spawner and again by the transport,
+ * and a sealed host refuses to start a command line past 4,096 characters;
+ * this line stays short whatever the program says.
+ */
+const bootstrap = `command -v base64 >/dev/null || { echo "${missing("base64")}" >&2; exit 3; }; ` +
+    "IFS= read -r p && p=$(printf %s \"$p\" | base64 -d) && exec sh -c \"$p\" sh \"$@\"";
+/**
+ * Runs one script on the machine and decodes the base64 it prints, refusing
+ * output that reached `bound`: `head` cut it, so it is not the whole answer.
+ */
+const run = (root, script, args, bound, stdin = "") => Effect.gen(function* () {
+    const result = yield* Exec.exec("sh", {
+        args: ["-c", bootstrap, "sh", ...args],
+        stdin: `${Base64.encode(new TextEncoder().encode(script))}\n${stdin}`
+    }).pipe(Effect.mapError((error) => failed(root, error.message)));
+    if (result.exitCode !== 0) {
+        return yield* Effect.fail(failed(root, result.stderr.trim() || `exit ${result.exitCode}`));
+    }
+    const decoded = Base64.decode(result.stdout.replaceAll(/\s/g, ""));
+    if (Result.isFailure(decoded))
+        return yield* Effect.fail(failed(root, "the machine answered with invalid base64"));
+    if (decoded.success.length >= bound)
+        return yield* Effect.fail(tooLarge(root, bound - 1));
+    return decoded.success;
+});
+/**
+ * Builds the peer over a machine's spawner and its `Path`, which resolves a
+ * relative root where the machine's file operations do. `maxBytes` lowers
+ * the bound on the file content one search brings back; the default is
+ * {@link maxBytes}.
+ *
+ * @category constructors
+ * @since 1.0.0-rc.8
+ */
+export const make = (services, options) => {
+    const path = Context.get(services, Path.Path);
+    const contentBound = (options?.maxBytes ?? maxBytes) + 1;
+    const copy = (tree) => Context.make(FileSystem.FileSystem, RemoteTree.fileSystem(tree, path)).pipe(Context.add(Path.Path, path));
+    const listed = (root, noIgnore) => {
+        const resolved = path.resolve(root);
+        const bound = maxListingBytes + 1;
+        return Effect.flatMap(run(root, listing, [resolved, String(bound), noIgnore === true ? "0" : "1"], bound), (bytes) => {
+            const tree = RemoteTree.parse(bytes, resolved, path);
+            return tree === undefined ? Effect.fail(failed(root, "the listing came back malformed")) : Effect.succeed(tree);
+        });
+    };
+    return Search.make({
+        grep: (input) => Effect.gen(function* () {
+            const tree = yield* listed(input.root, input.noIgnore);
+            const read = yield* PortableSearch.searched(input).pipe(Effect.provide(copy(tree)));
+            const files = [...new Set(read.map((file) => path.resolve(file)))];
+            const bytes = files.length === 0 ? new Uint8Array() : yield* run(input.root, fetching, [String(contentBound)], contentBound, files.map((file) => `${file}\0`).join(""));
+            // `tar` ends every archive it writes, even one whose files it could not read.
+            const members = files.length === 0 || bytes.length > 0 ? Tar.files(bytes) : undefined;
+            if (members === undefined)
+                return yield* Effect.fail(failed(input.root, "the files came back malformed"));
+            const contents = new Map([...tree.contents, ...RemoteTree.absolute(members)]);
+            return yield* PortableSearch.make(copy({ ...tree, contents })).grep(input);
+        }).pipe(Effect.provide(services)),
+        glob: (input) => Effect.flatMap(listed(input.root, input.noIgnore), (tree) => PortableSearch.make(copy(tree)).glob(input)).pipe(Effect.provide(services))
+    });
+};
+//# sourceMappingURL=RemoteSearch.js.map

package/dist/esm/RemoteSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RemoteSearch.js","sourceRoot":"","sources":["../../src/RemoteSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AACxC,OAAO,KAAK,MAAM,MAAM,wBAAwB,CAAA;AAChD,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAC/C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,IAAI,MAAM,oBAAoB,CAAA;AAC1C,OAAO,KAAK,KAAK,MAAM,qBAAqB,CAAA;AAC5C,OAAO,KAAK,UAAU,MAAM,0BAA0B,CAAA;AACtD,OAAO,KAAK,GAAG,MAAM,mBAAmB,CAAA;AACxC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,CAAA;AAEzC,iEAAiE;AACjE,MAAM,eAAe,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAA;AAExC,MAAM,MAAM,GAAG,CAAC,KAAa,EAAU,EAAE,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,CAAA;AAE/E,MAAM,MAAM,GAAG,OAAO,KAAK,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAA;AAElH,wEAAwE;AACxE,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,gCAAgC,IAAI,0BAA0B,CAAA;AAEhG,MAAM,YAAY,GAAG,mEAAmE;IACtF,SAAS,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAA;AAEhD;;;;GAIG;AACH,MAAM,OAAO,GAAG;IACd,QAAQ;IACR,YAAY;IACZ,MAAM;IACN,GAAG;IACH,0HAA0H;IAC1H,mDAAmD;IACnD,mDAAmD;IACnD,MAAM;IACN,6EAA6E;IAC7E,8BAA8B,MAAM,yCAAyC;QAC7E,wCAAwC;QACxC,uGAAuG;QACvG,qFAAqF;IACrF,iBAAiB;IACjB,oDAAoD,MAAM,qDAAqD;QAC/G,uEAAuE;IACvE,6BAA6B;CAC9B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAEZ,2FAA2F;AAC3F,MAAM,QAAQ,GAAG;IACf,YAAY;IACZ,4FAA4F;CAC7F,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAEZ,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,MAAc,EAAqB,EAAE,CACjE,IAAI,QAAQ,CAAC,QAAQ,CAAC;IACpB,IAAI,EAAE,gBAAgB;IACtB,OAAO,EAAE,oBAAoB,IAAI,qBAAqB,MAAM,EAAE;IAC9D,IAAI,EAAE,IAAI;CACX,CAAC,CAAA;AAEJ,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,KAAa,EAAqB,EAAE,CAClE,IAAI,QAAQ,CAAC,QAAQ,CAAC;IACpB,IAAI,EAAE,oBAAoB;IAC1B,OAAO,EAAE,mBAAmB,IAAI,sBAAsB,KAAK,sCAAsC;IACjG,IAAI,EAAE,IAAI;CACX,CAAC,CAAA;AAEJ;;;;;;GAMG;AACH,MAAM,SAAS,GAAG,2CAA2C,OAAO,CAAC,QAAQ,CAAC,oBAAoB;IAChG,oFAAoF,CAAA;AAEtF;;;GAGG;AACH,MAAM,GAAG,GAAG,CACV,IAAY,EACZ,MAAc,EACd,IAA2B,EAC3B,KAAa,EACb,KAAK,GAAG,EAAE,EAC6E,EAAE,CACzF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QACpC,IAAI,EAAE,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtC,KAAK,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,EAAE;KACtE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IAChE,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;IAC5F,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAA;IAClE,IAAI,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,0CAA0C,CAAC,CAAC,CAAA;IAClH,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAA;IACzF,OAAO,OAAO,CAAC,OAAO,CAAA;AACxB,CAAC,CAAC,CAAA;AAEJ;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAClB,QAA8E,EAC9E,OAAoD,EACrC,EAAE;IACjB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7C,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAA;IACxD,MAAM,IAAI,GAAG,CAAC,IAAqB,EAAE,EAAE,CACrC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;IAC3G,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,QAA6B,EAAE,EAAE;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACnC,MAAM,KAAK,GAAG,eAAe,GAAG,CAAC,CAAA;QACjC,OAAO,MAAM,CAAC,OAAO,CACnB,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,EACnF,CAAC,KAAK,EAAE,EAAE;YACR,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YACpD,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACjH,CAAC,CACF,CAAA;IACH,CAAC,CAAA;IACD,OAAO,MAAM,CAAC,IAAI,CAAC;QACjB,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CACd,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAA;YACtD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACnF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YAClE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAC9D,KAAK,CAAC,IAAI,EACV,QAAQ,EACR,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,EACtB,YAAY,EACZ,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAC1C,CAAA;YACD,8EAA8E;YAC9E,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;YACrF,IAAI,OAAO,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,+BAA+B,CAAC,CAAC,CAAA;YACzG,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YAC7E,OAAO,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC5E,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CACd,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAC5G,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CACzB;KACJ,CAAC,CAAA;AACJ,CAAC,CAAA","sourcesContent":["/**\n * The search contract for a tree on another machine, in two round trips.\n *\n * `PortableSearch` asks `FileSystem` one question per directory, per entry\n * and per file. On a machine reached through a transport, such as a\n * benchmark's task container behind `docker exec`, every question is a\n * process start, so one `grep` over a 6,000-file repository is some 20,000 of\n * them. This peer asks the machine's own shell twice instead. `find` lists\n * the tree under the root, leaving out the directories every walk skips, and\n * `tar` returns its `.gitignore` files with the listing. The in-process peer\n * then decides which files the search reads, a second `tar` returns exactly\n * those, and `PortableSearch` answers over that copy. Every result, notice,\n * and refusal is therefore the in-process peer's own: this module decides\n * only where the bytes come from.\n *\n * It runs through the machine's own `ChildProcessSpawner`, the one\n * `Sandbox.hostContext` serves beside the machine's `FileSystem`. The machine\n * needs `sh`, `find`, `xargs`, `tar`, `head`, and `base64`; GNU, BusyBox, and\n * BSD userlands all have them. Output crosses as base64, so a transport whose\n * channel carries only text returns it intact. A search reads at most\n * {@link maxBytes} of file content and refuses beyond that, naming the root\n * to narrow.\n *\n * @since 1.0.0-rc.8\n */\n\nimport type * as ChildProcessSpawner from \"@smthrs/kernel/ChildProcessSpawner\"\nimport * as Path from \"@smthrs/kernel/Path\"\nimport { Context, Effect } from \"effect\"\nimport * as Base64 from \"effect/encoding/Base64\"\nimport * as FileSystem from \"effect/FileSystem\"\nimport * as Result from \"effect/Result\"\nimport * as Exec from \"./internal/Exec.ts\"\nimport * as Prune from \"./internal/Prune.ts\"\nimport * as RemoteTree from \"./internal/RemoteTree.ts\"\nimport * as Tar from \"./internal/Tar.ts\"\nimport * as PortableSearch from \"./PortableSearch.ts\"\nimport * as Search from \"./Search.ts\"\nimport * as StdError from \"./StdError.ts\"\n\n/**\n * The most file content one search brings back from the machine.\n *\n * The copy is held in memory while the in-process peer reads it, so the\n * bound is on this process's memory rather than on the search: a root that\n * holds more is refused with `response_too_large` and a narrower root or\n * globs answer it.\n *\n * @category constants\n * @since 1.0.0-rc.8\n */\nexport const maxBytes = 256 * 1024 * 1024\n\n/** The most a listing, with its `.gitignore` files, may take. */\nconst maxListingBytes = 64 * 1024 * 1024\n\nconst quoted = (value: string): string => `'${value.replaceAll(\"'\", `'\\\\''`)}'`\n\nconst pruned = `\\\\( ${Prune.repositoryDirectories.map((name) => `-name ${quoted(name)}`).join(\" -o \")} \\\\) -prune`\n\n/** The refusal for a machine without one of the tools a search runs. */\nconst missing = (tool: string) => `searching this machine needs ${tool}, which it does not have`\n\nconst requireTools = `for t in find xargs tar head; do command -v \"$t\" >/dev/null || { ` +\n  `echo \"${missing(\"$t\")}\" >&2; exit 3; }; done`\n\n/**\n * `$1` is the root, `$2` the byte bound, and `$3` is `1` to send the\n * `.gitignore` files after the listing. Records are NUL-terminated `<kind><path>`;\n * an `E` record ends the listing, and a tar stream of the ignore files follows.\n */\nconst listing = [\n  \"set -f\",\n  requireTools,\n  \"r=$1\",\n  \"{\",\n  \"  if [ -d \\\"$r\\\" ]; then if [ -r \\\"$r\\\" ] && [ -x \\\"$r\\\" ]; then printf 'd%s\\\\0' \\\"$r\\\"; else printf 'u%s\\\\0' \\\"$r\\\"; fi\",\n  \"  elif [ -f \\\"$r\\\" ]; then printf 'f%s\\\\0' \\\"$r\\\"\",\n  \"  elif [ -e \\\"$r\\\" ]; then printf 'o%s\\\\0' \\\"$r\\\"\",\n  \"  fi\",\n  // No `-exec … {} +` inside parentheses: BusyBox `find` never runs one there.\n  `  find -H \"$r\" -mindepth 1 ${pruned} -o -type d -exec printf 'd%s\\\\0' {} + ` +\n  `-o -type f -exec printf 'f%s\\\\0' {} + ` +\n  `-o -type l -exec sh -c 'for p do if [ -d \"$p\" ]; then k=D; elif [ -f \"$p\" ]; then k=F; else k=L; fi; ` +\n  `printf \"%s%s\\\\0\" \"$k\" \"$p\"; done' sh {} + -o -exec printf 'o%s\\\\0' {} + 2>/dev/null`,\n  \"  printf 'E\\\\0'\",\n  `  if [ \"$3\" = 1 ]; then find -H \"$r\" -mindepth 1 ${pruned} -o -type f -name .gitignore -print0 2>/dev/null | ` +\n  \"(cd / && COPYFILE_DISABLE=1 xargs -0 -r tar -cf - -- 2>/dev/null); fi\",\n  \"} | head -c \\\"$2\\\" | base64\"\n].join(\"\\n\")\n\n/** `$1` is the byte bound; standard input is the NUL-terminated absolute paths to send. */\nconst fetching = [\n  requireTools,\n  \"cd / && COPYFILE_DISABLE=1 xargs -0 -r tar -chf - -- 2>/dev/null | head -c \\\"$1\\\" | base64\"\n].join(\"\\n\")\n\nconst failed = (root: string, reason: string): StdError.StdError =>\n  new StdError.StdError({\n    code: \"command_failed\",\n    message: `Could not search ${root} on this machine: ${reason}`,\n    path: root\n  })\n\nconst tooLarge = (root: string, bound: number): StdError.StdError =>\n  new StdError.StdError({\n    code: \"response_too_large\",\n    message: `The files under ${root} come to more than ${bound} bytes; narrow the root or the globs`,\n    path: root\n  })\n\n/**\n * Reads the program from the first line of standard input, as base64, and\n * runs it with the arguments and the rest of standard input. A program in\n * the argv would be quoted once by the spawner and again by the transport,\n * and a sealed host refuses to start a command line past 4,096 characters;\n * this line stays short whatever the program says.\n */\nconst bootstrap = `command -v base64 >/dev/null || { echo \"${missing(\"base64\")}\" >&2; exit 3; }; ` +\n  \"IFS= read -r p && p=$(printf %s \\\"$p\\\" | base64 -d) && exec sh -c \\\"$p\\\" sh \\\"$@\\\"\"\n\n/**\n * Runs one script on the machine and decodes the base64 it prints, refusing\n * output that reached `bound`: `head` cut it, so it is not the whole answer.\n */\nconst run = (\n  root: string,\n  script: string,\n  args: ReadonlyArray<string>,\n  bound: number,\n  stdin = \"\"\n): Effect.Effect<Uint8Array, StdError.StdError, ChildProcessSpawner.ChildProcessSpawner> =>\n  Effect.gen(function*() {\n    const result = yield* Exec.exec(\"sh\", {\n      args: [\"-c\", bootstrap, \"sh\", ...args],\n      stdin: `${Base64.encode(new TextEncoder().encode(script))}\\n${stdin}`\n    }).pipe(Effect.mapError((error) => failed(root, error.message)))\n    if (result.exitCode !== 0) {\n      return yield* Effect.fail(failed(root, result.stderr.trim() || `exit ${result.exitCode}`))\n    }\n    const decoded = Base64.decode(result.stdout.replaceAll(/\\s/g, \"\"))\n    if (Result.isFailure(decoded)) return yield* Effect.fail(failed(root, \"the machine answered with invalid base64\"))\n    if (decoded.success.length >= bound) return yield* Effect.fail(tooLarge(root, bound - 1))\n    return decoded.success\n  })\n\n/**\n * Builds the peer over a machine's spawner and its `Path`, which resolves a\n * relative root where the machine's file operations do. `maxBytes` lowers\n * the bound on the file content one search brings back; the default is\n * {@link maxBytes}.\n *\n * @category constructors\n * @since 1.0.0-rc.8\n */\nexport const make = (\n  services: Context.Context<ChildProcessSpawner.ChildProcessSpawner | Path.Path>,\n  options?: { readonly maxBytes?: number | undefined }\n): Search.Search => {\n  const path = Context.get(services, Path.Path)\n  const contentBound = (options?.maxBytes ?? maxBytes) + 1\n  const copy = (tree: RemoteTree.Tree) =>\n    Context.make(FileSystem.FileSystem, RemoteTree.fileSystem(tree, path)).pipe(Context.add(Path.Path, path))\n  const listed = (root: string, noIgnore: boolean | undefined) => {\n    const resolved = path.resolve(root)\n    const bound = maxListingBytes + 1\n    return Effect.flatMap(\n      run(root, listing, [resolved, String(bound), noIgnore === true ? \"0\" : \"1\"], bound),\n      (bytes) => {\n        const tree = RemoteTree.parse(bytes, resolved, path)\n        return tree === undefined ? Effect.fail(failed(root, \"the listing came back malformed\")) : Effect.succeed(tree)\n      }\n    )\n  }\n  return Search.make({\n    grep: (input) =>\n      Effect.gen(function*() {\n        const tree = yield* listed(input.root, input.noIgnore)\n        const read = yield* PortableSearch.searched(input).pipe(Effect.provide(copy(tree)))\n        const files = [...new Set(read.map((file) => path.resolve(file)))]\n        const bytes = files.length === 0 ? new Uint8Array() : yield* run(\n          input.root,\n          fetching,\n          [String(contentBound)],\n          contentBound,\n          files.map((file) => `${file}\\0`).join(\"\")\n        )\n        // `tar` ends every archive it writes, even one whose files it could not read.\n        const members = files.length === 0 || bytes.length > 0 ? Tar.files(bytes) : undefined\n        if (members === undefined) return yield* Effect.fail(failed(input.root, \"the files came back malformed\"))\n        const contents = new Map([...tree.contents, ...RemoteTree.absolute(members)])\n        return yield* PortableSearch.make(copy({ ...tree, contents })).grep(input)\n      }).pipe(Effect.provide(services)),\n    glob: (input) =>\n      Effect.flatMap(listed(input.root, input.noIgnore), (tree) => PortableSearch.make(copy(tree)).glob(input)).pipe(\n        Effect.provide(services)\n      )\n  })\n}\n"]}

package/dist/esm/index.d.ts

@@ -44,6 +44,8 @@ export * as SearchConformance from "./SearchConformance.ts";
 export * as PortableSearch from "./PortableSearch.ts";
 /** @category layers @since 1.0.0 */
 export * as NativeSearch from "./NativeSearch.ts";
+/** @category layers @since 1.0.0-rc.8 */
+export * as RemoteSearch from "./RemoteSearch.ts";
 /**
  * @category flows
  * @since 1.0.0

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAA;AAE7B;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,yCAAyC;AACzC,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAA;AAE3D,oCAAoC;AACpC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,oCAAoC;AACpC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;GAGG;AACH,OAAO,KAAK,eAAe,MAAM,sBAAsB,CAAA;AAEvD,sCAAsC;AACtC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C,yCAAyC;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,sCAAsC;AACtC,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,mCAAmC;AACnC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,mCAAmC;AACnC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAC3C,sCAAsC;AACtC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AACjD,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,oCAAoC;AACpC,OAAO,KAAK,kBAAkB,MAAM,yBAAyB,CAAA;AAC7D,mCAAmC;AACnC,OAAO,KAAK,GAAG,MAAM,UAAU,CAAA;AAE/B;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAA;AAE7B;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,yCAAyC;AACzC,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAA;AAE3D,oCAAoC;AACpC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,oCAAoC;AACpC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD,yCAAyC;AACzC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;GAGG;AACH,OAAO,KAAK,eAAe,MAAM,sBAAsB,CAAA;AAEvD,sCAAsC;AACtC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C,yCAAyC;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,sCAAsC;AACtC,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,mCAAmC;AACnC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,mCAAmC;AACnC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAC3C,sCAAsC;AACtC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AACjD,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,oCAAoC;AACpC,OAAO,KAAK,kBAAkB,MAAM,yBAAyB,CAAA;AAC7D,mCAAmC;AACnC,OAAO,KAAK,GAAG,MAAM,UAAU,CAAA;AAE/B;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA"}

package/dist/esm/index.js

@@ -44,6 +44,8 @@ export * as SearchConformance from "./SearchConformance.js";
 export * as PortableSearch from "./PortableSearch.js";
 /** @category layers @since 1.0.0 */
 export * as NativeSearch from "./NativeSearch.js";
+/** @category layers @since 1.0.0-rc.8 */
+export * as RemoteSearch from "./RemoteSearch.js";
 /**
  * @category flows
  * @since 1.0.0

package/dist/esm/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAA;AAE7B;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,yCAAyC;AACzC,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAA;AAE3D,oCAAoC;AACpC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,oCAAoC;AACpC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;GAGG;AACH,OAAO,KAAK,eAAe,MAAM,sBAAsB,CAAA;AAEvD,sCAAsC;AACtC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C,yCAAyC;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,sCAAsC;AACtC,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,mCAAmC;AACnC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,mCAAmC;AACnC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAC3C,sCAAsC;AACtC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AACjD,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,oCAAoC;AACpC,OAAO,KAAK,kBAAkB,MAAM,yBAAyB,CAAA;AAC7D,mCAAmC;AACnC,OAAO,KAAK,GAAG,MAAM,UAAU,CAAA;AAE/B;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA","sourcesContent":["/**\n * `@smthrs/std`: the standard coding tools expressed as flows, the host\n * services they bind, and the one error they share.\n *\n * @since 1.0.0\n */\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Read from \"./Read.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Write from \"./Write.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Edit from \"./Edit.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Ls from \"./Ls.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Glob from \"./Glob.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Grep from \"./Grep.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as Search from \"./Search.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as SearchContract from \"./SearchContract.ts\"\n\n/** @category conformance @since 1.0.0 */\nexport * as SearchConformance from \"./SearchConformance.ts\"\n\n/** @category layers @since 1.0.0 */\nexport * as PortableSearch from \"./PortableSearch.ts\"\n\n/** @category layers @since 1.0.0 */\nexport * as NativeSearch from \"./NativeSearch.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Bash from \"./Bash.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as Container from \"./Container.ts\"\n\n/**\n * @category measurement\n * @since 1.0.0\n */\nexport * as TreeFingerprint from \"./TreeFingerprint.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as Checkpoints from \"./Checkpoints.ts\"\n\n/** @category conversions @since 1.0.0 */\nexport * as Relocate from \"./Relocate.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as TestRun from \"./TestRun.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as TestRunner from \"./TestRunner.ts\"\n\n/**\n * @category classification\n * @since 1.0.0\n */\nexport * as Probe from \"./Probe.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as ApplyPatch from \"./ApplyPatch.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as ShellCommand from \"./ShellCommand.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as UpdatePlan from \"./UpdatePlan.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Fetch from \"./Fetch.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as HttpPost from \"./HttpPost.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Explore from \"./Explore.ts\"\n\n/** @category flows @since 1.0.0 */\nexport * as WebFetch from \"./WebFetch.ts\"\n/** @category flows @since 1.0.0 */\nexport * as WebSearch from \"./WebSearch.ts\"\n/** @category services @since 1.0.0 */\nexport * as ExaWebSearch from \"./ExaWebSearch.ts\"\n/** @category services @since 1.0.0 */\nexport * as LanguageServer from \"./LanguageServer.ts\"\n/** @category layers @since 1.0.0 */\nexport * as NodeLanguageServer from \"./NodeLanguageServer.ts\"\n/** @category flows @since 1.0.0 */\nexport * as Lsp from \"./Lsp.ts\"\n\n/**\n * @category registries\n * @since 1.0.0\n */\nexport * as Manifest from \"./Manifest.ts\"\n\n/**\n * @category errors\n * @since 1.0.0\n */\nexport * as StdError from \"./StdError.ts\"\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAA;AAE7B;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,yCAAyC;AACzC,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAA;AAE3D,oCAAoC;AACpC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AAErD,oCAAoC;AACpC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD,yCAAyC;AACzC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC,sCAAsC;AACtC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;GAGG;AACH,OAAO,KAAK,eAAe,MAAM,sBAAsB,CAAA;AAEvD,sCAAsC;AACtC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C,yCAAyC;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,sCAAsC;AACtC,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AAEjD;;;GAGG;AACH,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAE7C;;;GAGG;AACH,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC,mCAAmC;AACnC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,mCAAmC;AACnC,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAC3C,sCAAsC;AACtC,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAA;AACjD,sCAAsC;AACtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,oCAAoC;AACpC,OAAO,KAAK,kBAAkB,MAAM,yBAAyB,CAAA;AAC7D,mCAAmC;AACnC,OAAO,KAAK,GAAG,MAAM,UAAU,CAAA;AAE/B;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;GAGG;AACH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA","sourcesContent":["/**\n * `@smthrs/std`: the standard coding tools expressed as flows, the host\n * services they bind, and the one error they share.\n *\n * @since 1.0.0\n */\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Read from \"./Read.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Write from \"./Write.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Edit from \"./Edit.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Ls from \"./Ls.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Glob from \"./Glob.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Grep from \"./Grep.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as Search from \"./Search.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as SearchContract from \"./SearchContract.ts\"\n\n/** @category conformance @since 1.0.0 */\nexport * as SearchConformance from \"./SearchConformance.ts\"\n\n/** @category layers @since 1.0.0 */\nexport * as PortableSearch from \"./PortableSearch.ts\"\n\n/** @category layers @since 1.0.0 */\nexport * as NativeSearch from \"./NativeSearch.ts\"\n\n/** @category layers @since 1.0.0-rc.8 */\nexport * as RemoteSearch from \"./RemoteSearch.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Bash from \"./Bash.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as Container from \"./Container.ts\"\n\n/**\n * @category measurement\n * @since 1.0.0\n */\nexport * as TreeFingerprint from \"./TreeFingerprint.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as Checkpoints from \"./Checkpoints.ts\"\n\n/** @category conversions @since 1.0.0 */\nexport * as Relocate from \"./Relocate.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as TestRun from \"./TestRun.ts\"\n\n/** @category services @since 1.0.0 */\nexport * as TestRunner from \"./TestRunner.ts\"\n\n/**\n * @category classification\n * @since 1.0.0\n */\nexport * as Probe from \"./Probe.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as ApplyPatch from \"./ApplyPatch.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as ShellCommand from \"./ShellCommand.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as UpdatePlan from \"./UpdatePlan.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Fetch from \"./Fetch.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as HttpPost from \"./HttpPost.ts\"\n\n/**\n * @category flows\n * @since 1.0.0\n */\nexport * as Explore from \"./Explore.ts\"\n\n/** @category flows @since 1.0.0 */\nexport * as WebFetch from \"./WebFetch.ts\"\n/** @category flows @since 1.0.0 */\nexport * as WebSearch from \"./WebSearch.ts\"\n/** @category services @since 1.0.0 */\nexport * as ExaWebSearch from \"./ExaWebSearch.ts\"\n/** @category services @since 1.0.0 */\nexport * as LanguageServer from \"./LanguageServer.ts\"\n/** @category layers @since 1.0.0 */\nexport * as NodeLanguageServer from \"./NodeLanguageServer.ts\"\n/** @category flows @since 1.0.0 */\nexport * as Lsp from \"./Lsp.ts\"\n\n/**\n * @category registries\n * @since 1.0.0\n */\nexport * as Manifest from \"./Manifest.ts\"\n\n/**\n * @category errors\n * @since 1.0.0\n */\nexport * as StdError from \"./StdError.ts\"\n"]}

package/dist/esm/internal/EnvelopePrecheck.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"EnvelopePrecheck.d.ts","sourceRoot":"","sources":["../../../src/internal/EnvelopePrecheck.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAChD,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAA;AAG1C;;;;;;;;;GASG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACjC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACvC;AAED;;;;;GAKG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,OAAO,CAAA;AAErC;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AAkUD;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,IAAI,CAAC,IAAI,EAAE,SAAS,MAAM,KAAG,aAAa,CAAC,aAAa,CAClE,CAAA;AAmB9B;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAO,QAAQ,EACf,MAAM,MAAM,EACZ,MAAM,IAAI,CAAC,IAAI,KACd,QAAQ,CAAC,QAAQ,GAAG,SAgDtB,CAAA"}
+{"version":3,"file":"EnvelopePrecheck.d.ts","sourceRoot":"","sources":["../../../src/internal/EnvelopePrecheck.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAChD,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAA;AAG1C;;;;;;;;;GASG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACjC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACvC;AAED;;;;;GAKG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,OAAO,CAAA;AAErC;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AA0VD;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,IAAI,CAAC,IAAI,EAAE,SAAS,MAAM,KAAG,aAAa,CAAC,aAAa,CAClE,CAAA;AAmB9B;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAO,QAAQ,EACf,MAAM,MAAM,EACZ,MAAM,IAAI,CAAC,IAAI,KACd,QAAQ,CAAC,QAAQ,GAAG,SAgDtB,CAAA"}

package/dist/esm/internal/EnvelopePrecheck.js

@@ -76,6 +76,9 @@ const reservedWords = new Set([
 const writeCommands = new Set(["chmod", "chown", "mkdir", "rm", "rmdir", "tee", "touch", "truncate", "unlink"]);
 const destinationCommands = new Set(["cp", "install", "mv"]);
 const prefixWrappers = new Set(["env", "nice", "time", "sudo", "nohup", "xargs", "command", "exec"]);
+// A shell runs the argument of its `-c` flag as shell text of its own.
+const shells = new Set(["ash", "bash", "dash", "fish", "ksh", "mksh", "sh", "zsh"]);
+const commandFlag = /^-[A-Za-z]*c[A-Za-z]*$/;
 // The end of a `$(` body that starts at `from`: the index of its closing
 // parenthesis, skipping quoted spans and nested parentheses. An unclosed body
 // runs to the end of the text, which is how a fail-closed scan must read it.
@@ -269,7 +272,7 @@ const isPathToken = (path, token) => token === "." ||
     path.isAbsolute(token) ||
     /^[A-Za-z]:[\\/]/.test(token) ||
     token.includes("/");
-const segmentReferences = (path, tokens) => {
+const segmentReferences = (path, tokens, nesting) => {
     // The word after a redirection operator is its target, never the command.
     const isTarget = (index) => index > 0 && isRedirection(tokens[index - 1]);
     const isWord = (index) => !tokens[index].operator && !isTarget(index);
@@ -289,10 +292,26 @@ const segmentReferences = (path, tokens) => {
             commandIndex = mutatingIndex;
     }
     const command = commandIndex === -1 ? "" : name(commandIndex);
+    // Shell text handed to `eval` or to a shell's `-c` flag is a command, not a
+    // path: reading `sh -c 'rm /work/target'` as one quoted word let a delete
+    // pass as a read of a file named `rm /work/target`.
+    const scripts = new Set();
+    if (command === "eval") {
+        for (let index = commandIndex + 1; index < tokens.length; index++)
+            if (isWord(index))
+                scripts.add(index);
+    }
+    else if (shells.has(command)) {
+        const flag = tokens.findIndex((token, index) => index > commandIndex && isWord(index) && commandFlag.test(token.text));
+        if (flag !== -1 && flag + 1 < tokens.length && isWord(flag + 1))
+            scripts.add(flag + 1);
+    }
     const candidates = [];
     for (let index = 0; index < tokens.length; index++) {
         const token = tokens[index];
-        if (index === commandIndex || token.operator || (!isTarget(index) && token.text.startsWith("-")))
+        if (index === commandIndex || scripts.has(index) || token.operator)
+            continue;
+        if (!isTarget(index) && token.text.startsWith("-"))
             continue;
         if (isTarget(index) && textRedirections.has(tokens[index - 1].text))
             continue;
@@ -303,7 +322,9 @@ const segmentReferences = (path, tokens) => {
     const destinationIndex = destinationCommands.has(command)
         ? candidates.filter(({ index }) => !isTarget(index)).at(-1)?.index
         : undefined;
-    return candidates.map(({ index, value }) => {
+    const script = [...scripts].map((index) => tokens[index].text).join(" ");
+    const nested = script === "" ? [] : references(path, script, nesting + 1);
+    const named = candidates.map(({ index, value }) => {
         const access = isTarget(index)
             ? writeRedirections.has(tokens[index - 1].text) ? "write" : "read"
             : writeCommands.has(command) || destinationIndex === index
@@ -311,21 +332,24 @@ const segmentReferences = (path, tokens) => {
                 : "read";
         return { access, value };
     });
+    return [...named, ...nested];
 };
 const references = (path, command, nesting) => {
+    if (nesting > maxNesting)
+        throw tooDeep();
     const { substitutions, tokens } = lex(command, nesting);
     const found = [];
     let segment = [];
     for (const token of tokens) {
         if (token.operator && commandSeparators.has(token.text)) {
-            found.push(...segmentReferences(path, segment));
+            found.push(...segmentReferences(path, segment, nesting));
             segment = [];
         }
         else {
             segment.push(token);
         }
     }
-    found.push(...segmentReferences(path, segment));
+    found.push(...segmentReferences(path, segment, nesting));
     // A substitution runs its body as a command; its paths count like any other.
     for (const body of substitutions)
         found.push(...references(path, body, nesting + 1));