You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Mar 24, 2024. It is now read-only.
Consider using a capture group for positive matches, if the group isn't captured then the match is ignored.
My main concern with this is ensuring that users can't exploit it easily. A lot of care will have to be taken, and limitations should be put on e.g. the length of allowed regexes. Regexes will have to be cached (if regex doesn't do that already) to avoid repetitive compilation costs. Ideally some benchmarks on how fast the current text-based matching is can be compared to regex-based matching, including with very complicated regexes.
The text was updated successfully, but these errors were encountered:
Consider using a capture group for positive matches, if the group isn't captured then the match is ignored.
My main concern with this is ensuring that users can't exploit it easily. A lot of care will have to be taken, and limitations should be put on e.g. the length of allowed regexes. Regexes will have to be cached (if
regex
doesn't do that already) to avoid repetitive compilation costs. Ideally some benchmarks on how fast the current text-based matching is can be compared to regex-based matching, including with very complicated regexes.The text was updated successfully, but these errors were encountered: