Skip to content

Comment on A visual demo of Ruby's lazy enumeratorparent

Comments

In the worst case, that must have intermediate space requirements equal to the entire collections, right?

I don’t think that can happen because all those functions assume the streams are consistently sorted.

Ohhhhh, nice. Yeah, sorted data is powerful. Thanks for pointing that out.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.