gurkencheck 0.0.6 → 0.0.7

package/dist/stats/format/text.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text.js","sourceRoot":"","sources":["../../../src/stats/format/text.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAC,KAAK,EAAC,MAAM,iBAAiB,CAAC;AAEtC,OAAO,EAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAC,MAAM,aAAa,CAAC;AAGhF,8EAA8E;AAC9E,MAAM,UAAU,GAAG,EAAE,CAAC;AAEtB,SAAS,QAAQ,CAAC,IAAY,EAAE,KAAK,GAAG,UAAU;IAChD,OAAO,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;AACtE,CAAC;AAeD,gEAAgE;AAChE,SAAS,KAAK,CAAC,OAAuB;IACpC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1F,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAC/B,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAClF,CAAC,CACF,CAAC;IAEF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACzB,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC7E,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,EAAE,CAAC;QAC5D,OAAO,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC;AAUD,uEAAuE;AACvE,SAAS,OAAO,CAAC,OAAyB,EAAE,MAAM,GAAG,MAAM;IACzD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAC/B,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,EAC/F,CAAC,CACF,CAAC;IACF,MAAM,MAAM,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;IACpF,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAC9B,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAChE,CAAC,CACF,CAAC;IAEF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC3B,MAAM,OAAO,GACX,KAAK,CAAC,KAAK,KAAK,SAAS;YACvB,CAAC,CAAC,GAAG,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;YACpC,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACtF,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC9B,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;IACpF,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,IAAI,CAAC,MAAc,EAAE,QAAgB;IAC5C,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,SAAS,CAAC,OAA6B,EAAE,OAAO,GAAG,IAAI;IAC9D,OAAO,OAAO,CACZ,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtB,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxC,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;KACxC,CAAC,CAAC,CACJ,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,MAA+B;IACnD,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACvG,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,MAAM,CAAC,UAAsB,EAAE,OAA2B;IACxE,MAAM,EAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAC,GAAG,UAAU,CAAC;IAEzE,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,yBAAyB,CAAC;IACnC,CAAC;IAED,MAAM,OAAO,GACX,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAC3B,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC;QAC9B,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;IAE1D,MAAM,KAAK,GAAa;QACtB,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAC7F,IAAI,CACL;KACF,CAAC;IAEF,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;QACnC,EAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAC;QACtD,EAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAC;QAChD,EAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAC;QAC5D,EAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,EAAC;QACxD,EAAC,KAAK,EAAE,mBAAmB,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,gBAAgB,CAAC,EAAC;QACvE;YACE,KAAK,EAAE,iBAAiB;YACxB,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;YACvC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC;SAC5C;QACD,EAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,YAAY,EAAC;QACpE,EAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAC;QAC3D,EAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAC;KAC5D,CAAC,CAAC,CAAC;IAEJ,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACrD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;QACnC;YACE,KAAK,EAAE,YAAY;YACnB,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC;YAClC,IAAI,EAAE,wCAAwC;SAC/C;QACD;YACE,KAAK,EAAE,oBAAoB;YAC3B,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,gBAAgB,CAAC;YAC5C,IAAI,EAAE,2BAA2B;YACjC,IAAI,EAAE,IAAI;SACX;KACF,CAAC,CAAC,CAAC;IACJ,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,WAAW,EACX,GAAG,OAAO,CACR,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAC/B,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI;YACxD,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;SAC9C,CAAC,CAAC,CACJ,EACD,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CACpC,CAAC;IACJ,CAAC;IAED,MAAM,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;IAClD,MAAM,GAAG,GAAG;QACV,SAAS,KAAK,KAAK,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG;QACjD,QAAQ,IAAI,KAAK,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG;QAC9C,QAAQ,IAAI,KAAK,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG;QAC9C,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,KAAK,EAAE,CAAC,CAAC;KAChD,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEd,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;QAC/B,EAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,2BAA2B,EAAC;QACjF;YACE,KAAK,EAAE,UAAU;YACjB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;YAC3B,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,qCAAqC;SACjF;QACD;YACE,KAAK,EAAE,cAAc;YACrB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC7B,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,oBAAoB;SACnE;QACD,EAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,IAAI,EAAC;QAC3E;YACE,KAAK,EAAE,UAAU;YACjB,KAAK,EAAE,GAAG;YACV,IAAI,EAAE,0CAA0C;YAChD,IAAI,EAAE,IAAI;SACX;KACF,CAAC,CAAC,CAAC;IAEJ,MAAM,QAAQ,GAAG,IAAI,CACnB,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EACnD,OAAO,CAAC,GAAG,CACZ,CAAC;IACF,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CACf,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACrG,OAAO,CAAC,GAAG,CACZ,CAAC;IACF,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,gBAAgB,EAChB,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAC/B,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC7B,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACjD,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,sBAAsB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,EAC9D,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,EAC9B,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CACjC,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC,gBAAgB,CAAC;IAClE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;QAC9B,EAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAC;QAC7C,EAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAC;QAC/C;YACE,KAAK,EAAE,cAAc;YACrB,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;YACnC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,yDAAyD;SACzG;QACD;YACE,KAAK,EAAE,oBAAoB;YAC3B,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC;YACrC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,iBAAiB,EAAE,QAAQ,CAAC,wCAAwC;SAC3F;KACF,CAAC,CAAC,CAAC;IAEJ,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACvF,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,aAAa,EACb,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAC,CAAC,CAAC,CAAC,EAC7E,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAChC,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAClD,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACxG,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CACR,EAAE,EACF,WAAW,EACX,GAAG,KAAK,CACN,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAC3B,KAAK,EAAE,QAAQ,CAAC,IAAI;YACpB,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAC7B,IAAI,EAAE,QAAQ,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO;SAC9C,CAAC,CAAC,CACJ,CACF,CAAC;IACJ,CAAC;IAED,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACvD,KAAK,CAAC,IAAI,CACR,EAAE,EACF,sBAAsB,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,sBAAsB,EACnF,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CACrB,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAC9E,EACD,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CACnC,CAAC;IACJ,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/stats/index.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Statistics: what is in a set of feature files, rather than what is wrong
+ * with them.
+ *
+ * ```ts
+ * import {collectStatistics, readAndParseFile, toText} from 'gurkencheck';
+ *
+ * const parsed = await Promise.all(files.map((file) => readAndParseFile(file)));
+ * console.log(toText(collectStatistics(parsed), {top: 10}));
+ * ```
+ */
+export { collectStatistics, distribution } from './collect.ts';
+export type { CollectOptions } from './collect.ts';
+export { DEFAULT_SIMILARITY, boundedEditDistance, groupSimilar } from './similar.ts';
+export type { SimilarityOptions } from './similar.ts';
+export { NUMBER_MARKER, PLACEHOLDER_MARKER, STRING_MARKER, countWords, normaliseStepText, } from './normalise.ts';
+export { DEFAULT_STATS_FORMAT, DEFAULT_TOP, STATS_FORMATTERS, getStatsFormatter, toJson as statisticsToJson, toMarkdown, toText, } from './format/index.ts';
+export type { StatsFormatOptions, StatsFormatter } from './format/index.ts';
+export { runStats, statsUsage } from './command.ts';
+export type * from './types.ts';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/stats/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAC,iBAAiB,EAAE,YAAY,EAAC,MAAM,cAAc,CAAC;AAC7D,YAAY,EAAC,cAAc,EAAC,MAAM,cAAc,CAAC;AACjD,OAAO,EAAC,kBAAkB,EAAE,mBAAmB,EAAE,YAAY,EAAC,MAAM,cAAc,CAAC;AACnF,YAAY,EAAC,iBAAiB,EAAC,MAAM,cAAc,CAAC;AACpD,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,aAAa,EACb,UAAU,EACV,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,oBAAoB,EACpB,WAAW,EACX,gBAAgB,EAChB,iBAAiB,EACjB,MAAM,IAAI,gBAAgB,EAC1B,UAAU,EACV,MAAM,GACP,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EAAC,kBAAkB,EAAE,cAAc,EAAC,MAAM,mBAAmB,CAAC;AAC1E,OAAO,EAAC,QAAQ,EAAE,UAAU,EAAC,MAAM,cAAc,CAAC;AAClD,mBAAmB,YAAY,CAAC"}

package/dist/stats/index.js

@@ -0,0 +1,17 @@
+/**
+ * Statistics: what is in a set of feature files, rather than what is wrong
+ * with them.
+ *
+ * ```ts
+ * import {collectStatistics, readAndParseFile, toText} from 'gurkencheck';
+ *
+ * const parsed = await Promise.all(files.map((file) => readAndParseFile(file)));
+ * console.log(toText(collectStatistics(parsed), {top: 10}));
+ * ```
+ */
+export { collectStatistics, distribution } from './collect.js';
+export { DEFAULT_SIMILARITY, boundedEditDistance, groupSimilar } from './similar.js';
+export { NUMBER_MARKER, PLACEHOLDER_MARKER, STRING_MARKER, countWords, normaliseStepText, } from './normalise.js';
+export { DEFAULT_STATS_FORMAT, DEFAULT_TOP, STATS_FORMATTERS, getStatsFormatter, toJson as statisticsToJson, toMarkdown, toText, } from './format/index.js';
+export { runStats, statsUsage } from './command.js';
+//# sourceMappingURL=index.js.map

package/dist/stats/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/stats/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAC,iBAAiB,EAAE,YAAY,EAAC,MAAM,cAAc,CAAC;AAE7D,OAAO,EAAC,kBAAkB,EAAE,mBAAmB,EAAE,YAAY,EAAC,MAAM,cAAc,CAAC;AAEnF,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,aAAa,EACb,UAAU,EACV,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,oBAAoB,EACpB,WAAW,EACX,gBAAgB,EAChB,iBAAiB,EACjB,MAAM,IAAI,gBAAgB,EAC1B,UAAU,EACV,MAAM,GACP,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAC,QAAQ,EAAE,UAAU,EAAC,MAAM,cAAc,CAAC"}

package/dist/stats/normalise.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Deciding when two steps are the same step.
+ *
+ * `I have 3 items in my cart` and `I have 7 items in my cart` are one step
+ * behind one step definition, and counting them as two would make every
+ * measure of reuse meaningless. So the parts a step definition captures as
+ * arguments - numbers, quoted strings, Scenario Outline placeholders - are
+ * replaced by a marker before two steps are compared.
+ *
+ * The keyword is not part of the text: the Gherkin parser hands it over
+ * separately, and `Given I am logged in` and `And I am logged in` are the
+ * same step written in two places.
+ *
+ * Each kind of argument keeps a marker of its own, so a placeholder and a
+ * value written in its place stay apart: `I have <count> items` does not
+ * become `I have 0 items`. That understates reuse a little in an outline
+ * heavy suite, and it is the trade worth making, because the normalised text
+ * is what the report shows a reader - and a `0` in a step that has no number
+ * in it would be a lie about the file. The two are put back together by the
+ * near-duplicate report in `similar.ts`, which is a couple of edits apart.
+ */
+/** Stands in for a Scenario Outline placeholder, whatever it was called. */
+export declare const PLACEHOLDER_MARKER = "<>";
+/** Stands in for a double quoted string, whatever it contained. */
+export declare const STRING_MARKER = "\"\"";
+/** Stands in for a number, whatever its value. */
+export declare const NUMBER_MARKER = "0";
+/**
+ * The form of a step text used to decide whether two steps are the same one.
+ *
+ * Single quotes are deliberately left alone: `the user's cart is 'empty'` has
+ * three of them, and a rule masking whatever sits between a pair would eat
+ * half the sentence. Cucumber's own expressions quote with `"` anyway.
+ */
+export declare function normaliseStepText(text: string): string;
+/** How many words a step is made of, counted before normalisation. */
+export declare function countWords(text: string): number;
+//# sourceMappingURL=normalise.d.ts.map

package/dist/stats/normalise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalise.d.ts","sourceRoot":"","sources":["../../src/stats/normalise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,4EAA4E;AAC5E,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAEvC,mEAAmE;AACnE,eAAO,MAAM,aAAa,SAAO,CAAC;AAElC,kDAAkD;AAClD,eAAO,MAAM,aAAa,MAAM,CAAC;AAiBjC;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAatD;AAED,sEAAsE;AACtE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAG/C"}

package/dist/stats/normalise.js

@@ -0,0 +1,65 @@
+/**
+ * Deciding when two steps are the same step.
+ *
+ * `I have 3 items in my cart` and `I have 7 items in my cart` are one step
+ * behind one step definition, and counting them as two would make every
+ * measure of reuse meaningless. So the parts a step definition captures as
+ * arguments - numbers, quoted strings, Scenario Outline placeholders - are
+ * replaced by a marker before two steps are compared.
+ *
+ * The keyword is not part of the text: the Gherkin parser hands it over
+ * separately, and `Given I am logged in` and `And I am logged in` are the
+ * same step written in two places.
+ *
+ * Each kind of argument keeps a marker of its own, so a placeholder and a
+ * value written in its place stay apart: `I have <count> items` does not
+ * become `I have 0 items`. That understates reuse a little in an outline
+ * heavy suite, and it is the trade worth making, because the normalised text
+ * is what the report shows a reader - and a `0` in a step that has no number
+ * in it would be a lie about the file. The two are put back together by the
+ * near-duplicate report in `similar.ts`, which is a couple of edits apart.
+ */
+/** Stands in for a Scenario Outline placeholder, whatever it was called. */
+export const PLACEHOLDER_MARKER = '<>';
+/** Stands in for a double quoted string, whatever it contained. */
+export const STRING_MARKER = '""';
+/** Stands in for a number, whatever its value. */
+export const NUMBER_MARKER = '0';
+const PLACEHOLDER = /<[^<>]*>/gu;
+const QUOTED = /"[^"]*"/gu;
+/**
+ * A whole number or decimal standing on its own. The word boundaries keep
+ * `1st` and `v2` intact, where the digits are part of a name rather than a
+ * value a step definition would capture.
+ */
+const NUMBER = /\b\d+(?:[.,]\d+)*\b/gu;
+const WHITESPACE = /\s+/gu;
+/** A full stop or exclamation mark at the end, which changes nothing. */
+const TRAILING_PUNCTUATION = /[\s.!]*[.!]$/u;
+/**
+ * The form of a step text used to decide whether two steps are the same one.
+ *
+ * Single quotes are deliberately left alone: `the user's cart is 'empty'` has
+ * three of them, and a rule masking whatever sits between a pair would eat
+ * half the sentence. Cucumber's own expressions quote with `"` anyway.
+ */
+export function normaliseStepText(text) {
+    return text
+        .replace(PLACEHOLDER, PLACEHOLDER_MARKER)
+        .replace(QUOTED, STRING_MARKER)
+        .replace(NUMBER, NUMBER_MARKER)
+        .toLowerCase()
+        .replace(WHITESPACE, ' ')
+        .trim()
+        // Whatever sat in front of the full stop goes with it: `I own it .` and
+        // `I own it` are one step, and a step text ending in a space is not one
+        // anybody would recognise in the report.
+        .replace(TRAILING_PUNCTUATION, '')
+        .trim();
+}
+/** How many words a step is made of, counted before normalisation. */
+export function countWords(text) {
+    const trimmed = text.trim();
+    return trimmed === '' ? 0 : trimmed.split(WHITESPACE).length;
+}
+//# sourceMappingURL=normalise.js.map

package/dist/stats/normalise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalise.js","sourceRoot":"","sources":["../../src/stats/normalise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,4EAA4E;AAC5E,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEvC,mEAAmE;AACnE,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAAC;AAElC,kDAAkD;AAClD,MAAM,CAAC,MAAM,aAAa,GAAG,GAAG,CAAC;AAEjC,MAAM,WAAW,GAAG,YAAY,CAAC;AACjC,MAAM,MAAM,GAAG,WAAW,CAAC;AAE3B;;;;GAIG;AACH,MAAM,MAAM,GAAG,uBAAuB,CAAC;AAEvC,MAAM,UAAU,GAAG,OAAO,CAAC;AAE3B,yEAAyE;AACzE,MAAM,oBAAoB,GAAG,eAAe,CAAC;AAE7C;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,OAAO,IAAI;SACR,OAAO,CAAC,WAAW,EAAE,kBAAkB,CAAC;SACxC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC;SAC9B,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC;SAC9B,WAAW,EAAE;SACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,IAAI,EAAE;QACP,wEAAwE;QACxE,wEAAwE;QACxE,yCAAyC;SACxC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC;SACjC,IAAI,EAAE,CAAC;AACZ,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,OAAO,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;AAC/D,CAAC"}

package/dist/stats/similar.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Finding steps that are nearly, but not quite, the same step.
+ *
+ * `I am logged in` and `I'm logged in` are one behaviour written twice, and
+ * they cost two step definitions. Normalisation cannot join them - they
+ * really are different sentences - so they are grouped by how many single
+ * character edits it takes to turn one into the other.
+ *
+ * Edit distance is quadratic in the number of distinct steps, which on a
+ * large suite is millions of comparisons, so two cheap tests run first. Both
+ * are lower bounds on the distance, never overestimates, so a pair they
+ * reject could not have been close enough anyway:
+ *
+ * - two strings are at least as far apart as their lengths differ;
+ * - every edit changes the tally of characters by at most two, so half the
+ *   difference between two tallies is a floor on the distance as well.
+ */
+/** How alike two steps have to be before they are reported together. */
+export interface SimilarityOptions {
+    /**
+     * `1 - distance / length`, against the longer of the two steps. At 0.85 a
+     * forty character step may differ by six edits.
+     */
+    ratio: number;
+    /**
+     * Steps shorter than this are left out. `I wait` and `I wait 0` are two
+     * edits apart, and at that length almost everything looks like everything.
+     */
+    minLength: number;
+    /**
+     * Edits never allowed beyond, however long the steps are.
+     *
+     * The ratio on its own lets a long step drift a long way: six edits turn
+     * `the customer opens the order in bulk` into `the customer opens the cart
+     * in bulk`, which is a different step rather than the same one spelled two
+     * ways. What this report is for is the small differences - an apostrophe, a
+     * plural, a missing article - and three edits covers those.
+     *
+     * It is also what keeps the search quick: with a low cap two steps have to
+     * be within a few characters in length before they are compared at all.
+     */
+    maxEdits: number;
+}
+export declare const DEFAULT_SIMILARITY: SimilarityOptions;
+/**
+ * The Levenshtein distance between two strings, giving up as soon as it is
+ * certain to exceed `limit` and returning `limit + 1` in that case.
+ *
+ * Every value in a row of the table is a lower bound on everything below it,
+ * so once the whole row is past the limit there is no way back.
+ */
+export declare function boundedEditDistance(left: string, right: string, limit: number): number;
+/**
+ * Groups entries whose text is close enough to be the same step written two
+ * ways. Entries that are close to nothing are left out, so every group
+ * returned has at least two members, in the order they were given in.
+ */
+export declare function groupSimilar<T extends {
+    text: string;
+}>(entries: readonly T[], options?: SimilarityOptions): T[][];
+//# sourceMappingURL=similar.d.ts.map

package/dist/stats/similar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar.d.ts","sourceRoot":"","sources":["../../src/stats/similar.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,wEAAwE;AACxE,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB;;;;;;;;;;;OAWG;IACH,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,eAAO,MAAM,kBAAkB,EAAE,iBAA4D,CAAC;AAwC9F;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAsCtF;AAgCD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS;IAAC,IAAI,EAAE,MAAM,CAAA;CAAC,EACnD,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,OAAO,GAAE,iBAAsC,GAC9C,CAAC,EAAE,EAAE,CAsDP"}

package/dist/stats/similar.js

@@ -0,0 +1,173 @@
+/**
+ * Finding steps that are nearly, but not quite, the same step.
+ *
+ * `I am logged in` and `I'm logged in` are one behaviour written twice, and
+ * they cost two step definitions. Normalisation cannot join them - they
+ * really are different sentences - so they are grouped by how many single
+ * character edits it takes to turn one into the other.
+ *
+ * Edit distance is quadratic in the number of distinct steps, which on a
+ * large suite is millions of comparisons, so two cheap tests run first. Both
+ * are lower bounds on the distance, never overestimates, so a pair they
+ * reject could not have been close enough anyway:
+ *
+ * - two strings are at least as far apart as their lengths differ;
+ * - every edit changes the tally of characters by at most two, so half the
+ *   difference between two tallies is a floor on the distance as well.
+ */
+export const DEFAULT_SIMILARITY = { ratio: 0.85, minLength: 8, maxEdits: 3 };
+/** How many buckets the character tally uses. */
+const TALLY_SIZE = 32;
+/**
+ * A rough tally of the characters in a string.
+ *
+ * Characters share buckets, which can only make two tallies look more alike
+ * than they are - and since the tally is used to rule pairs out, looking more
+ * alike is the safe direction to be wrong in.
+ */
+function tally(text) {
+    const counts = new Array(TALLY_SIZE).fill(0);
+    for (let index = 0; index < text.length; index++) {
+        const bucket = text.charCodeAt(index) % TALLY_SIZE;
+        counts[bucket] = (counts[bucket] ?? 0) + 1;
+    }
+    return counts;
+}
+/**
+ * True when two tallies are far enough apart that no run of `limit` edits
+ * could join the strings behind them.
+ *
+ * This is the test almost every pair fails, so it stops as soon as the answer
+ * is settled rather than finishing the count.
+ */
+function tallyRulesOut(left, right, limit) {
+    const budget = limit * 2;
+    let sum = 0;
+    for (let bucket = 0; bucket < TALLY_SIZE; bucket++) {
+        sum += Math.abs((left[bucket] ?? 0) - (right[bucket] ?? 0));
+        if (sum > budget) {
+            return true;
+        }
+    }
+    return false;
+}
+/**
+ * The Levenshtein distance between two strings, giving up as soon as it is
+ * certain to exceed `limit` and returning `limit + 1` in that case.
+ *
+ * Every value in a row of the table is a lower bound on everything below it,
+ * so once the whole row is past the limit there is no way back.
+ */
+export function boundedEditDistance(left, right, limit) {
+    if (left === right) {
+        return 0;
+    }
+    if (Math.abs(left.length - right.length) > limit) {
+        return limit + 1;
+    }
+    const width = right.length;
+    let previous = Array.from({ length: width + 1 }, (_, index) => index);
+    let current = new Array(width + 1).fill(0);
+    for (let row = 1; row <= left.length; row++) {
+        current[0] = row;
+        let rowMinimum = row;
+        const leftCharacter = left.charCodeAt(row - 1);
+        for (let column = 1; column <= width; column++) {
+            const substitution = (previous[column - 1] ?? 0) + (leftCharacter === right.charCodeAt(column - 1) ? 0 : 1);
+            const deletion = (previous[column] ?? 0) + 1;
+            const insertion = (current[column - 1] ?? 0) + 1;
+            const best = Math.min(substitution, deletion, insertion);
+            current[column] = best;
+            if (best < rowMinimum) {
+                rowMinimum = best;
+            }
+        }
+        if (rowMinimum > limit) {
+            return limit + 1;
+        }
+        const finished = previous;
+        previous = current;
+        current = finished;
+    }
+    return previous[width] ?? limit + 1;
+}
+/** Disjoint sets, used to join pairs of close steps into groups. */
+function makeSets(size) {
+    const parent = Array.from({ length: size }, (_, index) => index);
+    function find(item) {
+        let root = item;
+        while ((parent[root] ?? root) !== root) {
+            root = parent[root] ?? root;
+        }
+        let walk = item;
+        while ((parent[walk] ?? walk) !== root) {
+            const next = parent[walk] ?? walk;
+            parent[walk] = root;
+            walk = next;
+        }
+        return root;
+    }
+    return {
+        find,
+        union(a, b) {
+            const rootA = find(a);
+            const rootB = find(b);
+            if (rootA !== rootB) {
+                parent[rootB] = rootA;
+            }
+        },
+    };
+}
+/**
+ * Groups entries whose text is close enough to be the same step written two
+ * ways. Entries that are close to nothing are left out, so every group
+ * returned has at least two members, in the order they were given in.
+ */
+export function groupSimilar(entries, options = DEFAULT_SIMILARITY) {
+    // Sorting by length lets the search stop early: once two steps are too
+    // different in length, every step after this one is longer still.
+    const candidates = entries
+        .map((entry, index) => ({ index, text: entry.text, tally: tally(entry.text) }))
+        .filter((candidate) => candidate.text.length >= options.minLength)
+        .sort((a, b) => a.text.length - b.text.length);
+    const sets = makeSets(entries.length);
+    let joined = false;
+    for (let i = 0; i < candidates.length; i++) {
+        const left = candidates[i];
+        for (let j = i + 1; j < candidates.length; j++) {
+            const right = candidates[j];
+            const limit = Math.min(options.maxEdits, Math.floor((1 - options.ratio) * right.text.length));
+            // Sorted by length, so once a step is too much longer than this one,
+            // every step after it is longer still.
+            if (right.text.length - left.text.length > limit) {
+                break;
+            }
+            if (limit < 1 || tallyRulesOut(left.tally, right.tally, limit)) {
+                continue;
+            }
+            if (boundedEditDistance(left.text, right.text, limit) <= limit) {
+                sets.union(left.index, right.index);
+                joined = true;
+            }
+        }
+    }
+    if (!joined) {
+        return [];
+    }
+    const groups = new Map();
+    for (const candidate of candidates) {
+        const root = sets.find(candidate.index);
+        const member = { index: candidate.index, entry: entries[candidate.index] };
+        const group = groups.get(root);
+        if (group === undefined) {
+            groups.set(root, [member]);
+        }
+        else {
+            group.push(member);
+        }
+    }
+    return [...groups.values()]
+        .filter((group) => group.length > 1)
+        .map((group) => group.sort((a, b) => a.index - b.index).map((member) => member.entry));
+}
+//# sourceMappingURL=similar.js.map

package/dist/stats/similar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similar.js","sourceRoot":"","sources":["../../src/stats/similar.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AA6BH,MAAM,CAAC,MAAM,kBAAkB,GAAsB,EAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAC,CAAC;AAE9F,iDAAiD;AACjD,MAAM,UAAU,GAAG,EAAE,CAAC;AAEtB;;;;;;GAMG;AACH,SAAS,KAAK,CAAC,IAAY;IACzB,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,IAAuB,EAAE,KAAwB,EAAE,KAAa;IACrF,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;QACnD,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,KAAa,EAAE,KAAa;IAC5E,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;QACjD,OAAO,KAAK,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,IAAI,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;IACpE,IAAI,OAAO,GAAG,IAAI,KAAK,CAAS,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;QAC5C,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACjB,IAAI,UAAU,GAAG,GAAG,CAAC;QACrB,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAE/C,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC;YAC/C,MAAM,YAAY,GAChB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,KAAK,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzF,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACzD,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;YACvB,IAAI,IAAI,GAAG,UAAU,EAAE,CAAC;gBACtB,UAAU,GAAG,IAAI,CAAC;YACpB,CAAC;QACH,CAAC;QAED,IAAI,UAAU,GAAG,KAAK,EAAE,CAAC;YACvB,OAAO,KAAK,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,MAAM,QAAQ,GAAG,QAAQ,CAAC;QAC1B,QAAQ,GAAG,OAAO,CAAC;QACnB,OAAO,GAAG,QAAQ,CAAC;IACrB,CAAC;IAED,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;AACtC,CAAC;AAED,oEAAoE;AACpE,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,IAAI,EAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;IAE/D,SAAS,IAAI,CAAC,IAAY;QACxB,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACvC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAC9B,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI;QACJ,KAAK,CAAC,CAAC,EAAE,CAAC;YACR,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;gBACpB,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAqB,EACrB,OAAO,GAAsB,kBAAkB;IAE/C,uEAAuE;IACvE,kEAAkE;IAClE,MAAM,UAAU,GAAG,OAAO;SACvB,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAC,CAAC,CAAC;SAC5E,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC;SACjE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEjD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,MAAM,GAAG,KAAK,CAAC;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,OAAO,CAAC,QAAQ,EAChB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CACpD,CAAC;YAEF,qEAAqE;YACrE,uCAAuC;YACvC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;gBACjD,MAAM;YACR,CAAC;YACD,IAAI,KAAK,GAAG,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/D,SAAS;YACX,CAAC;YACD,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;gBAC/D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpC,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuC,CAAC;IAC9D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,EAAC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,KAAK,CAAE,EAAC,CAAC;QAC1E,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;SACxB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;SACnC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AAC3F,CAAC"}

package/dist/stats/types.d.ts

@@ -0,0 +1,159 @@
+/**
+ * The shape of a statistics run.
+ *
+ * Everything here is complete: no list is cut short, no number is rounded to
+ * fit a screen. Trimming is the formatters' job, so that the JSON output is a
+ * full dataset - one a later run can be compared against - while the text
+ * report stays short enough to read.
+ */
+/** A summary of a set of counts, for numbers whose average hides the shape. */
+export interface Distribution {
+    /** How many values went into the summary. */
+    count: number;
+    min: number;
+    median: number;
+    /** The value nine tenths of the set are at or below. */
+    p90: number;
+    max: number;
+    mean: number;
+}
+/** One scenario, named well enough to go and find it. */
+export interface ScenarioRef {
+    name: string;
+    file: string;
+    line: number;
+    /** Steps written in the scenario itself, Background steps excluded. */
+    steps: number;
+}
+/** One entry of the step vocabulary: a normalised step and where it is used. */
+export interface StepEntry {
+    /** The step text after normalisation - what makes two steps "the same". */
+    text: string;
+    /** How many written steps normalise to this text. */
+    count: number;
+    /** The step text as somebody actually wrote it, the first time it appears. */
+    example: string;
+    /** Where that first sighting is. */
+    file: string;
+    line: number;
+}
+/** Normalised steps that differ only slightly from each other. */
+export interface SimilarGroup {
+    /** The steps in the group, most used first. */
+    members: StepEntry[];
+    /** Written steps covered by the whole group. */
+    total: number;
+}
+/** How often a tag is written. */
+export interface TagEntry {
+    name: string;
+    count: number;
+}
+/** A file the Gherkin parser refused, and so could not be counted. */
+export interface UnreadableFile {
+    file: string;
+    /** The parser's complaint, or the rule name it maps onto. */
+    reason: string;
+    line: number;
+}
+/** How many files were written in each Gherkin dialect. */
+export interface LanguageEntry {
+    /** The Gherkin language code, such as `en` or `de`. */
+    code: string;
+    files: number;
+}
+/** What is in the feature files, counted. */
+export interface Inventory {
+    features: number;
+    rules: number;
+    backgrounds: number;
+    /** Scenarios that are not Scenario Outlines. */
+    scenarios: number;
+    scenarioOutlines: number;
+    examplesTables: number;
+    /** Body rows across every Examples table; header rows are not counted. */
+    examplesRows: number;
+    /** Steps as written, Background steps included. */
+    steps: number;
+    dataTables: number;
+    docStrings: number;
+}
+/** How the steps of the suite divide between Given, When and Then. */
+export interface KeywordMix {
+    given: number;
+    when: number;
+    then: number;
+    /**
+     * Steps whose keyword resolves to nothing: an `And` or `But` written before
+     * anything for it to carry on from.
+     */
+    other: number;
+}
+/** What the steps of the suite look like taken together. */
+export interface StepStats {
+    /** Steps as written, Background steps included. */
+    total: number;
+    /** Distinct steps after normalisation. */
+    unique: number;
+    /**
+     * `unique / total`. Low means the team shares a vocabulary; high means
+     * everybody invents their own phrasing, and the step definitions rot.
+     */
+    uniqueRatio: number;
+    /** Distinct steps written exactly once - usually accidental one-offs. */
+    usedOnce: number;
+    /** Every distinct step, most used first. */
+    vocabulary: StepEntry[];
+    /** Steps that are nearly, but not quite, each other. */
+    similar: SimilarGroup[];
+    /** Given/When/Then mix, with `And` and `But` resolved to what they follow. */
+    keywords: KeywordMix;
+    /** Words per step, as a proxy for how detailed the steps have become. */
+    wordsPerStep: Distribution;
+}
+/** What the scenarios of the suite look like taken together. */
+export interface ScenarioStats {
+    /**
+     * The number of test cases: one per Scenario, and one per row of every
+     * Examples table. This is the number that predicts how long a suite takes
+     * to run, and almost nobody's mental count of it is right.
+     */
+    effective: number;
+    /** Steps per scenario, Background steps excluded. */
+    stepsPerScenario: Distribution;
+    /** Every scenario, longest first. */
+    largest: ScenarioRef[];
+}
+/** What the tags of the suite look like taken together. */
+export interface TagStats {
+    /** Tags as written, counting a tag once for every node carrying it. */
+    total: number;
+    unique: number;
+    /** Every distinct tag, most used first. */
+    vocabulary: TagEntry[];
+    /** Tags written exactly once - very often a typo of one written often. */
+    usedOnce: string[];
+    /**
+     * Scenarios carrying no tag of their own and inheriting none, and so
+     * reachable by no tag expression.
+     */
+    untaggedScenarios: number;
+}
+/** Everything one statistics run found. */
+export interface Statistics {
+    files: {
+        /** Files the search matched. */
+        total: number;
+        /** Files the parser accepted, and so the ones every other number is from. */
+        parsed: number;
+        /** Files the parser refused. Nothing in them is counted. */
+        unreadable: UnreadableFile[];
+    };
+    inventory: Inventory;
+    scenarios: ScenarioStats;
+    steps: StepStats;
+    tags: TagStats;
+    /** Dialects in use, most common first. A single stray entry is a bug. */
+    languages: LanguageEntry[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/stats/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/stats/types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,+EAA+E;AAC/E,MAAM,WAAW,YAAY;IAC3B,6CAA6C;IAC7C,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,wDAAwD;IACxD,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CACd;AAED,yDAAyD;AACzD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,uEAAuE;IACvE,KAAK,EAAE,MAAM,CAAC;CACf;AAED,gFAAgF;AAChF,MAAM,WAAW,SAAS;IACxB,2EAA2E;IAC3E,IAAI,EAAE,MAAM,CAAC;IACb,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,OAAO,EAAE,MAAM,CAAC;IAChB,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd;AAED,kEAAkE;AAClE,MAAM,WAAW,YAAY;IAC3B,+CAA+C;IAC/C,OAAO,EAAE,SAAS,EAAE,CAAC;IACrB,gDAAgD;IAChD,KAAK,EAAE,MAAM,CAAC;CACf;AAED,kCAAkC;AAClC,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED,sEAAsE;AACtE,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,6DAA6D;IAC7D,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACd;AAED,2DAA2D;AAC3D,MAAM,WAAW,aAAa;IAC5B,uDAAuD;IACvD,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED,6CAA6C;AAC7C,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,gDAAgD;IAChD,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,0EAA0E;IAC1E,YAAY,EAAE,MAAM,CAAC;IACrB,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,sEAAsE;AACtE,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED,4DAA4D;AAC5D,MAAM,WAAW,SAAS;IACxB,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,MAAM,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,yEAAyE;IACzE,QAAQ,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,wDAAwD;IACxD,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,8EAA8E;IAC9E,QAAQ,EAAE,UAAU,CAAC;IACrB,yEAAyE;IACzE,YAAY,EAAE,YAAY,CAAC;CAC5B;AAED,gEAAgE;AAChE,MAAM,WAAW,aAAa;IAC5B;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB,qDAAqD;IACrD,gBAAgB,EAAE,YAAY,CAAC;IAC/B,qCAAqC;IACrC,OAAO,EAAE,WAAW,EAAE,CAAC;CACxB;AAED,2DAA2D;AAC3D,MAAM,WAAW,QAAQ;IACvB,uEAAuE;IACvE,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,2CAA2C;IAC3C,UAAU,EAAE,QAAQ,EAAE,CAAC;IACvB,0EAA0E;IAC1E,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB;;;OAGG;IACH,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,2CAA2C;AAC3C,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE;QACL,gCAAgC;QAChC,KAAK,EAAE,MAAM,CAAC;QACd,6EAA6E;QAC7E,MAAM,EAAE,MAAM,CAAC;QACf,4DAA4D;QAC5D,UAAU,EAAE,cAAc,EAAE,CAAC;KAC9B,CAAC;IACF,SAAS,EAAE,SAAS,CAAC;IACrB,SAAS,EAAE,aAAa,CAAC;IACzB,KAAK,EAAE,SAAS,CAAC;IACjB,IAAI,EAAE,QAAQ,CAAC;IACf,yEAAyE;IACzE,SAAS,EAAE,aAAa,EAAE,CAAC;CAC5B"}

package/dist/stats/types.js

@@ -0,0 +1,10 @@
+/**
+ * The shape of a statistics run.
+ *
+ * Everything here is complete: no list is cut short, no number is rounded to
+ * fit a screen. Trimming is the formatters' job, so that the JSON output is a
+ * full dataset - one a later run can be compared against - while the text
+ * report stays short enough to read.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/stats/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/stats/types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "gurkencheck",
-  "version": "0.0.6",
+  "version": "0.0.7",
   "description": "A Gherkin linter/validator written in TypeScript, with no build step beyond tsc",
   "keywords": [
     "gherkin",