I'm currently redoing the Project Euler maths problems again in Rust having done many of them in Python and Haskell previously. What thing I am missing from Haskell is the concept of lazy evaluation of lists.
Now I appreciate it doesn't perform as well compared to strict evaluation but curious if there are good, recommended libraries for doing the same with Rust? Or does it go totally against the ethos of the language?
As an example constructing an infinite list of primes that I can filter on.
Thanks for any help!