top | item 47169158

(no title)

hollowsolve | 3 days ago

elaborate?

discuss

order

sgt|3 days ago

Look at a fast regex library [1] and take a subset of those tests or benchmarks and apply to match.

[1] https://github.com/intel/hyperscan/tree/master

That could be a fun comparison. As someone mentioned, regular expressions are extremely fast, and have been benchmarked forever.