Lazy Ruby
sonnym.github.io
Lazy Ruby
1–6 of 6 posts
Re: Lazy Ruby
#2On a similar theme, I did a blog post a while back on lazy quicksort in Ruby: http://mossity.com/2013/08/17/implementing-a-lazy-quicksort-...
Re: Lazy Ruby
#3I wrote the following blog post a while back on a similar note. ;)
Re: Lazy Ruby
#4I think I would write the fibs expression as
fibs = [true,false].lazy.flat_map{|i| if i then [1,1] else fibs.zip(fibs.drop(1)).map{|a,b| a+b} end}
fibs = inf.map do |n|
if n Re: Lazy Ruby
#5I would memoize with an alias_method wrapper and let it hit a cache_hash before calling the original function. This is a generic pattern that should work for all immutable functions.
http://stackoverflow.com/questions/21790868/simple-aspect-or...
Re: Lazy Ruby
#6I once contrived a Y-Combinator-backed and memoized implementation of fib() in pure C (with the blocks extension for real closures). It was a mess, but it was pretty cool:
http://kswizz.com/post/50429268286/fibonacci-the-y-combinato...