How we made Haskell search strings as fast as Rust
Channable shares a post on how they made Haskell search strings as fast as Rust1.
Footnotes
-
How we made Haskell search strings as fast as Rust: In this post, we will describe our quest to create Alfred–Margaret, the fastest Haskell implementation of the Aho–Corasick string searching algorithm, which powers string search in Channable. ⤴