RE#: how we built the fastest regex engine in F#

symbolic derivatives and the rust rewrite of RE#

yes, all longest regex matches in linear time is possible

Gzip decompression in 250 lines of Rust

Finding all regex matches has always been O(n²)