lazylist 0.2.0 → 0.2.1

data/CHANGES

@@ -1,3 +1,8 @@
+2005-12-05 * 0.2.1 * Fixed a documentation bug, reported by Gary Wright
+                     <at2002@mac.com>.
+                   * enable/disable index reference cache added.
+                   * LazyList#sublist added to generate sublists that
+                     share elements with their "super" lists.
 2005-10-08 * 0.2.0 * Lots of changes (without backwards compatibility):
                       - Now the usual methods from the Ruby Enumerable module
                         should be much better supported.

data/README.en

@@ -9,7 +9,7 @@ Documentation
 =============
 
 The API documentatin of this library is can be produced by typing:
-$ ruby makedoc.rb
+$ ruby make_doc.rb
 
 You should also look into the files in the examples directory to get an idea
 how this library is used. It is also interesting to examine test.rb for this

data/Rakefile

@@ -5,12 +5,12 @@ include Config
 
 PKG_NAME = 'lazylist'
 PKG_VERSION = File.read('VERSION').chomp
-PKG_FILES = Dir.glob("**/*").delete_if { |item|
-  item.include?("CVS") or item.include?("pkg")
-}
+PKG_FILES = FileList['**/*'].exclude(/^doc/).exclude(/^CVS/).exclude(/^pkg/)
+
+task :default => :test
 
 desc "Run unit tests"
-task(:test) do
+task :test  do
   cd 'tests' do
     ruby %{-I../ext runner.rb}
   end
@@ -26,6 +26,12 @@ task :doc do
   ruby 'make_doc.rb'
 end
 
+desc "Removing generated files"
+task :clean do
+  rm_rf 'doc'
+  rm_rf 'tests/coverage'
+end
+
 spec = Gem::Specification.new do |s|
   #### Basic information.
 
@@ -57,11 +63,11 @@ spec = Gem::Specification.new do |s|
   #### Documentation and testing.
 
   s.has_rdoc = true
-  #s.extra_rdoc_files = rd.rdoc_files.reject { |fn| fn =~ /\.rb$/ }.to_a
-  #s.rdoc_options <<
-  #  '--title' <<  'Rake -- Ruby Make' <<
-  #  '--main' << 'README' <<
-  #  '--line-numbers'
+  s.extra_rdoc_files = [ 'lib/lazylist.rb' ]
+  s.rdoc_options <<
+    '--title' <<  'LazyList -- Infinite lists in Ruby' <<
+    '--main' << 'LazyList' <<
+    '--line-numbers'
   s.test_files << 'tests/test.rb'
 
   #### Author and project details.
@@ -76,4 +82,6 @@ Rake::GemPackageTask.new(spec) do |pkg|
   pkg.need_tar = true
   pkg.package_files += PKG_FILES
 end
+
+task :release => [ :clean, :package ]
   # vim: set et sw=2 ts=2:

data/TODO

@@ -1,4 +1,5 @@
 * adding better support for finite lazy lists  
+* make lists even
 * this stuff
   # XXX
   def append(*elements)

data/VERSION

@@ -1 +1 @@
-0.2.0
+0.2.1

data/examples/examples.rb

@@ -1,4 +1,6 @@
 require 'lazylist'
+$:.unshift 'examples'
+require 'pi'
 
 puts "Random number lazy list (infinite)"
 def rand(s = 666)
@@ -66,4 +68,15 @@ me = LazyList[File.new($0)]
 me.each(6) { |line| puts line }
 p me[66]
 puts me.length
+puts
+
+puts "Proof that PI is the number of the beast"
+p PI.take(10)
+
+def window(l, n, m = 0)
+  list([ l.take(n) * '', m ]) { window(l.drop, n, m + 1) }
+end
+w = window(PI, 3)
+index = w.find { |(x, i)| x == '666' and break i }
+puts "Found #{PI.take_span(index, 3)} at #{index}!"
   # vim: set et sw=2 ts=2: 

data/lib/lazylist.rb

@@ -104,10 +104,10 @@ class LazyList
     # list for which the block evaluates to true, the second containing the
     # rest.
     def partition(&block)
-      accepted, rejected = to_a.partition(&block)
-      return LazyList.from_enum(accepted), LazyList.from_enum(rejected)
+      return select(&block), reject(&block)
     end
 
+
     # Returns a sorted version of this lazy list. This method should only be
     # called on finite lazy lists or it will never return. Also see
     # Enumerable#sort.
@@ -263,6 +263,7 @@ class LazyList
   # Creates a new LazyList element. The tail can be given either as
   # second argument or as block.
   def initialize(head, tail = nil, &promise)
+    @cached = true
     @ref_cache = {}
     if tail
       promise and
@@ -274,6 +275,17 @@ class LazyList
     end
   end
 
+  # Set this to false, if index references into the lazy list shouldn't be
+  # cached for fast access (while spending some memory on this). This value
+  # defaults to true.
+  attr_writer :cached
+
+  # Returns true, if index references into the lazy list are cached for fast
+  # access to the referenceѕ elements.
+  def cached?
+    !!@cached
+  end
+
   # Denotes the empty LazyList which is a guard at the end of finite
   # lazy lists.
   Empty = new(nil, nil)
@@ -303,8 +315,8 @@ class LazyList
   # Identity lambda expression, mostly used as a default.
   Identity = lambda { |x| x }
 
-  # Returns a lazy list which is generated by LazyList.from_enum or
-  # LazyList.span.
+  # Returns a lazy list which is generated from the Enumerable a or
+  # LazyList.span(a, n), if n was given as an argument.
   def self.[](a, n = nil)
     case
     when n
@@ -371,6 +383,48 @@ class LazyList
     end
   end
 
+  # Returns the sublist, constructed from the Range _range_ indexed elements,
+  # of this lazy list.
+  def sublist_range(range)
+    f = range.first
+    l = range.exclude_end? ? range.last - 1 : range.last
+    sublist_span(f, l - f + 1)
+  end
+
+  # Returns the sublist, that spans _m_ elements starting from the _n_-th
+  # element of this lazy list, if _m_ was given. If _m_ is non­positive, the
+  # empty lazy list LazyList::Empty is returned.
+  #
+  # If _m_ wasn't given returns the _n_ long sublist starting from the first
+  # (index = 0) element. If _n_ is non­positive, the empty lazy list
+  # LazyList::Empty is returned.
+  def sublist_span(n, m = nil)
+    if not m
+      sublist_span(0, n)
+    elsif m > 0
+      l = ref(n)
+      self.class.new(l.head) { l.tail.sublist_span(0, m - 1) }
+    else
+      Empty
+    end
+  end
+
+  # Returns the result of sublist_range(n), if _n_ is a Range. The result of
+  # sublist_span(n, m), if otherwise.
+  def sublist(n, m = nil)
+    if n.is_a? Range
+      sublist_range(n)
+    else
+      sublist_span(n, m)
+    end
+  end
+
+  def set_ref(n, value)
+    return value unless cached?
+    @ref_cache[n] = value
+  end
+  private :set_ref
+
   # Returns the n-th LazyList-Object.
   def ref(n)
     if @ref_cache.key?(n)
@@ -380,12 +434,12 @@ class LazyList
     i = n
     while i > 0 do
       if s.empty?
-        return @ref_cache[n] = nil
+        return set_ref(n, self)
       end
       s = s.tail
       i -= 1
     end
-    @ref_cache[n] = s
+    set_ref(n, s)
   end
   private :ref
 
@@ -395,13 +449,13 @@ class LazyList
   # returned.
   def [](n, m = nil)
     if n.is_a? Range
-      LazyList[take_range(n)]
+      sublist(n)
     elsif n < 0
       nil
     elsif m
-      LazyList[take_span(n, m)]
+      sublist(n, m)
     else
-      ref(n).head rescue nil
+      ref(n).head
     end
   end
 

data/tests/runner.rb

@@ -6,7 +6,7 @@ $:.unshift File.expand_path(File.dirname($0))
 $:.unshift 'lib'
 $:.unshift '../lib'
 begin
-  #require 'coverage'
+  require 'coverage'
 rescue LoadError
 end
 require 'test'

data/tests/test.rb

@@ -51,121 +51,144 @@ class TC_LazyList < Test::Unit::TestCase
     @read_queue1 = LazyList::ReadQueue.new(1..1)
     @read_queue10 = LazyList::ReadQueue.new(1..10)
     assert(@read_queue0.empty?)
-    assert_equal(nil, @read_queue0.pop)
+    assert_equal nil, @read_queue0.pop
     assert(!@read_queue1.empty?)
-    assert_equal(1, @read_queue1.pop)
+    assert_equal 1, @read_queue1.pop
     assert(!@read_queue10.empty?)
     for i in 1..10 do
-      assert_equal(i, @read_queue10.pop)
+      assert_equal i, @read_queue10.pop
     end
   end
 
   def test_finite
-    assert_equal(@finite_inner0.to_a, @finite0.to_a)
-    assert_equal(@finite_inner1.to_a, @finite1.to_a)
-    assert_equal(@finite_inner10.to_a, @finite10.to_a)
-    assert_equal(@finite_span_generated, @finite_span.to_a)
+    assert_equal @finite_inner0.to_a, @finite0.to_a
+    assert_equal @finite_inner1.to_a, @finite1.to_a
+    assert_equal @finite_inner10.to_a, @finite10.to_a
+    assert_equal @finite_span_generated, @finite_span.to_a
   end
 
   def test_size
-    assert_equal(0, @finite0.size)
-    assert_equal(1, @finite1.size)
-    assert_equal(10, @finite10.size)
-    assert_equal(10, @finite_span.size)
-    assert_equal(0, @finite0.length)
-    assert_equal(1, @finite1.length)
-    assert_equal(10, @finite10.length)
-    assert_equal(10, @finite_span.length)
+    assert_equal 0, @finite0.size
+    assert_equal 1, @finite1.size
+    assert_equal 10, @finite10.size
+    assert_equal 10, @finite_span.size
+    assert_equal 0, @finite0.length
+    assert_equal 1, @finite1.length
+    assert_equal 10, @finite10.length
+    assert_equal 10, @finite_span.length
   end
 
   def test_select
-    assert_equal(1, @odd[0])
-    assert_equal(3, @odd[1])
-    assert_equal(5, @odd[2])
-    assert_equal((1..19).select(&@oddp), @odd[0, 10].to_a)
-    assert_equal((1..10).to_a, @natural[0, 10].to_a)
-    assert_equal([ 1 ] * 10, @ones[0, 10].to_a)
+    assert_equal 1, @odd[0] 
+    assert_equal 3, @odd[1] 
+    assert_equal 5, @odd[2] 
+    assert_equal (1..19).select(&@oddp), @odd[0, 10].to_a
+    assert_equal (1..10).to_a, @natural[0, 10].to_a
+    assert_equal [ 1 ] * 10, @ones[0, 10].to_a
     ends_with_a = @strings.select { |x| x[-1] == ?a }
-    assert(ends_with_a[0, 27].to_a ==
-      [ "a", ("a".."z").map { |x| x + "a" }  ].flatten)
+    assert_equal ends_with_a[0, 27].to_a,
+      [ "a", ("a".."z").map { |x| x + "a" }  ].flatten 
   end
 
   def test_map
     id = @natural.map
-    assert_equal(1, id[0])
-    assert_equal(2, id[1])
-    assert_equal(3, id[2])
-    assert_equal((1..10).to_a, id[0, 10].to_a)
-    assert_equal((1..10).to_a, @natural[0, 10].to_a)
+    assert_equal 1, id[0] 
+    assert_equal 2, id[1] 
+    assert_equal 3, id[2] 
+    assert_equal (1..10).to_a, id[0, 10].to_a 
+    assert_equal (1..10).to_a, @natural[0, 10].to_a 
     squaredf = lambda { |x| x ** 2 }
     squared = @natural.map(&squaredf)
-    assert_equal(1, squared[0])
-    assert_equal(4, squared[1])
-    assert_equal(9, squared[2])
-    assert_equal((1..10).map(&squaredf), squared[0, 10].to_a)
-    assert_equal((1..10).to_a, @natural[0, 10].to_a)
+    assert_equal 1, squared[0] 
+    assert_equal 4, squared[1] 
+    assert_equal 9, squared[2] 
+    assert_equal (1..10).map(&squaredf), squared[0, 10].to_a 
+    assert_equal (1..10).to_a, @natural[0, 10].to_a 
     strangef = lambda { |x| x * (x[0] - ?a + 1) }
     strange = @strings.map(&strangef)
-    assert_equal("a", strange[0])
-    assert_equal("bb", strange[1])
-    assert_equal("ccc", strange[2])
-    assert_equal(("a".."z").map(&strangef), strange[0, 26].to_a)
-    assert_equal(("a".."z").to_a, @strings[0, 26].to_a)
+    assert_equal "a", strange[0] 
+    assert_equal "bb", strange[1] 
+    assert_equal "ccc", strange[2] 
+    assert_equal ("a".."z").map(&strangef), strange[0, 26].to_a 
+    assert_equal ("a".."z").to_a, @strings[0, 26].to_a 
   end
 
   def test_index
-    assert_equal(nil, @natural[-1])
-    assert_equal(1, @natural[0])
-    assert_equal(2, @natural[1])
-    assert_equal(nil, @natural[-1, 10])
-    assert_equal(LazyList[1..10], @natural[0, 10])
-=begin
-    assert_equal((6..15).to_a, @natural[5, 10])
-    assert_equal((1..1).to_a, @natural[0..0])
-    assert_equal((1..0).to_a, @natural[0..-1])
-    assert_equal((1...1).to_a, @natural[0...0])
-    assert_equal((1...0).to_a, @natural[0...-1])
-    assert_equal((1..10).to_a, @natural[0..9])
-    assert_equal((6..15).to_a, @natural[5..14])
-    assert_equal((1..10).to_a, @natural[0...10])
-    assert_equal((6..15).to_a, @natural[5...15])
-=end
+    assert_equal nil, LazyList::Empty[-1]
+    assert_equal nil, LazyList::Empty[0]
+    assert_equal nil, LazyList::Empty[1]
+    assert @natural.cached?
+    assert_equal nil, @natural[-1] 
+    assert_equal nil, @natural[-1] 
+    assert_equal 1, @natural[0] 
+    assert_equal 1, @natural[0] 
+    assert_equal 2, @natural[1] 
+    assert_equal 2, @natural[1] 
+    assert_equal nil, @natural[-1, 10] 
+    assert_equal (1..10).to_a, @natural[0, 10].to_a 
+    assert_equal (6..15).to_a, @natural[5, 10].to_a 
+    assert_equal (1..1).to_a, @natural[0..0].to_a 
+    assert_equal (1..0).to_a, @natural[0..-1].to_a 
+    assert_equal (1...1).to_a, @natural[0...0].to_a 
+    assert_equal (1...0).to_a, @natural[0...-1].to_a 
+    assert_equal (1..10).to_a, @natural[0..9].to_a 
+    assert_equal (6..15).to_a, @natural[5..14].to_a 
+    assert_equal (1..10).to_a, @natural[0...10].to_a 
+    assert_equal (6..15).to_a, @natural[5...15].to_a 
+  end
+
+  def test_index_without_cache
+    LazyList::Empty.cached = false
+    assert_equal nil, LazyList::Empty[-1]
+    assert_equal nil, LazyList::Empty[0]
+    assert_equal nil, LazyList::Empty[1]
+    @natural.cached = false
+    assert !@natural.cached?
+    assert_equal nil, @natural[-1] 
+    assert_equal nil, @natural[-1] 
+    assert_equal 1, @natural[0] 
+    assert_equal 1, @natural[0] 
+    assert_equal 2, @natural[1] 
+    assert_equal 2, @natural[1] 
+    assert_equal nil, @natural[-1, 10] 
   end
 
   def test_merge
     natural = @even.merge(@odd)
-    assert_equal(@natural[0, 10].to_a, natural[0, 10].to_a)
+    assert_equal @natural[0, 10].to_a, natural[0, 10].to_a 
     natural = @odd.merge(@even)
-    assert_equal(@natural[0, 10].to_a, natural[0, 10].to_a)
+    assert_equal @natural[0, 10].to_a, natural[0, 10].to_a 
     double_list = @natural.merge(@natural) { |a,b| a <= b }
-    assert(double_list[0, 10].to_a, (1..5).map { |x| [x, x] }.flatten)
+    assert double_list[0, 10].to_a, (1..5).map { |x| [x, x] }.flatten 
     odd2 = @natural.select(&@oddp).drop(1)
     some = @even.merge(odd2)
-    assert_equal(@natural[1, 9].to_a, some[0, 9].to_a)
+    assert_equal @natural[1, 9].to_a, some[0, 9].to_a 
+    more_ones = @ones.merge(@ones)
+    assert_equal [1] * 10, more_ones.take(10)
   end
 
   def test_take_drop
-    assert_equal([ ], @odd.take(0))
-    assert_equal([ 1, 3, 5 ], @odd.take(3))
-    assert_equal([ 1, 3, 5 ], @odd.take(3))
-    assert_equal([ ], @odd.take!(0))
-    assert_equal([ 1 ], @odd.take(1))
-    assert_equal([ 1 ], @odd.take!(1))
-    assert_equal([ 3, 5, 7 ], @odd.take(3))
-    assert_equal([ 3, 5 ], @odd.take!(2))
-    assert_equal([ 7, 9, 11 ], @odd.take(3))
-    assert_equal([ 7, 9, 11 ], @odd.drop(0).take(3))
-    assert_equal([ 7, 9, 11 ], @odd.take(3))
-    assert_equal([ 9, 11, 13 ], @odd.drop(1).take(3))
-    assert_equal([ 7, 9, 11 ], @odd.take(3))
-    assert_equal([ 11, 13, 15 ], @odd.drop(2).take(3))
-    assert_equal([ 7, 9, 11 ], @odd.take(3))
+    assert_equal [ ], @odd.take(0)
+    assert_equal [ 1, 3, 5 ], @odd.take(3)
+    assert_equal [ 1, 3, 5 ], @odd.take(3)
+    assert_equal [ ], @odd.take!(0)
+    assert_equal [ 1 ], @odd.take(1)
+    assert_equal [ 1 ], @odd.take!(1)
+    assert_equal [ 3, 5, 7 ], @odd.take(3)
+    assert_equal [ 3, 5 ], @odd.take!(2)
+    assert_equal [ 7, 9, 11 ], @odd.take(3)
+    assert_equal [ 7, 9, 11 ], @odd.drop(0).take(3)
+    assert_equal [ 7, 9, 11 ], @odd.take(3) 
+    assert_equal [ 9, 11, 13 ], @odd.drop(1).take(3) 
+    assert_equal [ 7, 9, 11 ], @odd.take(3) 
+    assert_equal [ 11, 13, 15 ], @odd.drop(2).take(3) 
+    assert_equal [ 7, 9, 11 ], @odd.take(3) 
     @odd.drop!(0)
-    assert_equal([ 7, 9, 11 ], @odd.take(3))
+    assert_equal [ 7, 9, 11 ], @odd.take(3) 
     @odd.drop!(1)
-    assert_equal([ 9, 11, 13 ], @odd.take(3))
+    assert_equal [ 9, 11, 13 ], @odd.take(3) 
     @odd.drop!(2)
-    assert_equal([ 13, 15, 17 ], @odd.take(3))
+    assert_equal [ 13, 15, 17 ], @odd.take(3) 
   end
 
   def test_io
@@ -181,21 +204,30 @@ class TC_LazyList < Test::Unit::TestCase
     end
     @tempfile10.close
     @tempfile10_list = LazyList[File.new(@tempfile10.path)]
-    assert_equal(0, @tempfile0_list.size)
-    assert_equal([], @tempfile0_list.to_a)
-    assert_equal(10, @tempfile10_list.size)
-    assert_equal((1..10).map { |x| x.to_s + "\n" },
-      @tempfile10_list.to_a)
+    assert_equal 0, @tempfile0_list.size 
+    assert_equal [], @tempfile0_list.to_a 
+    assert_equal 10, @tempfile10_list.size 
+    assert_equal (1..10).map { |x| x.to_s + "\n" },
+      @tempfile10_list.to_a 
     temp = LazyList.io(File.new(@tempfile0.path)) do |io|
       io.readline
     end
     content = temp.inject([]) { |c, line| c << line }
-    assert_equal([], content)
+    assert_equal [], content 
     temp = LazyList.io(File.new(@tempfile10.path)) do |io|
       io.readline
     end
     content = temp.inject([]) { |c, line| c << line }
-    assert_equal((1..10).map { |x| x.to_s + "\n" }, content)
+    assert_equal (1..10).map { |x| x.to_s + "\n" }, content 
+  end
+
+  def test_construct_ref
+    assert_equal LazyList::Empty, LazyList[0, -1]
+    assert_equal [0], LazyList[0, 1].to_a
+    assert_equal (0..9).to_a, LazyList[0, 10].to_a
+    assert_equal LazyList::Empty, LazyList[0..-1]
+    assert_equal [0], LazyList[0..0].to_a
+    assert_equal (0..9).to_a, LazyList[0..9].to_a
   end
 
   def test_iterate
@@ -206,24 +238,24 @@ class TC_LazyList < Test::Unit::TestCase
         5 * x + 1
       end
     end
-    assert_equal(nil, f[-1])
-    assert_equal(5, f[0])
-    assert_equal(26, f[1])
-    assert_equal([5, 26, 13, 66, 33, 166, 83, 416], f[0, 8].to_a)
+    assert_equal nil, f[-1] 
+    assert_equal 5, f[0] 
+    assert_equal 26, f[1] 
+    assert_equal [5, 26, 13, 66, 33, 166, 83, 416], f[0, 8].to_a 
   end
 
-  def test_inpsect
+  def test_inspect
     l = LazyList[1..11]
-    assert_equal("[]", LazyList::Empty.inspect)
-    assert_equal("[1,... ]", l.inspect)
+    assert_equal "[]", LazyList::Empty.inspect 
+    assert_equal "[1,... ]", l.inspect 
     l[1]
-    assert_equal("[1, 2,... ]", l.inspect)
+    assert_equal "[1, 2,... ]", l.inspect 
     l[2]
-    assert_equal("[1, 2, 3,... ]", l.inspect)
+    assert_equal "[1, 2, 3,... ]", l.inspect 
     l[9]
-    assert_equal("[1, 2, 3, 4, 5, 6, 7, 8, 9, 10,... ]", l.inspect)
+    assert_equal "[1, 2, 3, 4, 5, 6, 7, 8, 9, 10,... ]", l.inspect 
     l.to_a
-    assert_equal("[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]", l.inspect)
+    assert_equal "[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]", l.inspect 
   end
 
   def test_zip
@@ -255,5 +287,17 @@ class TC_LazyList < Test::Unit::TestCase
     assert_equal [ 1 ] * 10 , ones.take(10)
     assert_equal '[1,... ]', ones.inspect
   end
+
+  def test_sublist
+    assert_equal LazyList::Empty, @natural.sublist(-1)
+    assert_equal LazyList::Empty, @natural.sublist(0)
+    assert_equal [1], @natural.sublist(1).to_a
+    assert_equal (1..10).to_a, @natural.sublist(10).to_a
+    assert_equal (6..15).to_a, @natural[5, 10].to_a
+    assert_equal (6..15).to_a, @natural[5..14].to_a
+    assert_equal (6..14).to_a, @natural[5...14].to_a
+    assert_equal nil, @natural.sublist(10)[10]
+    assert_equal 10, @natural.sublist(10)[9]
+  end
 end
   # vim: set et sw=2 ts=2: 

metadata

@@ -3,56 +3,65 @@ rubygems_version: 0.8.11
 specification_version: 1
 name: lazylist
 version: !ruby/object:Gem::Version 
-  version: 0.2.0
-date: 2005-10-08 00:00:00 +02:00
+  version: 0.2.1
+date: 2005-12-22 00:00:00 +01:00
 summary: Implementation of lazy lists for Ruby
 require_paths: 
-  - lib
+- lib
 email: flori@ping.de
 homepage: http://lazylist.rubyforge.org
 rubyforge_project: lazylist
-description: ''
+description: ""
 autorequire: lazylist
 default_executable: 
 bindir: bin
 has_rdoc: true
 required_ruby_version: !ruby/object:Gem::Version::Requirement 
   requirements: 
-    - 
-      - ">"
-      - !ruby/object:Gem::Version 
-        version: 0.0.0
+  - - ">"
+    - !ruby/object:Gem::Version 
+      version: 0.0.0
   version: 
 platform: ruby
 signing_key: 
 cert_chain: 
 authors: 
-  - Florian Frank
+- Florian Frank
 files: 
-  - examples
-  - install.rb
-  - GPL
-  - TODO
-  - Rakefile
-  - VERSION
-  - tests
-  - CHANGES
-  - lib
-  - make_doc.rb
-  - README.en
-  - examples/hamming.rb
-  - examples/sieve.rb
-  - examples/pi.rb
-  - examples/examples.rb
-  - tests/test.rb
-  - tests/test_enumerable.rb
-  - tests/runner.rb
-  - lib/lazylist.rb
+- examples
+- install.rb
+- GPL
+- TODO
+- Rakefile
+- VERSION
+- tests
+- CHANGES
+- lib
+- make_doc.rb
+- README.en
+- examples/hamming.rb
+- examples/sieve.rb
+- examples/pi.rb
+- examples/examples.rb
+- tests/test.rb
+- tests/test_enumerable.rb
+- tests/runner.rb
+- lib/lazylist.rb
 test_files: 
-  - tests/test.rb
-rdoc_options: []
-extra_rdoc_files: []
+- tests/test.rb
+rdoc_options: 
+- --title
+- LazyList -- Infinite lists in Ruby
+- --main
+- LazyList
+- --line-numbers
+extra_rdoc_files: 
+- lib/lazylist.rb
 executables: []
+
 extensions: []
+
 requirements: []
-dependencies: []
+
+dependencies: []
+