News for hackers. Stuff that matters.
Re:How we made Haskell search strings as fast as Rust by eridius on Wednesday March 13, 2019 @06:32PM (#19384621)
Ok so not using a lazy list for matches is basically just around avoiding the requisite allocation? I suppose if you consume the list immediately at the call-site the compiler could in theory after inlining convert it to the closure-based approach for you, but probably wouldn't.

There are no comments on this comment yet.