-
Notifications
You must be signed in to change notification settings - Fork 93
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Default list laziness vs strictness #29
Comments
Yes, I'd thought the same thing. Perhaps instead of (or as well as) you could nominate whether a block used in a sequence is volatile or not/expensive or not and change the caching strategy accordingly. |
Sounds like a full on feature, moving to 1.1.0. |
Hmm. "Laziness by default" is powerful (witness Haskell), but can be expensive when you don't actually need it. |
Another perspective: in Ruby 2.0, all The problem is that some of the methods of If Ruby's Linked lists are still a useful (and functional, persistent) data structure to provide. Though it might make more sense to just make them strict, and use Ruby's built-in As the built-in lazy processing features of Ruby become more developed, methods like I wouldn't want to make any drastic changes to Opinions? |
More thoughts: our lazy lists are far more efficient now than they original were. Will we actually gain any significant performance from making them strict? It would be interesting to benchmark and see. |
The text was updated successfully, but these errors were encountered: