4 ms·
Do you perhaps happen to have a link to the results of these benchmarks? I'm desperately looking for some, and http://lh3lh3.users.sourceforge.net/reb.shtml htt
by pettou 10y ago
Do you perhaps happen to have a link to the results of these benchmarks? I'm desperately looking for some, and http://lh3lh3.users.sourceforge.net/reb.shtml http://lh3lh3.users.sourceforge.net/reb.shtml seems to be quite date.
And, impressive work on the regex engine!
- burntsushi 10y agoThe benchmarks aren't quite ready to be widely disseminated yet. With that said, I do record benchmarks from time to time in the repo to track progress, which you can see here: https://github.com/rust-lang-nursery/regex/tree/master/bench/log/04 https://github.com/rust-lang-nursery/regex/tree/master/bench... --- You'll have to do the comparison yourself though. There is some analysis---only for Rust's regex engine---with the definition of the benchmarks themselves: https://github.com/rust-lang-nursery/regex/blob/master/bench/src/sherlock.rs https://github.com/rust-lang-nursery/regex/blob/master/bench... (If you fish around there, you'll also see how everything is wired up.) My plan at the moment is to publish something more comprehensive, but it will take time. And yes, the benchmarks you linked are not only outdated, but misleading, and parts of the conclusion I do not agree with. It also doesn't include PCRE2, which is very fast.
- pettou 10y agoExactly what I was looking for, thanks a lot! Btw., there is also https://github.com/openresty/sregex https://github.com/openresty/sregex which you might find interesting.
- burntsushi 10y agoYup, I've seen that. Haven't had a chance to play with it yet though.