Performance comparison to other cutting edge regex engines

[dumblob]

trafficstars

Regex engines traditionally have quadratic or higher rather than linear complexity. Therefore it's important to asses their performance.

Would you consider adding comparisons to other widespread regex engines?

I would start with comparison to re2, which is DFA-based (though it doesn't support lookahead and lookbehind, so it's slightly apples and oranges despite re2 also not having any compile-time variant) and therefore provides more or less the upper bound of achievable performance (other techniques like PEGs are faster, but have slightly higher constant factor and are more verbose).

Then I would continue with Oniguruma...