Re:Static search trees: 40x faster than binary search
by amelius on Thursday January 02, 2025 @10:27AM
(#42575241)
You could probably make an even faster regex by JIT-compiling the resulting automaton.
Re:Static search trees: 40x faster than binary search
by burntsushi on Thursday January 02, 2025 @11:23AM
(#42575806)
The benchmarks I linked include multiple regex engines with JITs.
Despite this, it's one of the fastest regex engines around: https://github.com/BurntSushi/rebar#summary-of-search-time-b...
Here's a related but more isolated analysis: https://github.com/burntsushi/rsc-regexp