@selvakumaresra/specship 0.7.0 → 0.9.0

package/dist/reflect/apply.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply.js","sourceRoot":"","sources":["../../src/reflect/apply.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBH,4BAmBC;AAyBD,0CA4CC;AAKD,sCAgCC;AAMD,oCA+BC;AAvLD,uCAAyB;AACzB,2CAA6B;AAC7B,wDAMqC;AACrC,uCAA8D;AAG9D,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,CAAC;QACH,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;IAChE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACxC,CAAC;AACH,CAAC;AAED,qEAAqE;AACrE,SAAgB,QAAQ,CAAC,MAAc,EAAE,KAAa;IACpD,IAAI,MAAM,KAAK,KAAK;QAAE,OAAO,aAAa,CAAC;IAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAChD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,kEAAkE;IAClE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,CAAC,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,CAAC;IAC9E,IAAI,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,IAAI,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7D,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;IACT,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED,iFAAiF;AACjF,SAAS,SAAS,CAAC,OAAe,EAAE,EAAU;IAC5C,MAAM,EAAE,KAAK,EAAE,GAAG,IAAA,yBAAe,EAAC,EAAE,CAAC,CAAC;IACtC,OAAO,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,0EAA0E;AAC1E,SAAS,mBAAmB,CAAC,OAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,KAAa;IACjG,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,OAAO,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IACnF,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,KAAK,GAAG,IAAI,CAAC;IAC/C,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;AAC7D,CAAC;AAED,MAAM,YAAY,GAAG,CAAC,OAAe,EAAU,EAAE,CAC/C,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;AAEvD;;GAEG;AACH,SAAgB,eAAe,CAAC,CAAW;IACzC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;IAErC,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACjC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAA,yBAAe,EAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,mBAAmB,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1E,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;IACxH,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAA,0BAAgB,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACrF,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QACpD,OAAO;YACL,UAAU;YACV,UAAU;YACV,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,MAAM,EAAE,GAAG,CAAC,OAAO;YACnB,KAAK;YACL,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,qDAAqD,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;YACrG,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;QACtE,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QACvD,OAAO;YACL,UAAU;YACV,UAAU;YACV,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,MAAM,EAAE,GAAG,CAAC,OAAO;YACnB,KAAK;YACL,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,wDAAwD,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;YACxG,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,iDAAiD;IACjD,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAA,qBAAY,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5D,MAAM,MAAM,GAAG,SAAS,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACnG,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC9C,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;AACtG,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,CAAW,EAAE,OAAe;IACxD,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IAElC,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACjC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAA,yBAAe,EAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAA,4BAAmB,EAAC,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACvE,OAAO,GAAG,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAA,0BAAgB,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,UAAU,CAAC;QAC3F,MAAM,aAAa,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,OAAO,KAAK,OAAO,CAAC,IAAI,CAAC;QACjE,IAAI,CAAC,aAAa;YAAE,IAAA,4BAAmB,EAAC,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAClE,MAAM,UAAU,GAAG,eAAe,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QAC7E,OAAO,aAAa,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC;YAAE,OAAO,UAAU,CAAC;QAC5E,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAA,yBAAe,EAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACtD,MAAM,GAAG,GAAG,IAAA,4BAAmB,EAAC,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5F,OAAO,GAAG,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED,gBAAgB;IAChB,MAAM,QAAQ,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAA,qBAAY,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACjF,MAAM,MAAM,GAAG,SAAS,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACnG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;QAAE,OAAO,WAAW,CAAC;IAC5E,IAAA,sBAAa,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAClC,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,CAAW,EAAE,OAAe;IACvD,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IAElC,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACjC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAA,yBAAe,EAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,IAAA,4BAAmB,EAAC,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;IACvF,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAA,0BAAgB,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACvE,IAAI,CAAC;gBAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBAAC,OAAO,GAAG,IAAI,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,eAAe,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC;YAAE,OAAO,GAAG,IAAI,CAAC;QAC9E,OAAO,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAA,yBAAe,EAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACtD,OAAO,IAAA,4BAAmB,EAAC,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;IACvF,CAAC;IAED,gBAAgB;IAChB,MAAM,GAAG,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;IACrC,IAAI,CAAC,GAAG,CAAC,MAAM;QAAE,OAAO,MAAM,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAA,qBAAY,EAAC,UAAU,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,UAAU,CAAC,eAAe,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACtG,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;QAAE,OAAO,MAAM,CAAC;IACzE,IAAA,sBAAa,EAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IACpC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,uEAAuE;AAEvE,SAAS,eAAe,CAAC,SAAiB,EAAE,IAAY;IACtD,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACpC,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3D,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC7C,IAAA,4BAAmB,EAAC,SAAS,EAAE,qBAAqB,IAAI,IAAI,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAA,4BAAmB,EAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;IACrF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,SAAiB,EAAE,IAAY;IACtD,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACpC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7D,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO;SACrB,KAAK,CAAC,IAAI,CAAC;SACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;SACvC,IAAI,CAAC,IAAI,CAAC;SACV,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC9B,IAAA,4BAAmB,EAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAChE,OAAO,IAAI,CAAC;AACd,CAAC;AAMD,SAAS,SAAS,CAChB,QAA6B,EAC7B,KAAa,EACb,OAAe,EACf,KAA8B;IAE9B,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC;IACtC,MAAM,MAAM,GAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAClD,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IACtD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACpF,IAAI,CAAC,MAAM;QAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,UAAU,CACjB,QAA6B,EAC7B,KAAa,EACb,OAAe,EACf,KAA8B;IAE9B,MAAM,MAAM,GAA4B,QAAQ,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;IAChE,IAAI,CAAC,MAAM;QAAE,OAAO,QAAQ,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IACxD,IAAI,CAAC,KAAK;QAAE,OAAO,QAAQ,CAAC;IAC5B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACrF,sEAAsE;IACtE,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/E,OAAO,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/D,OAAO,QAAQ,CAAC,KAAK,CAAC;IACxB,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/reflect/hash.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Stable content hashing for proposals (REQ-REFLECT-007.A1).
+ *
+ * The hash is computed over the *identity* of a proposal — its type, target,
+ * and intended payload — and deliberately EXCLUDES evidence (which session ids
+ * contributed) and timestamps, both of which vary run to run. Two reflection
+ * passes over the same underlying pattern therefore produce the same hash, so
+ * the store converges to a single row rather than duplicating.
+ */
+import { ProposalPayload, ProposalType, TargetKind } from './types';
+/**
+ * Derive the stable content hash for a proposal's identity.
+ */
+export declare function proposalHash(parts: {
+    type: ProposalType;
+    targetKind: TargetKind;
+    targetPath: string;
+    payload: ProposalPayload;
+}): string;
+//# sourceMappingURL=hash.d.ts.map

package/dist/reflect/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/reflect/hash.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAWpE;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE;IAClC,IAAI,EAAE,YAAY,CAAC;IACnB,UAAU,EAAE,UAAU,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,eAAe,CAAC;CAC1B,GAAG,MAAM,CAQT"}

package/dist/reflect/hash.js

@@ -0,0 +1,36 @@
+"use strict";
+/**
+ * Stable content hashing for proposals (REQ-REFLECT-007.A1).
+ *
+ * The hash is computed over the *identity* of a proposal — its type, target,
+ * and intended payload — and deliberately EXCLUDES evidence (which session ids
+ * contributed) and timestamps, both of which vary run to run. Two reflection
+ * passes over the same underlying pattern therefore produce the same hash, so
+ * the store converges to a single row rather than duplicating.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.proposalHash = proposalHash;
+const crypto_1 = require("crypto");
+/** Canonical JSON: object keys sorted recursively so key order can't perturb the hash. */
+function canonical(value) {
+    if (value === null || typeof value !== 'object')
+        return JSON.stringify(value);
+    if (Array.isArray(value))
+        return '[' + value.map(canonical).join(',') + ']';
+    const obj = value;
+    const keys = Object.keys(obj).sort();
+    return '{' + keys.map((k) => JSON.stringify(k) + ':' + canonical(obj[k])).join(',') + '}';
+}
+/**
+ * Derive the stable content hash for a proposal's identity.
+ */
+function proposalHash(parts) {
+    const sig = canonical({
+        type: parts.type,
+        targetKind: parts.targetKind,
+        targetPath: parts.targetPath,
+        payload: parts.payload,
+    });
+    return (0, crypto_1.createHash)('sha256').update(sig).digest('hex').slice(0, 16);
+}
+//# sourceMappingURL=hash.js.map

package/dist/reflect/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/reflect/hash.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAiBH,oCAaC;AA5BD,mCAAoC;AAGpC,0FAA0F;AAC1F,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IAC5E,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;AAC5F,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,KAK5B;IACC,MAAM,GAAG,GAAG,SAAS,CAAC;QACpB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,UAAU,EAAE,KAAK,CAAC,UAAU;QAC5B,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAC,CAAC;IACH,OAAO,IAAA,mBAAU,EAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACrE,CAAC"}

package/dist/reflect/index.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Reflection engine (REFLECT-DOC) — barrel.
+ *
+ * Mines the ingested `claude_*` transcript tables for recurring, actionable
+ * patterns and turns them into durable, human-gated proposals (memory/CLAUDE.md
+ * rules, skills/commands, hooks). Surfaced via the SpecShip class methods, the
+ * `specship reflect` CLI, and the dashboard's Improvements list.
+ */
+export * from './types';
+export { mineProposals } from './miner';
+export { buildProposal, learningMarkers, memoryNoteMarker } from './targets';
+export { previewProposal, applyProposal, undoProposal, lineDiff } from './apply';
+export { ReflectStore } from './store';
+export { analyze, sweep } from './sweep';
+export type { AnalyzeResult, SweepResult } from './sweep';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/reflect/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,SAAS,CAAC;AACxB,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAC7E,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AACzC,YAAY,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC"}

package/dist/reflect/index.js

@@ -0,0 +1,43 @@
+"use strict";
+/**
+ * Reflection engine (REFLECT-DOC) — barrel.
+ *
+ * Mines the ingested `claude_*` transcript tables for recurring, actionable
+ * patterns and turns them into durable, human-gated proposals (memory/CLAUDE.md
+ * rules, skills/commands, hooks). Surfaced via the SpecShip class methods, the
+ * `specship reflect` CLI, and the dashboard's Improvements list.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sweep = exports.analyze = exports.ReflectStore = exports.lineDiff = exports.undoProposal = exports.applyProposal = exports.previewProposal = exports.memoryNoteMarker = exports.learningMarkers = exports.buildProposal = exports.mineProposals = void 0;
+__exportStar(require("./types"), exports);
+var miner_1 = require("./miner");
+Object.defineProperty(exports, "mineProposals", { enumerable: true, get: function () { return miner_1.mineProposals; } });
+var targets_1 = require("./targets");
+Object.defineProperty(exports, "buildProposal", { enumerable: true, get: function () { return targets_1.buildProposal; } });
+Object.defineProperty(exports, "learningMarkers", { enumerable: true, get: function () { return targets_1.learningMarkers; } });
+Object.defineProperty(exports, "memoryNoteMarker", { enumerable: true, get: function () { return targets_1.memoryNoteMarker; } });
+var apply_1 = require("./apply");
+Object.defineProperty(exports, "previewProposal", { enumerable: true, get: function () { return apply_1.previewProposal; } });
+Object.defineProperty(exports, "applyProposal", { enumerable: true, get: function () { return apply_1.applyProposal; } });
+Object.defineProperty(exports, "undoProposal", { enumerable: true, get: function () { return apply_1.undoProposal; } });
+Object.defineProperty(exports, "lineDiff", { enumerable: true, get: function () { return apply_1.lineDiff; } });
+var store_1 = require("./store");
+Object.defineProperty(exports, "ReflectStore", { enumerable: true, get: function () { return store_1.ReflectStore; } });
+var sweep_1 = require("./sweep");
+Object.defineProperty(exports, "analyze", { enumerable: true, get: function () { return sweep_1.analyze; } });
+Object.defineProperty(exports, "sweep", { enumerable: true, get: function () { return sweep_1.sweep; } });
+//# sourceMappingURL=index.js.map

package/dist/reflect/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/reflect/index.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;;;;;;;;;;;;;;;AAEH,0CAAwB;AACxB,iCAAwC;AAA/B,sGAAA,aAAa,OAAA;AACtB,qCAA6E;AAApE,wGAAA,aAAa,OAAA;AAAE,0GAAA,eAAe,OAAA;AAAE,2GAAA,gBAAgB,OAAA;AACzD,iCAAiF;AAAxE,wGAAA,eAAe,OAAA;AAAE,sGAAA,aAAa,OAAA;AAAE,qGAAA,YAAY,OAAA;AAAE,iGAAA,QAAQ,OAAA;AAC/D,iCAAuC;AAA9B,qGAAA,YAAY,OAAA;AACrB,iCAAyC;AAAhC,gGAAA,OAAO,OAAA;AAAE,8FAAA,KAAK,OAAA"}

package/dist/reflect/miner.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Proposal miner (REQ-REFLECT-001 / 002).
+ *
+ * Reads the ingested `claude_*` transcript tables and detects recurring,
+ * actionable patterns, emitting one typed Proposal per finding with cited
+ * evidence and a severity. Each rule is a bounded SQL query (mirroring the tips
+ * engine's shape) feeding `buildProposal`, which resolves the concrete write
+ * target and the stable content hash.
+ *
+ * The *set* of rules is the implementation frontier the spec deliberately left
+ * open — new detectors slot in here without touching apply/store/surface.
+ *
+ * When the transcript tables are absent (a headless `specship reflect` against a
+ * project the dashboard has never ingested), the miner returns `[]` so the
+ * caller can render the empty state rather than erroring (REQ-REFLECT-001.A2).
+ */
+import { SqliteDatabase } from '../db/sqlite-adapter';
+import { Proposal, ReflectContext } from './types';
+/** Mine all rules. Pure read — never writes the DB or disk. */
+export declare function mineProposals(db: SqliteDatabase, ctx: ReflectContext): Proposal[];
+//# sourceMappingURL=miner.d.ts.map

package/dist/reflect/miner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"miner.d.ts","sourceRoot":"","sources":["../../src/reflect/miner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAkCnD,+DAA+D;AAC/D,wBAAgB,aAAa,CAAC,EAAE,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,GAAG,QAAQ,EAAE,CAkBjF"}

package/dist/reflect/miner.js

@@ -0,0 +1,463 @@
+"use strict";
+/**
+ * Proposal miner (REQ-REFLECT-001 / 002).
+ *
+ * Reads the ingested `claude_*` transcript tables and detects recurring,
+ * actionable patterns, emitting one typed Proposal per finding with cited
+ * evidence and a severity. Each rule is a bounded SQL query (mirroring the tips
+ * engine's shape) feeding `buildProposal`, which resolves the concrete write
+ * target and the stable content hash.
+ *
+ * The *set* of rules is the implementation frontier the spec deliberately left
+ * open — new detectors slot in here without touching apply/store/surface.
+ *
+ * When the transcript tables are absent (a headless `specship reflect` against a
+ * project the dashboard has never ingested), the miner returns `[]` so the
+ * caller can render the empty state rather than erroring (REQ-REFLECT-001.A2).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mineProposals = mineProposals;
+const targets_1 = require("./targets");
+/** Tuning knobs — thresholds above which a pattern is worth proposing. */
+const THRESHOLDS = {
+    repeatedReadsPerSession: 10, // R1: same file Read ≥N times in one session
+    grepHabitTotal: 12, // R2: grep/find used ≥N times overall
+    repeatedPromptCount: 3, // R3: identical ask appears ≥N times
+    repeatedCmdSessions: 2, // R4: same bash command in ≥N sessions
+    repeatedCmdTotal: 5, // R4: …and ≥N times overall
+    destructiveMin: 2, // R5: a destructive shell op seen ≥N times
+    editHotspotTotal: 8, // R6: same file Edited ≥N times overall
+    editHotspotSessions: 2, // R6: …across ≥N sessions
+    correctionMin: 2, // R7: same corrective instruction repeated ≥N times
+    specshipColdReadMin: 15, // R8: reads/greps in a session to count as read-heavy
+    specshipColdSessions: 2, // R8: ≥N read-heavy sessions with zero specship calls
+    heavyOutputBytes: 50000, // R9: a Bash call whose result exceeds N "tokens"
+    heavyOutputMin: 2, // R9: …seen ≥N times
+    refDocSessions: 3, // R10: a doc file Read across ≥N distinct sessions
+};
+/** Per-rule cap so a noisy corpus can't flood the Improvements list. */
+const PER_RULE_LIMIT = 5;
+function tableExists(db, name) {
+    try {
+        const row = db
+            .prepare(`SELECT 1 AS x FROM sqlite_master WHERE type='table' AND name=?`)
+            .get(name);
+        return !!row;
+    }
+    catch {
+        return false;
+    }
+}
+/** Mine all rules. Pure read — never writes the DB or disk. */
+function mineProposals(db, ctx) {
+    if (!tableExists(db, 'claude_tool_calls') || !tableExists(db, 'claude_prompts')) {
+        return [];
+    }
+    const out = [];
+    out.push(...ruleRepeatedReads(db, ctx));
+    out.push(...ruleGrepHabit(db, ctx));
+    out.push(...ruleRepeatedPrompts(db, ctx));
+    out.push(...ruleRepeatedCommands(db, ctx));
+    // Round 2 detectors.
+    out.push(...ruleDestructiveCommands(db, ctx));
+    out.push(...ruleEditHotspot(db, ctx));
+    out.push(...ruleRecurringCorrection(db, ctx));
+    // Round 3 detectors.
+    out.push(...ruleSpecshipCold(db, ctx));
+    out.push(...ruleHeavyOutput(db, ctx));
+    out.push(...ruleReferenceDoc(db, ctx));
+    return out;
+}
+/**
+ * R1 → memory_rule (project CLAUDE.md): the agent Read the same file many times
+ * in a single session. A project-specific rule steering it to specship_explore
+ * for that area is the durable fix.
+ */
+function ruleRepeatedReads(db, ctx) {
+    const rows = db
+        .prepare(`SELECT session_id, input_summary AS file, COUNT(*) AS n
+       FROM claude_tool_calls
+       WHERE tool_name = 'Read' AND input_summary != ''
+       GROUP BY session_id, input_summary
+       HAVING n >= ?
+       ORDER BY n DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.repeatedReadsPerSession, PER_RULE_LIMIT);
+    return rows.map((r) => {
+        const base = r.file.split('/').pop() || r.file;
+        return (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'high',
+            nameSeed: base,
+            title: `Prefer specship_explore over re-reading ${base}`,
+            body: `${base} was Read ${r.n} times in a single session. A structural specship_explore query returns its callers, callees, and linked specs in one call — cheaper and complete.`,
+            content: `When you need to understand \`${base}\` (or the area around it), call \`specship_explore\` with the relevant symbol names first and treat the returned source as already Read — do not re-Read the file repeatedly.`,
+            evidence: {
+                sessions: [r.session_id],
+                prompts: [],
+                detail: `Read(${r.file}) × ${r.n} in one session`,
+            },
+        });
+    });
+}
+/**
+ * R2 → memory_rule (portable ~/.claude/memory): heavy grep/find usage is a
+ * cross-project habit, so the learning is portable, not repo-specific.
+ */
+function ruleGrepHabit(db, ctx) {
+    const row = db
+        .prepare(`SELECT COUNT(*) AS n, COUNT(DISTINCT session_id) AS s
+       FROM claude_tool_calls
+       WHERE tool_name = 'Bash'
+         AND (input_summary LIKE 'grep%' OR input_summary LIKE '%grep %'
+              OR input_summary LIKE 'find %' OR input_summary LIKE 'rg %')`)
+        .get();
+    if (!row || row.n < THRESHOLDS.grepHabitTotal)
+        return [];
+    const sessRows = db
+        .prepare(`SELECT DISTINCT session_id FROM claude_tool_calls
+       WHERE tool_name = 'Bash' AND (input_summary LIKE '%grep %' OR input_summary LIKE 'grep%'
+             OR input_summary LIKE 'find %' OR input_summary LIKE 'rg %')
+       LIMIT 8`)
+        .all();
+    return [
+        (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'portable',
+            severity: 'warn',
+            nameSeed: 'prefer-specship-search-over-grep',
+            title: 'Prefer specship_search over grep/find',
+            body: `grep/find ran ${row.n} times across ${row.s} sessions. specship_search hits the pre-built FTS index and returns symbol locations directly — usually one call instead of a grep+read loop.`,
+            content: 'For "where is X" / "find the symbol named X" questions, reach for `specship_search` (or `specship_explore` for "how does X work") before shelling out to grep/find/rg — SpecShip is the pre-built search index, so a grep+read loop repeats work it already did.',
+            evidence: {
+                sessions: sessRows.map((s) => s.session_id),
+                prompts: [],
+                detail: `grep/find/rg × ${row.n} across ${row.s} sessions`,
+            },
+        }),
+    ];
+}
+/** Normalize a prompt for grouping: trim, lowercase, collapse whitespace. */
+function normalizePrompt(t) {
+    return t.replace(/\s+/g, ' ').trim().toLowerCase();
+}
+/**
+ * R3 → skill (commands/ss-<name>.md): the user typed essentially the same ask
+ * many times. A reusable slash command captures the routine.
+ */
+function ruleRepeatedPrompts(db, ctx) {
+    const rows = db
+        .prepare(`SELECT id, text FROM claude_prompts
+       WHERE text IS NOT NULL AND length(text) BETWEEN 12 AND 200
+         AND text NOT LIKE '<%' AND text NOT LIKE '%<command-name>%'
+         AND is_sidechain = 0
+       ORDER BY ts DESC
+       LIMIT 4000`)
+        .all();
+    const groups = new Map();
+    for (const r of rows) {
+        const key = normalizePrompt(r.text);
+        if (!key)
+            continue;
+        const g = groups.get(key) ?? { count: 0, prompts: [], sample: r.text.trim() };
+        g.count++;
+        if (g.prompts.length < 8)
+            g.prompts.push(r.id);
+        groups.set(key, g);
+    }
+    const repeated = [...groups.values()]
+        .filter((g) => g.count >= THRESHOLDS.repeatedPromptCount)
+        .sort((a, b) => b.count - a.count)
+        .slice(0, PER_RULE_LIMIT);
+    return repeated.map((g) => (0, targets_1.buildProposal)(ctx, {
+        type: 'skill',
+        severity: 'warn',
+        nameSeed: g.sample,
+        title: `Capture "${truncate(g.sample, 48)}" as a command`,
+        body: `This ask appeared ${g.count} times. A slash command turns the repeated instruction into one reusable invocation.`,
+        content: `Run the following routine:\n\n${g.sample}`,
+        evidence: {
+            sessions: [],
+            prompts: g.prompts,
+            detail: `Same ask repeated ${g.count}×`,
+        },
+    }));
+}
+/**
+ * R4 → hook (.claude/settings.json): the agent ran the same shell command after
+ * edits across multiple sessions. A PostToolUse hook automates the manual step.
+ */
+function ruleRepeatedCommands(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS cmd, COUNT(*) AS n, COUNT(DISTINCT session_id) AS s,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name = 'Bash' AND input_summary != ''
+         AND input_summary NOT LIKE 'grep%' AND input_summary NOT LIKE '%grep %'
+         AND input_summary NOT LIKE 'find %' AND input_summary NOT LIKE 'cd %'
+         AND input_summary NOT LIKE 'ls%' AND input_summary NOT LIKE 'cat %'
+       GROUP BY input_summary
+       HAVING s >= ? AND n >= ?
+       ORDER BY n DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.repeatedCmdSessions, THRESHOLDS.repeatedCmdTotal, PER_RULE_LIMIT);
+    return rows.map((r) => (0, targets_1.buildProposal)(ctx, {
+        type: 'hook',
+        severity: 'info',
+        nameSeed: r.cmd,
+        title: `Automate \`${truncate(r.cmd, 40)}\` with a hook`,
+        body: `\`${truncate(r.cmd, 80)}\` was run ${r.n} times across ${r.s} sessions, mostly by hand. A PostToolUse hook can run it automatically after edits.`,
+        content: r.cmd,
+        hook: { event: 'PostToolUse', matcher: 'Edit|Write', command: r.cmd },
+        evidence: {
+            sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+            prompts: [],
+            detail: `\`${truncate(r.cmd, 60)}\` × ${r.n} across ${r.s} sessions`,
+        },
+    }));
+}
+/** Destructive shell-operation categories the agent should treat with care. */
+const DESTRUCTIVE = [
+    { key: 'rm-rf', label: 'recursive force-delete (`rm -rf`)', re: /\brm\s+-[a-z]*r[a-z]*f[a-z]*\b|\brm\s+-[a-z]*f[a-z]*r[a-z]*\b/i },
+    { key: 'git-force-push', label: 'force push (`git push --force`)', re: /\bgit\s+push\b[^|;&]*(--force\b|--force-with-lease\b|\s-f\b)/i },
+    { key: 'git-reset-hard', label: 'hard reset (`git reset --hard`)', re: /\bgit\s+reset\b[^|;&]*--hard\b/i },
+    { key: 'git-clean', label: 'force clean (`git clean -fd`)', re: /\bgit\s+clean\b[^|;&]*-[a-z]*f/i },
+    { key: 'drop-db', label: 'dropping a table/database (`DROP …`)', re: /\bdrop\s+(table|database|schema)\b/i },
+];
+/**
+ * R5 → memory_rule (project CLAUDE.md): destructive shell operations showed up
+ * in the transcripts. A high-severity caution rule is the durable response — we
+ * deliberately propose a *rule* rather than auto-generating a fragile guard
+ * script (a guard-hook variant is a future detector).
+ */
+function ruleDestructiveCommands(db, ctx) {
+    const rows = db
+        .prepare(`SELECT session_id, input_summary AS cmd FROM claude_tool_calls WHERE tool_name = 'Bash' AND input_summary != ''`)
+        .all();
+    const buckets = new Map();
+    for (const r of rows) {
+        for (const d of DESTRUCTIVE) {
+            if (d.re.test(r.cmd)) {
+                const b = buckets.get(d.key) ?? { count: 0, sessions: new Set(), sample: r.cmd };
+                b.count++;
+                b.sessions.add(r.session_id);
+                buckets.set(d.key, b);
+            }
+        }
+    }
+    const out = [];
+    for (const d of DESTRUCTIVE) {
+        const b = buckets.get(d.key);
+        if (!b || b.count < THRESHOLDS.destructiveMin)
+            continue;
+        out.push((0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'high',
+            nameSeed: `caution-${d.key}`,
+            title: `Treat ${d.label} with care`,
+            body: `${d.label} ran ${b.count} times across ${b.sessions.size} session(s). A standing caution keeps an irreversible operation from being run without a beat of confirmation.`,
+            content: `Before running ${d.label}, pause and confirm the target is correct — these operations are irreversible. Prefer a dry-run or a narrower, reversible alternative when one exists.`,
+            evidence: {
+                sessions: [...b.sessions].slice(0, 8),
+                prompts: [],
+                detail: `${d.label} × ${b.count} across ${b.sessions.size} session(s)`,
+            },
+        }));
+    }
+    return out;
+}
+/**
+ * R6 → memory_rule (project CLAUDE.md): a file is edited over and over across
+ * sessions — a hotspot whose contract is worth documenting so future edits
+ * don't relearn it from scratch.
+ */
+function ruleEditHotspot(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS file, COUNT(*) AS n, COUNT(DISTINCT session_id) AS s,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name IN ('Edit', 'Write', 'MultiEdit') AND input_summary != ''
+       GROUP BY input_summary
+       HAVING n >= ? AND s >= ?
+       ORDER BY n DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.editHotspotTotal, THRESHOLDS.editHotspotSessions, PER_RULE_LIMIT);
+    return rows.map((r) => {
+        const base = r.file.split('/').pop() || r.file;
+        return (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'warn',
+            nameSeed: `hotspot-${base}`,
+            title: `Document the contract of ${base} — it changes often`,
+            body: `${base} was edited ${r.n} times across ${r.s} sessions. Capturing its invariants (and what must stay true after a change) saves rediscovering them on every edit.`,
+            content: `\`${base}\` is a frequently-edited hotspot. Before changing it, check \`specship_explore\` for its callers and document the invariants a change must preserve. Consider whether it needs tighter test coverage.`,
+            evidence: {
+                sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+                prompts: [],
+                detail: `${base} edited × ${r.n} across ${r.s} sessions`,
+            },
+        });
+    });
+}
+/** Leading cues that mark a prompt as a correction of the agent's behavior. */
+const CORRECTION_CUE = /^(no\b|don'?t\b|do not\b|never\b|always\b|stop\b|instead\b|actually\b|you should\b|please don'?t\b)/i;
+/**
+ * R7 → memory_rule (portable ~/.claude/memory): the user keeps issuing the same
+ * corrective instruction. That's a durable preference worth recording so it
+ * doesn't have to be repeated — the core Hermes "learn from corrections" idea.
+ */
+function ruleRecurringCorrection(db, ctx) {
+    const rows = db
+        .prepare(`SELECT id, text FROM claude_prompts
+       WHERE text IS NOT NULL AND length(text) BETWEEN 12 AND 200
+         AND text NOT LIKE '<%' AND text NOT LIKE '%<command-name>%'
+         AND is_sidechain = 0
+       ORDER BY ts DESC
+       LIMIT 4000`)
+        .all();
+    const groups = new Map();
+    for (const r of rows) {
+        const trimmed = r.text.trim();
+        if (!CORRECTION_CUE.test(trimmed))
+            continue;
+        const key = trimmed.replace(/\s+/g, ' ').toLowerCase();
+        const g = groups.get(key) ?? { count: 0, prompts: [], sample: trimmed };
+        g.count++;
+        if (g.prompts.length < 8)
+            g.prompts.push(r.id);
+        groups.set(key, g);
+    }
+    const repeated = [...groups.values()]
+        .filter((g) => g.count >= THRESHOLDS.correctionMin)
+        .sort((a, b) => b.count - a.count)
+        .slice(0, PER_RULE_LIMIT);
+    return repeated.map((g) => (0, targets_1.buildProposal)(ctx, {
+        type: 'memory_rule',
+        scope: 'portable',
+        severity: 'warn',
+        nameSeed: `correction-${g.sample}`,
+        title: `Recurring correction: "${truncate(g.sample, 48)}"`,
+        body: `You've given this correction ${g.count} times. Recording it as a durable preference means you shouldn't have to repeat it.`,
+        content: `Standing user preference (you have repeated this): ${g.sample}`,
+        evidence: {
+            sessions: [],
+            prompts: g.prompts,
+            detail: `Correction repeated ${g.count}×`,
+        },
+    }));
+}
+/**
+ * R8 → memory_rule (portable ~/.claude/memory): sessions that lean hard on
+ * Read/grep while making zero specship calls. SpecShip is indexed here, so a
+ * portable habit-note to query it first is the durable fix. Uses the
+ * `is_specship` classification on tool calls.
+ */
+function ruleSpecshipCold(db, ctx) {
+    const rows = db
+        .prepare(`SELECT session_id,
+              SUM(CASE WHEN tool_name IN ('Read','Grep')
+                        OR (tool_name='Bash' AND (input_summary LIKE 'grep%' OR input_summary LIKE '%grep %'
+                              OR input_summary LIKE 'find %' OR input_summary LIKE 'rg %'))
+                       THEN 1 ELSE 0 END) AS reads,
+              SUM(is_specship) AS ss
+       FROM claude_tool_calls
+       GROUP BY session_id
+       HAVING reads >= ? AND ss = 0`)
+        .all(THRESHOLDS.specshipColdReadMin);
+    if (rows.length < THRESHOLDS.specshipColdSessions)
+        return [];
+    const totalReads = rows.reduce((a, r) => a + r.reads, 0);
+    return [
+        (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'portable',
+            severity: 'warn',
+            nameSeed: 'query-specship-first',
+            title: 'Query SpecShip before reading or grepping',
+            body: `${rows.length} read-heavy sessions (${totalReads} Read/grep calls) made no specship calls at all. SpecShip is the pre-built index for this code — a structural query usually answers in one call what a grep+read loop takes many.`,
+            content: 'This project is indexed by SpecShip. For "how does X work" / "where is X" / trace / impact questions, call `specship_explore` (or `specship_search`) FIRST and treat the returned source as already Read — only fall back to Read/grep to confirm a detail it did not cover.',
+            evidence: {
+                sessions: rows.map((r) => r.session_id).slice(0, 8),
+                prompts: [],
+                detail: `${rows.length} read-heavy sessions with 0 specship calls`,
+            },
+        }),
+    ];
+}
+/**
+ * R9 → memory_rule (project CLAUDE.md): a Bash command that dumps a huge result
+ * into context, repeatedly. Scoping its output (or using a structural query) is
+ * the durable fix. Uses `result_length`.
+ */
+function ruleHeavyOutput(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS cmd, COUNT(*) AS n, MAX(result_length) AS maxlen,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name = 'Bash' AND input_summary != '' AND result_length > ?
+       GROUP BY input_summary
+       HAVING n >= ?
+       ORDER BY maxlen DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.heavyOutputBytes, THRESHOLDS.heavyOutputMin, PER_RULE_LIMIT);
+    return rows.map((r) => (0, targets_1.buildProposal)(ctx, {
+        type: 'memory_rule',
+        scope: 'project',
+        severity: 'warn',
+        nameSeed: `heavy-output-${r.cmd}`,
+        title: `Scope the output of \`${truncate(r.cmd, 40)}\``,
+        body: `\`${truncate(r.cmd, 80)}\` returned up to ~${Math.round(r.maxlen / 1000)}k tokens and ran ${r.n} times. Dumping large output into context is a dominant cost driver.`,
+        content: `When you need the result of \`${truncate(r.cmd, 80)}\`, scope it (filter, head, or target a path) — or answer the underlying question with a \`specship_search\`/\`specship_explore\` query instead of reading the full output into context.`,
+        evidence: {
+            sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+            prompts: [],
+            detail: `~${Math.round(r.maxlen / 1000)}k-token output × ${r.n}`,
+        },
+    }));
+}
+/**
+ * R10 → memory_rule (project CLAUDE.md): a documentation file read across many
+ * separate sessions is context the agent keeps rediscovering. Pointing at it
+ * from CLAUDE.md keeps it in context. Distinct from R1 (in-session re-reads of
+ * any file) — this keys on cross-session breadth of a *doc* file.
+ */
+function ruleReferenceDoc(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS file, COUNT(DISTINCT session_id) AS s,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name = 'Read' AND input_summary != ''
+         AND (input_summary LIKE '%.md' OR input_summary LIKE '%.mdx'
+              OR input_summary LIKE '%.txt' OR input_summary LIKE '%.rst'
+              OR input_summary LIKE '%.adoc')
+       GROUP BY input_summary
+       HAVING s >= ?
+       ORDER BY s DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.refDocSessions, PER_RULE_LIMIT);
+    return rows.map((r) => {
+        const base = r.file.split('/').pop() || r.file;
+        return (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'warn',
+            nameSeed: `reference-${base}`,
+            title: `Reference ${base} from CLAUDE.md`,
+            body: `${base} was read in ${r.s} separate sessions — context the agent keeps rediscovering. Pointing at it from CLAUDE.md (or importing it with @path) keeps it on hand without a Read each time.`,
+            content: `\`${base}\` is frequently-needed context. Add a short pointer to it here (or import it with \`@${r.file}\`) so its guidance is always in context instead of re-Read each session.`,
+            evidence: {
+                sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+                prompts: [],
+                detail: `${base} read across ${r.s} sessions`,
+            },
+        });
+    });
+}
+function truncate(s, n) {
+    const t = s.replace(/\s+/g, ' ').trim();
+    return t.length > n ? t.slice(0, n) + '…' : t;
+}
+//# sourceMappingURL=miner.js.map