Nevermind, you can set the cost/max of each: https://laurikari.net/tre/documenta... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

poorcedure on Nov 7, 2018 | parent | context | favorite | on: TRE: A Regex Engine with Approximate Matching

Nevermind, you can set the cost/max of each:

https://laurikari.net/tre/documentation/regaexec/

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact