How we made Haskell search strings as fast as Rust

Re:How we made Haskell search strings as fast as Rust by orblivion on Wednesday March 13, 2019 @03:27PM (#19382626)

I'm not that versed in Haskell myself, but is this really the case? I would think that expectations for low level optimization and general code are different.

Though, I suppose you could then say that if the rules are different for low level optimization, they may as well have imported an external library written in Rust.

[ Parent | on HN ]

Re:How we made Haskell search strings as fast as Rust by monocasa on Wednesday March 13, 2019 @03:34PM (#19382732)

Optimized Rust feels more idiomatic at least.

[ Parent | on HN ]

Re:How we made Haskell search strings as fast as Rust by LeanderK on Wednesday March 13, 2019 @04:19PM (#19383314)

but I don't think it's a suprise, since rust is made to be fast while haskell is made to be beautiful (for some sense of beautiful)

[ Parent | on HN ]

Re:How we made Haskell search strings as fast as Rust by mseri on Wednesday March 13, 2019 @05:52PM (#19384260)

They explain in the post that they did consider it but decided to avoid it due to the way the FFI and Gc interact (requiring the string to be copied)

[ Parent | on HN ]