A visual demo of Ruby's lazy enumerator

joyofrails.com

120 points by rossta 4 days ago


afraca - a day ago

When I learned Haskell in college I was blown away by how laziness enables cool things like dealing with infinite lists or more performance even though the UX is exactly the same. (Apparently with Ruby there is the slight hint of adding the lazy method in between)

Later I found out laziness in the whole system by default leads to some difficult issues, which quite a few people seem to agree with. Simon Peyton Jones (Haskell co-creator) apparently has said "The next Haskell will be strict". (https://news.ycombinator.com/item?id=14011943)

adsteel_ - a day ago

Hm, the CSS and JS don't appear to load for me. Not even a <body><html> set of tags in the HTML response.

ryangs - 7 hours ago

Java Streams and Kotlin Sequences provide similar iterator capabilities. Iterators are great for this lazy performance but can sometimes be difficult to debug. Especially if you are nesting many iterators, then extracting the underlying collection can be complicated. But necessary in many workflows.

Syntaf - 2 days ago

Really cool visualization and neat to learn about lazy enumeration!

Excuse me while I go back through my code and make sure I’m using lazy enumeration wherever I’m iterating over large collections….

pansa2 - a day ago

So in Ruby, `map` and `select` are eager-by-default, but you can just write `lazy.map().select()` to make the whole chain lazy? That's really nice - much better than Python 2, which was also eager-by-default and you had to change every function call to make it lazy (`map` => `imap`, `filter` => `ifilter`).

Python 3 changed to being lazy-by-default. I assume that improves CPU/memory usage, but in some cases it does have less predictable behaviour. I can see why Ruby, with its goal of "developer happiness", would choose to retain the predictable behaviour of eager-by-default.

hakunin - a day ago

Lazy enumeration can also save memory, because you aren’t storing entire collections during intermediate steps, and it works with infinite/unknown size collections. Such as streaming data.

Some examples:

I wrote a utility gem a while ago that lets you lazily intersect, union, etc various potentially infinite streams of data. https://github.com/maxim/enum_utils/

I also used lazy enumeration for traversing the wordmap in my no-RAM static storage gem. https://github.com/maxim/wordmap/

thih9 - 2 days ago

Related discussion from yesterday:

https://news.ycombinator.com/item?id=42652775 (different submitter; 29 points, 3 comments)

endorphine - 2 days ago

I was expecting a visual comparison towards the end of the article, where you would be able to click a button and both the eager and lazy versions would start executing simultaneously, one displayed next to the other, and you would clearly see that the lazy one completed earlier. This would make it even more obvious how the lazy one is faster.

Nevertheless, this was great.

lukasb - a day ago

Apparently Typescript doesn’t have anything built-in like this?

Lio - 2 days ago

That's lovely and makes it very obvious what's happening.