Project

lazy_list

0.0
No commit activity in last 3 years
No release in over 3 years
Ruby is not Haskell. It is NOT a functional language and it isn't meant to be lazy, and forcing it to be anything other than Ruby is stupid and inefficient... but that didn't stop me from building an ultra-lazy Ruby2.0 version of the lazy list
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
 Dependencies

Development

~> 1.8.4
~> 3.12
>= 0
 Project Readme

Lazy List for Ruby

SICP-friendly version of the notorious lazy list for Ruby2.0.0.

One of the most badass things about Ruby2.0 is the Enumerator::Lazy, but using that guy on a regular boring Array is kind of a waste as it doesn't make it lazy enough. Thus lazy_list for ruby.

IMPORTANT!!

= Requires Ruby2.0 to work!

Actually, that's not necessarily true. It requires Enurmerator::Lazy to work

Examples

  1. Generic FizzBuzz (where divisble by 3 -> fizz, divisble by 5 -> buzz, divisible by 15 -> fizzbuzz) example
  from_1 = LazyList::Stream.cycle(1).recur { |v| v + 1 } # [1, 2, 3, 4, 5...]
  fizzes = from_1.lazy.map { |v| (v%3).zero? "fizz" : nil }
  buzzes = from_1.lazy.map { |v| (v%5).zero? "buzz" : nil }
  solution = from_1.lazy.zip(fizzes.zip buzzes).map { |v| [v.first, "#{v.last.first}#{v.last.last}"] }.take(100).to_a
  1. More examples coming up!

Contributing to lazy_list

  • Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet.
  • Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it.
  • Fork the project.
  • Start a feature/bugfix branch.
  • Commit and push until you are happy with your contribution.
  • Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
  • Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.

Copyright

Copyright (c) 2013 Thomas Chen. See LICENSE.txt for further details.