rubylude 0.1.0

data/Gemfile

@@ -0,0 +1,3 @@
+source :rubygems
+
+gemspec

data/MIT-LICENSE

@@ -0,0 +1,20 @@
+Copyright (c) 2009 Bruno Michel
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,38 @@
+Rubylude
+========
+
+[Marc Chantreux](https://twitter.com/#!/marcchantreux) has written a lib to
+emulate haskell lazyness in Perl:
+[Perlude](https://github.com/eiro/p5-perlude). Rubylude is port of Perlude to
+Ruby 1.9 that profits of the fibers.
+
+Install
+-------
+
+```
+gem install rubylude
+```
+
+Example
+-------
+
+To print the first 10 Fibonacci numbers that are a mutiple of 5, just do :
+
+```ruby
+require "rubylude"
+
+fibo = ->() {
+  a, b = 0, 1
+  loop do
+    a, b = b, a + b
+    Fiber.yield a
+  end
+}
+
+Rubylude.new(fibo).filter { |x| x % 5 == 0 }.take(10).traverse { |x| puts x }
+```
+
+Credits
+-------
+
+♡2011 by Bruno Michel. Copying is an act of love. Please copy and share.

data/lib/rubylude.rb

@@ -0,0 +1,101 @@
+class Rubylude
+  VERSION = "0.1.0"
+
+  Infinity = 1.0 / 0
+
+  # Generator: create a Rubylude from a lambda function
+  def initialize(generator)
+    @generator = Fiber.new { generator.call; nil }
+  end
+
+  # Generator: takes an array and inject one element at a time
+  def self.unfold(values)
+    Rubylude.new ->() {
+      values.each {|v| Fiber.yield v }
+    }
+  end
+
+  # Generator: inject these values indefinitely
+  def self.cycle(values)
+    Rubylude.new ->() {
+      loop do
+        values.each {|v| Fiber.yield v }
+      end
+    }
+  end
+
+  # Generator: generate values from `start` to `stop`, separated by `step`
+  def self.range(start, stop=Infinity, step=1)
+    Rubylude.new ->() {
+      current = start - step
+      if step > 0
+        while (current += step) <= stop
+          Fiber.yield current
+        end
+      else
+        while (current += step) >= stop
+          Fiber.yield current
+        end
+      end
+    }
+  end
+
+  # Transformer: let pass only the elements that return true for the block
+  def filter(&blk)
+    Rubylude.new ->() {
+      while value = @generator.resume
+        Fiber.yield value if blk.call(value)
+      end
+    }
+  end
+
+  # Transformer: modify each element with the given block
+  def apply(&blk)
+    Rubylude.new ->() {
+      while value = @generator.resume
+        Fiber.yield blk.call(value)
+      end
+    }
+  end
+
+  # Transformer: let pass only the first `nb` elements
+  def take(nb)
+    Rubylude.new ->() {
+      nb.times { Fiber.yield @generator.resume }
+    }
+  end
+
+  # Transformer: if one element returns false, block it and all the following
+  def takeWhile(&blk)
+    Rubylude.new ->() {
+      while value = @generator.resume
+        return unless blk.call(value)
+        Fiber.yield value
+      end
+    }
+  end
+
+  # Transformer: drop the first `nb` elements
+  def drop(nb)
+    Rubylude.new ->() {
+      nb.times { @generator.resume }
+      while value = @generator.resume
+        Fiber.yield value
+      end
+    }
+  end
+
+  # Consumer: do an operation on each element
+  def traverse(&blk)
+    while value = @generator.resume
+      blk.call(value)
+    end
+  end
+
+  # Consumer: returns an array
+  def to_a
+    results = []
+    traverse { |value| results << value }
+    results
+  end
+end

metadata

@@ -0,0 +1,60 @@
+--- !ruby/object:Gem::Specification
+name: rubylude
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- Bruno Michel
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2011-07-14 00:00:00.000000000Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: &75191740 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '2.3'
+  type: :development
+  prerelease: false
+  version_requirements: *75191740
+description: Rubylude is a port of Perlude to Ruby 1.9
+email: bruno.michel@af83.com
+executables: []
+extensions: []
+extra_rdoc_files:
+- README.md
+files:
+- MIT-LICENSE
+- README.md
+- Gemfile
+- lib/rubylude.rb
+homepage: http://github.com/nono/rubylude
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.5
+signing_key: 
+specification_version: 3
+summary: Rubylude is a port of Perlude to Ruby 1.9
+test_files: []