If you're interested in Rust regex implementations, you may be interested in the one that I wrote in a macro: <a href="https://crates.io/crates/safe-regex" rel="nofollow noreferrer">https://crates.io/crates/safe-regex</a> . At build time, the macro generates the matcher as Rust code. The compiler then compiles and optimizes the matcher code as part of your Rust binary.<p>I wanted to see if it was possible to make a fast Rust regex library without using any unsafe code. It turns out that it is. Russ Cox's paper was very helpful.
I actually had a lot of fun doing this in typescript (though a much simpler not as prod ready version of it) - <a href="https://github.com/panyam/tlex">https://github.com/panyam/tlex</a>
Every time i read about rust requiring you to use indices instead of pointers for some algorithm, i wonder if this isn't just rust forcing you to implement your own memory management, with your own local pointers.