RAA - lazylist/0.2.1

This class implements lazy lists (or streams) for Ruby. Such lists avoid the computation of values which aren’t needed for some computation. So it’s possible to define infinite lists with a limited amount of memory. A value that hasn’t been used yet is calculated on the fly and saved into the list. A value which is used for a second time is computed only once and just read out of memory for the second usage.

Here is a little example that shows how to define the
Fibonacci sequence as a lazy list:

fib = LazyList.tabulate(0) { |x| x < 2 ? 1 : fib[x-2] +
fib[x-1] } # => [1,... ]
fib[5] # => 8
fib # => [1, 1, 2, 3, 5, 8,... ]