How we made Haskell search strings as fast as Rust

Re:How we made Haskell search strings as fast as Rust by burntsushi on Thursday March 14, 2019 @06:59AM (#19388093)

I thought FDR was for single literals only?

One of the hurdles for using the algorithms from Hyperscan is that it's not always clear when particular algorithms are used and in what conditions. I have the same problem in my regex library, but Hyperscan takes it to another level because it's so much more sophisticated. :)

[ Parent | on HN ]

Re:How we made Haskell search strings as fast as Rust by glangdale on Thursday March 14, 2019 @07:08AM (#19388137)

(see other response)

FDR is for > literals than Teddy. It's Noodle that's for single literals. Hard to imagine how you could get confused given that the names we chose are so transparent. :-)

[ Parent | on HN ]

Re:How we made Haskell search strings as fast as Rust by burntsushi on Thursday March 14, 2019 @08:18AM (#19388526)

Hah. I've only made it halfway through your paper so far. Excited to read the rest. :)

[ Parent | on HN ]