@procedures/client 0.27.8 → 0.28.0

package/dist/procedures/collection/regex-guard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex-guard.js","sourceRoot":"","sources":["../../../src/procedures/collection/regex-guard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAcH,8EAA8E;AAC9E,MAAM,QAAQ,GAAG,IAAI,CAAC;AAEtB,MAAM,GAAG,GAAY,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AACnD,MAAM,KAAK,GAA4B,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AACtD,MAAM,IAAI,GAA4B,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC/F,MAAM,KAAK,GAA4B;IACrC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;IAC5E,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;CACzF,CAAC;AACF,MAAM,eAAe,GAA2B,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;AAE7F,+FAA+F;AAC/F,SAAS,MAAM,CAAC,MAAgD,EAAE,UAAmB;IACnF,MAAM,MAAM,GAAqC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC7D,IAAI,CAAC,UAAU;QAAE,OAAO,MAAM,CAAC;IAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,CAAU,EAAE,CAAC;YACnF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7B,IAAI,KAAK,IAAI,GAAG;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,mEAAmE;AACnE,SAAS,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAA4B,EAAE,MAAgD;IACpG,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACjE,IAAI,IAAI,GAAG,IAAI;YAAE,MAAM;QACvB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9B,IAAI,IAAI,GAAG,EAAE;YAAE,OAAO,IAAI,CAAC;IAC7B,CAAC;IACD,OAAO,IAAI,GAAG,EAAE,CAAC;AACnB,CAAC;AAED,sDAAsD;AACtD,SAAS,QAAQ,CAAC,CAAU,EAAE,CAAU;IACtC,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IACxC,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC;IACxH,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED,iIAAiI;AACjI,SAAS,KAAK,CAAC,OAAe,EAAE,UAAmB;IACjD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,GAAG,CAAC,MAAgD,EAAE,OAAO,GAAG,KAAK,EAAW,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9I,MAAM,IAAI,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAE5D,gFAAgF;IAChF,MAAM,WAAW,GAAG,GAAW,EAAE;QAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC;QACnC,IAAI,IAAI,IAAI,eAAe;YAAE,OAAO,eAAe,CAAC,IAAI,CAAE,CAAC;QAC3D,IAAI,IAAI,KAAK,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC9D,EAAE,IAAI,CAAC,CAAC;YACR,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,qBAAqB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,IAAI,MAAM,EAAE,CAAC;gBACX,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACvB,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAC;gBAC7C,OAAO,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAClE,CAAC;YACD,IAAI,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC9C,EAAE,IAAI,CAAC,CAAC;gBACR,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,IAAI,IAAI,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,OAAO,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;QAC9F,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,sGAAsG;IACtG,MAAM,WAAW,GAAG,GAAwB,EAAE;QAC5C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7I,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,EAAE,EAAE,CAAC;YACL,OAAO,GAAG,CAAC,MAAM,EAAE,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjC,EAAE,EAAE,CAAC;YACL,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;gBACxB,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACrC,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,GAAY,EAAE;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC;QACpC,IAAI,OAAO;YAAE,EAAE,EAAE,CAAC;QAClB,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,MAAM,GAAG,GAAuB,EAAE;YACtC,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI;gBAAE,OAAO,OAAO,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1D,EAAE,EAAE,CAAC;YACL,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;YAC7B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,wEAAwE;gBACxE,IAAI,MAAM,CAAC,OAAO;oBAAE,OAAO,GAAG,IAAI,CAAC;;oBAC9B,MAAM,CAAC,IAAI,CAAC,GAAI,MAAM,CAAC,MAAkC,CAAC,CAAC;gBAChE,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;gBACxB,EAAE,EAAE,CAAC;gBACL,OAAO,CAAC,CAAC;YACX,CAAC;YACD,OAAO,WAAW,EAAE,CAAC;QACvB,CAAC,CAAC;QACF,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;YAClD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC;YACrB,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAChC,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC9E,EAAE,EAAE,CAAC;gBACL,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC;gBACtB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;oBACtC,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1D,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,EAAE,EAAE,CAAC;QACL,IAAI,OAAO;YAAE,OAAO,GAAG,CAAC;QACxB,OAAO,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,GAAc,EAAE;QAChC,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,CAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjB,IAAI,KAAK,GAAG,IAAI,CAAC;YACjB,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,CAAU,EAAE,CAAC;gBACrH,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACnC,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC;oBACpB,KAAK,GAAG,CAAC,SAAS,CAAC;oBACnB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,KAAK,IAAI,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC1C,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACrC,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,KAAK,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;gBACxC,uCAAuC;gBACvC,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACvC,EAAE,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;YACjD,CAAC;YACD,MAAM,QAAQ,GAAG,iBAAiB,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG;gBAAE,EAAE,EAAE,CAAC;YAC9B,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAC5E,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACnE,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACpF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;YAC7B,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAC9E,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;gBACjC,EAAE,EAAE,CAAC;gBACL,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YACpD,CAAC;YACD,+DAA+D;YAC/D,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7C,OAAO,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;oBAAE,EAAE,EAAE,CAAC;gBAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YACnD,CAAC;YACD,IAAI,IAAI,KAAK,GAAG,IAAI,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACrC,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YACnD,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACnE,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACxE,CAAC,CAAC;IAEF,uGAAuG;IACvG,MAAM,eAAe,GAAG,GAA6C,EAAE;QACrE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,MAAgD,CAAC;QACrD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;aAChD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;aACrD,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QACnD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,EAAE,EAAE,CAAC;QACP,CAAC;aAAM,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,qBAAqB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9D,IAAI,OAAO,KAAK,IAAI;gBAAE,OAAO,SAAS,CAAC;YACvC,EAAE,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACxB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5G,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG;YAAE,EAAE,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,iBAAiB,GAAG,GAAkB,EAAE;QAC5C,MAAM,QAAQ,GAAkB,CAAC,EAAE,CAAC,CAAC;QACrC,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;YAClD,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;gBACxB,EAAE,EAAE,CAAC;gBACL,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAG,SAAS,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;YACjC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;QAC/G,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC;IAEF,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB,EAAE,CAAC,CAAC;QACjC,oEAAoE;QACpE,EAAE,EAAE,CAAC;IACP,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iIAAiI;AACjI,SAAS,OAAO,CAAC,MAA4B;IAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACnC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/D,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9E,IAAI,CAAC,IAAI,CAAC,KAAK;QAAE,OAAO,GAAG,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,OAAO,GAAG,CAAC;IAChD,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACvE,CAAC;AAcD,yEAAyE;AACzE,SAAS,OAAO,CAAC,KAA2B,EAAE,IAAU;IACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC1B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACrB,IAAI,IAAI,CAAC,GAAG,KAAK,QAAQ;oBAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACjD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACxC,CAAC;YACD,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC1C,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBAAE,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;YAC1H,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ;gBAAE,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,SAAS,SAAS,CAAC,KAA2B;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC1B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACnC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;gBAClC,IAAI,OAAO,KAAK,SAAS;oBAAE,OAAO,OAAO,CAAC;YAC5C,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QACrC,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAS,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACnF,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,SAAS;gBAAE,OAAO,8CAA8C,CAAC;YAC1E,iFAAiF;YACjF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,KAAK,QAAQ,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,QAAQ,CAAC;YACxE,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,GAAG;gBAAE,OAAO,0EAA0E,CAAC;YAC5G,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,GAAG;gBAAE,OAAO,sDAAsD,CAAC;QAC3F,CAAC;QACD,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACvC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,OAAO,CAAC;IAC5C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe,EAAE,KAAK,GAAG,EAAE;IAC1D,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAC/D,CAAC"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "$schema": "https://json.schemastore.org/package",
   "name": "@procedures/client",
-  "version": "0.27.8",
+  "version": "0.28.0",
   "description": "Procedures as data for TypeScript: define typed procedures once and call them in process, over HTTP, WebSocket, the CLI or MCP. Streaming, middleware, retries, caching and a JSON program format.",
   "keywords": [
     "rpc",

package/src/procedures/collection/query.ts

@@ -46,6 +46,8 @@ export {
   versionConflictsOf,
 } from "./precondition.js";
 export type { CurrentItem, VersionConflict, VersionOf } from "./precondition.js";
+// The guard of $regex has no imports either
+import { exponentialRegex } from "./regex-guard.js";
 
 //
 // ═══ The types ═══
@@ -458,52 +460,6 @@ function withinDepth(depth: number, at: string, compilation: Compilation): boole
   return false;
 }
 
-/**
- * True when a pattern repeats a group that repeats without a bound, for example `(a+)+` or
- * `(a|b*)*`. Such a pattern can take an exponential time on a long text.
- */
-function repeatsRepetition(pattern: string): boolean {
-  // For each open group: true when it holds a repetition without a bound
-  const groups: boolean[] = [];
-  let lastGroupRepeats = false;
-  let inClass = false;
-  for (let index = 0; index < pattern.length; index++) {
-    const char = pattern[index]!;
-    if (char === "\\") {
-      index++;
-      lastGroupRepeats = false;
-      continue;
-    }
-    if (inClass) {
-      if (char === "]") inClass = false;
-      continue;
-    }
-    if (char === "[") {
-      inClass = true;
-      lastGroupRepeats = false;
-      continue;
-    }
-    if (char === "(") {
-      groups.push(false);
-      lastGroupRepeats = false;
-      continue;
-    }
-    if (char === ")") {
-      lastGroupRepeats = groups.pop() ?? false;
-      // A group that holds a repetition makes each group around it hold one too
-      if (lastGroupRepeats && groups.length > 0) groups[groups.length - 1] = true;
-      continue;
-    }
-    const unbounded = char === "*" || char === "+" || (char === "{" && /^\{\d*,\}/.test(pattern.slice(index)));
-    if (unbounded) {
-      if (lastGroupRepeats) return true;
-      if (groups.length > 0) groups[groups.length - 1] = true;
-    }
-    if (char !== "?") lastGroupRepeats = false;
-  }
-  return false;
-}
-
 //
 // ═══ The compiler of a selector ═══
 //
@@ -666,8 +622,11 @@ function regexOf(pattern: unknown, flags: unknown, at: string, compilation: Comp
     problems.push(`${at}.$options has the flag ${refused.join(", ")}, and the query policy permits only "${limits.regexFlags}"`);
     return undefined;
   }
-  if (repeatsRepetition(pattern)) {
-    problems.push(`${at}.$regex repeats a group that repeats without a bound: such a pattern can take an exponential time`);
+  // The guard reads the pattern with its flags. (Before, it found only a repeated group with an
+  // unbounded repetition inside, not (a|aa)+ or (a{1,50}){1,50}: audit O56.)
+  const risk = exponentialRegex(pattern, typeof flags === "string" ? flags : "");
+  if (risk !== undefined) {
+    problems.push(`${at}.$regex ${risk}: such a pattern can take an exponential time`);
     return undefined;
   }
   try {

package/src/procedures/collection/regex-guard.ts

@@ -0,0 +1,333 @@
+/**
+ * The guard of `$regex` against patterns that can take an exponential time in a backtracking
+ * engine such as V8. It reads the pattern, and it refuses a group that repeats when the group can
+ * match the same text in more than one way:
+ *
+ * - The group holds a repetition of variable length: `(a+)+`, `(a{2,3})+`, `(a?a?)+`.
+ * - The group holds alternatives that can start with the same character: `(a|a)*`, `(a|aa)+`.
+ *
+ * A group with a bounded repetition passes when the number of its ways to match is small, for
+ * example `(\d{1,3}\.){3}`. The guard does not find each polynomial pattern, for example `\s*\s*$`.
+ * A host keeps `maxRegexLength` small for callers that it does not trust.
+ */
+
+/** A set of UTF-16 code units: the ranges, or each code unit outside them when `negated`. */
+interface CharSet {
+  readonly ranges: ReadonlyArray<readonly [number, number]>;
+  readonly negated: boolean;
+}
+
+/** One part of a pattern. */
+type RegexNode =
+  | { readonly kind: "atom"; readonly first: CharSet; readonly width: boolean }
+  | { readonly kind: "group"; readonly branches: RegexNode[][]; readonly width: boolean }
+  | { readonly kind: "repeat"; readonly node: RegexNode; readonly min: number; readonly max: number };
+
+/** The most ways to match that a group with a bounded repetition can have. */
+const MAX_WAYS = 1000;
+
+const ANY: CharSet = { ranges: [], negated: true };
+const DIGIT: Array<[number, number]> = [[0x30, 0x39]];
+const WORD: Array<[number, number]> = [[0x30, 0x39], [0x41, 0x5a], [0x5f, 0x5f], [0x61, 0x7a]];
+const SPACE: Array<[number, number]> = [
+  [0x09, 0x0d], [0x20, 0x20], [0xa0, 0xa0], [0x1680, 0x1680], [0x2000, 0x200a],
+  [0x2028, 0x2029], [0x202f, 0x202f], [0x205f, 0x205f], [0x3000, 0x3000], [0xfeff, 0xfeff],
+];
+const CONTROL_ESCAPES: Record<string, number> = { t: 9, n: 10, v: 11, f: 12, r: 13, "0": 0 };
+
+/** With the flag `i`, each ASCII letter of a range also gives the letter of the other case. */
+function folded(ranges: ReadonlyArray<readonly [number, number]>, ignoreCase: boolean): Array<readonly [number, number]> {
+  const result: Array<readonly [number, number]> = [...ranges];
+  if (!ignoreCase) return result;
+  for (const [lo, hi] of ranges) {
+    for (const [from, to, shift] of [[0x41, 0x5a, 0x20], [0x61, 0x7a, -0x20]] as const) {
+      const start = Math.max(lo, from);
+      const end = Math.min(hi, to);
+      if (start <= end) result.push([start + shift, end + shift]);
+    }
+  }
+  return result;
+}
+
+/** True when each code unit of a range is in one of the ranges. */
+function covered([lo, hi]: readonly [number, number], ranges: ReadonlyArray<readonly [number, number]>): boolean {
+  let next = lo;
+  for (const [from, to] of [...ranges].sort((a, b) => a[0] - b[0])) {
+    if (from > next) break;
+    next = Math.max(next, to + 1);
+    if (next > hi) return true;
+  }
+  return next > hi;
+}
+
+/** True when two sets can have the same code unit. */
+function overlaps(a: CharSet, b: CharSet): boolean {
+  if (a.negated && b.negated) return true;
+  if (!a.negated && !b.negated) return a.ranges.some(([lo, hi]) => b.ranges.some(([from, to]) => lo <= to && from <= hi));
+  const [positive, negative] = a.negated ? [b, a] : [a, b];
+  return positive.ranges.some((range) => !covered(range, negative.ranges));
+}
+
+/** This function reads a pattern into parts. A construct that it does not know becomes an atom that can match each character. */
+function parse(pattern: string, ignoreCase: boolean): RegexNode[][] {
+  let at = 0;
+  const set = (ranges: ReadonlyArray<readonly [number, number]>, negated = false): CharSet => ({ ranges: folded(ranges, ignoreCase), negated });
+  const unit = (code: number): CharSet => set([[code, code]]);
+
+  /** The code unit of an escape that names one character, after the backslash. */
+  const escapedCode = (): number => {
+    const char = pattern[at++] ?? "\\";
+    if (char in CONTROL_ESCAPES) return CONTROL_ESCAPES[char]!;
+    if (char === "x" && /^[0-9a-fA-F]{2}/.test(pattern.slice(at))) {
+      at += 2;
+      return Number.parseInt(pattern.slice(at - 2, at), 16);
+    }
+    if (char === "u") {
+      const braced = /^\{([0-9a-fA-F]+)\}/.exec(pattern.slice(at));
+      if (braced) {
+        at += braced[0].length;
+        const code = Number.parseInt(braced[1]!, 16);
+        return code > 0xffff ? 0xd800 + ((code - 0x10000) >> 10) : code;
+      }
+      if (/^[0-9a-fA-F]{4}/.test(pattern.slice(at))) {
+        at += 4;
+        return Number.parseInt(pattern.slice(at - 4, at), 16);
+      }
+    }
+    if (char === "c" && /^[a-zA-Z]/.test(pattern.slice(at))) return pattern.charCodeAt(at++) % 32;
+    return char.charCodeAt(0);
+  };
+
+  /** The set of a class escape (`\d`, `\W`), or undefined for another escape. The backslash is read. */
+  const classEscape = (): CharSet | undefined => {
+    const char = pattern[at];
+    const ranges = char === "d" || char === "D" ? DIGIT : char === "w" || char === "W" ? WORD : char === "s" || char === "S" ? SPACE : undefined;
+    if (ranges !== undefined) {
+      at++;
+      return set(ranges, char === "D" || char === "W" || char === "S");
+    }
+    if (char === "p" || char === "P") {
+      at++;
+      if (pattern[at] === "{") {
+        const end = pattern.indexOf("}", at);
+        at = end === -1 ? pattern.length : end + 1;
+      }
+      return ANY;
+    }
+    return undefined;
+  };
+
+  const parseClass = (): CharSet => {
+    const negated = pattern[at] === "^";
+    if (negated) at++;
+    const ranges: Array<[number, number]> = [];
+    let unknown = false;
+    const member = (): number | undefined => {
+      if (pattern[at] !== "\\") return pattern.charCodeAt(at++);
+      at++;
+      const escape = classEscape();
+      if (escape !== undefined) {
+        // A negated escape in a class, or a property: the set is not known here
+        if (escape.negated) unknown = true;
+        else ranges.push(...(escape.ranges as Array<[number, number]>));
+        return undefined;
+      }
+      if (pattern[at] === "b") {
+        at++;
+        return 8;
+      }
+      return escapedCode();
+    };
+    while (at < pattern.length && pattern[at] !== "]") {
+      const low = member();
+      if (low === undefined) continue;
+      if (pattern[at] === "-" && pattern[at + 1] !== "]" && at + 1 < pattern.length) {
+        at++;
+        const high = member();
+        if (high === undefined) {
+          ranges.push([low, low], [0x2d, 0x2d]);
+          continue;
+        }
+        ranges.push([Math.min(low, high), Math.max(low, high)]);
+      } else {
+        ranges.push([low, low]);
+      }
+    }
+    at++;
+    if (unknown) return ANY;
+    return set(ranges, negated);
+  };
+
+  const parseAtom = (): RegexNode => {
+    const char = pattern[at++]!;
+    if (char === "(") {
+      let width = true;
+      for (const [prefix, zeroWidth] of [["?:", false], ["?=", true], ["?!", true], ["?<=", true], ["?<!", true]] as const) {
+        if (pattern.startsWith(prefix, at)) {
+          at += prefix.length;
+          width = !zeroWidth;
+          break;
+        }
+      }
+      if (width && pattern.startsWith("?<", at)) {
+        const end = pattern.indexOf(">", at);
+        at = end === -1 ? pattern.length : end + 1;
+      } else if (width && pattern[at] === "?") {
+        // A modifier group, for example (?i:x)
+        const colon = pattern.indexOf(":", at);
+        at = colon === -1 ? pattern.length : colon + 1;
+      }
+      const branches = parseAlternatives();
+      if (pattern[at] === ")") at++;
+      return { kind: "group", branches, width };
+    }
+    if (char === "[") return { kind: "atom", first: parseClass(), width: true };
+    if (char === ".") return { kind: "atom", first: ANY, width: true };
+    if (char === "^" || char === "$") return { kind: "atom", first: ANY, width: false };
+    if (char === "\\") {
+      const escape = classEscape();
+      if (escape !== undefined) return { kind: "atom", first: escape, width: true };
+      const next = pattern[at];
+      if (next === "b" || next === "B") {
+        at++;
+        return { kind: "atom", first: ANY, width: false };
+      }
+      // A back reference matches a text that the guard does not know
+      if (next !== undefined && /[1-9]/.test(next)) {
+        while (/[0-9]/.test(pattern[at] ?? "")) at++;
+        return { kind: "atom", first: ANY, width: true };
+      }
+      if (next === "k" && pattern[at + 1] === "<") {
+        const end = pattern.indexOf(">", at);
+        at = end === -1 ? pattern.length : end + 1;
+        return { kind: "atom", first: ANY, width: true };
+      }
+      return { kind: "atom", first: unit(escapedCode()), width: true };
+    }
+    return { kind: "atom", first: unit(char.charCodeAt(0)), width: true };
+  };
+
+  /** The bounds of a quantifier at the position, or undefined. A lazy quantifier has the same bounds. */
+  const parseQuantifier = (): { min: number; max: number } | undefined => {
+    const char = pattern[at];
+    let bounds: { min: number; max: number } | undefined;
+    if (char === "*") bounds = { min: 0, max: Infinity };
+    else if (char === "+") bounds = { min: 1, max: Infinity };
+    else if (char === "?") bounds = { min: 0, max: 1 };
+    if (bounds !== undefined) {
+      at++;
+    } else if (char === "{") {
+      const counted = /^\{(\d+)(,(\d*))?\}/.exec(pattern.slice(at));
+      if (counted === null) return undefined;
+      at += counted[0].length;
+      const min = Number(counted[1]);
+      bounds = { min, max: counted[2] === undefined ? min : counted[3] === "" ? Infinity : Number(counted[3]) };
+    } else {
+      return undefined;
+    }
+    if (pattern[at] === "?") at++;
+    return bounds;
+  };
+
+  const parseAlternatives = (): RegexNode[][] => {
+    const branches: RegexNode[][] = [[]];
+    while (at < pattern.length && pattern[at] !== ")") {
+      if (pattern[at] === "|") {
+        at++;
+        branches.push([]);
+        continue;
+      }
+      const atom = parseAtom();
+      const bounds = parseQuantifier();
+      branches[branches.length - 1]!.push(bounds === undefined ? atom : { kind: "repeat", node: atom, ...bounds });
+    }
+    return branches;
+  };
+
+  const top: RegexNode[][] = [];
+  while (at < pattern.length) {
+    top.push(...parseAlternatives());
+    // A ")" without its "(": the RegExp constructor refuses the pattern
+    at++;
+  }
+  return top;
+}
+
+/** The characters that a branch can start with. An empty branch, or a start that can be empty, can start with each character. */
+function firstOf(branch: readonly RegexNode[]): CharSet {
+  const node = branch[0];
+  if (node === undefined) return ANY;
+  if (node.kind === "atom") return node.width ? node.first : ANY;
+  if (node.kind === "repeat") return node.min >= 1 ? firstOf([node.node]) : ANY;
+  if (!node.width) return ANY;
+  const sets = node.branches.map(firstOf);
+  if (sets.some((one) => one.negated)) return ANY;
+  return { ranges: sets.flatMap((one) => one.ranges), negated: false };
+}
+
+/** What makes a group match the same text in more than one way. */
+interface Ways {
+  /** A repetition without a bound inside the group. */
+  unbounded: boolean;
+  /** A repetition of variable length inside the group. */
+  variable: boolean;
+  /** Alternatives inside the group that can start with the same character. */
+  overlap: boolean;
+  /** An upper bound of the ways to match one time. */
+  count: number;
+}
+
+/** This function adds the ways of the parts inside a group to `ways`. */
+function collect(nodes: readonly RegexNode[], ways: Ways): void {
+  for (const node of nodes) {
+    if (node.kind === "repeat") {
+      if (node.min !== node.max) {
+        ways.variable = true;
+        if (node.max === Infinity) ways.unbounded = true;
+        ways.count *= node.max - node.min + 1;
+      }
+      collect([node.node], ways);
+    } else if (node.kind === "group") {
+      if (node.branches.length > 1) {
+        ways.count *= node.branches.length;
+        const firsts = node.branches.map(firstOf);
+        if (firsts.some((first, index) => firsts.slice(index + 1).some((other) => overlaps(first, other)))) ways.overlap = true;
+      }
+      for (const branch of node.branches) collect(branch, ways);
+    }
+  }
+}
+
+/** The first problem of a repeated group in the parts, or undefined. */
+function problemOf(nodes: readonly RegexNode[]): string | undefined {
+  for (const node of nodes) {
+    if (node.kind === "group") {
+      for (const branch of node.branches) {
+        const problem = problemOf(branch);
+        if (problem !== undefined) return problem;
+      }
+      continue;
+    }
+    if (node.kind !== "repeat") continue;
+    if (node.max > 1 && node.node.kind === "group") {
+      const ways: Ways = { unbounded: false, variable: false, overlap: false, count: 1 };
+      collect([node.node], ways);
+      if (ways.unbounded) return "repeats a group that repeats without a bound";
+      // A bounded repetition with few ways to match passes, for example (\d{1,3}\.){3}
+      const few = node.max !== Infinity && ways.count ** node.max <= MAX_WAYS;
+      if (ways.overlap && !few) return "repeats a group with alternatives that can start with the same character";
+      if (ways.variable && !few) return "repeats a group with a repetition of variable length";
+    }
+    const problem = problemOf([node.node]);
+    if (problem !== undefined) return problem;
+  }
+  return undefined;
+}
+
+/**
+ * This function gives the reason why a pattern can take an exponential time, or undefined. It
+ * reads the pattern with its flags: with `i`, `a` and `A` are the same character.
+ */
+export function exponentialRegex(pattern: string, flags = ""): string | undefined {
+  return problemOf(parse(pattern, flags.includes("i")).flat());
+}