lazylist 0.1.2

data/CHANGES

@@ -0,0 +1,9 @@
+2004-09-30 * 0.1.2 * Added combine method.
+                   * The ref method now uses a hash to cache return values.
+		     This is not what I would still call a list datastructure.
+                     It increases memory consumption (as if that would matter
+		     anymore), too. But it speeds up things a great deal, if
+                     you persist on using indexes into a list.
+                   * Rakefile added
+                   * Supports Rubygems now
+2003-09-12 * 0.1.1 * Initial Release

data/GPL

@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+                       59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.

data/README.en

@@ -0,0 +1,27 @@
+Installation
+============
+
+Just type into the command line as root:
+
+# ruby install.rb
+
+Documentation
+=============
+
+The API documentatin of this library is can be produced by typing:
+$ ruby makedoc.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
+reason.
+
+Author
+======
+
+Florian Frank <flori@ping.de>
+
+License
+=======
+
+GNU General Public License (GPL)
+

data/Rakefile

@@ -0,0 +1,71 @@
+# Rakefile for File::Tail  -*- ruby -*-
+
+require 'rake/gempackagetask'
+require 'rbconfig'
+
+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")
+}
+
+desc "Installing library"
+task :install  do
+    libdir = CONFIG["sitelibdir"]
+    install('lib/lazylist.rb', libdir)
+end
+
+spec = Gem::Specification.new do |s|
+
+    #### Basic information.
+
+    s.name = 'lazylist'
+    s.version = PKG_VERSION
+    s.summary = "Implementation of lazy lists for Ruby"
+    s.description = ""
+
+    #### Dependencies and requirements.
+
+    #s.add_dependency('log4r', '> 1.0.4')
+    #s.requirements << ""
+
+    s.files = PKG_FILES
+
+    #### C code extensions.
+
+    #s.extensions << "ext/extconf.rb"
+
+    #### Load-time details: library and application (you will need one or both).
+
+    s.require_path = 'lib'                         # Use these for libraries.
+    s.autorequire = 'lazylist'
+
+    #s.bindir = "bin"                               # Use these for applications.
+    #s.executables = ["bla.rb"]
+    #s.default_executable = "bla.rb"
+
+    #### 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.test_files << 'tests/test.rb'
+
+    #### Author and project details.
+
+    s.author = "Florian Frank"
+    s.email = "flori@ping.de"
+    s.homepage = "http://lazylist.rubyforge.org"
+    s.rubyforge_project = "lazylist"
+end
+
+Rake::GemPackageTask.new(spec) do |pkg|
+    pkg.need_tar = true
+    pkg.package_files += PKG_FILES
+end
+    # vim: set et sw=4 ts=4:

data/VERSION

@@ -0,0 +1 @@
+0.1.2

data/examples/examples.rb

@@ -0,0 +1,64 @@
+require 'lazylist'
+
+puts "Random number lazy list"
+rand = lambda { |s| ((s * 1103515245 + 12345) / 65536) % 32768 }
+r = LazyList.iterate(rand[666], &rand)
+r.each(10) { |x| print x, " " } ; puts
+r = LazyList.iterate(rand[666], &rand).mapper { |x| 1 + x % 6 }
+r.each(10) { |x| print x, " " } ; puts
+
+puts "Prime number lazy list with filter"
+prime = LazyList[10000..1000000].filter do |x|
+	not (2..Math.sqrt(x).to_i).find { |d| x % d == 0 }
+end
+prime.each(10) { |x| print x, " " } ; puts
+p prime[1]
+puts
+
+puts "Squared prime numbers with mapper"
+prime.mapper { |x| x ** 2 }.each(5) { |x| print x, " " } ; puts
+puts
+
+puts "Lazy Lists from mathematical sequences"
+a196 = LazyList.iterate(35) { |x| x + x.to_s.reverse.to_i }
+a196.each(10) { |x| print x, " " } ; puts
+hailstone = LazyList.iterate(7) { |x| x % 2 == 0 ? x / 2 : 3 * x + 1 }
+hailstone.each(20) { |x| print x, " " } ; puts
+terras = LazyList.iterate(7) { |x| x % 2 == 0 ? x / 2 : (3 * x + 1) / 2 }
+terras.each(20) { |x| print x, " " } ; puts
+wolfram = LazyList.iterate(7) do |x|
+	((3.0 / 2) * (x % 2 == 0 ? x : x + 1)).to_i
+end
+wolfram.each(15) { |x| print x, " " } ; puts
+puts
+
+puts "Fibonacci lazy list with recursion"
+fib = LazyList.tabulate(0) { |x| x < 2 ? 1 : fib[x-2] + fib[x-1] }
+fib.each(10) { |x| print x, " " } ; puts
+p fib[100]
+puts
+
+puts "Sum up odd numbers lazylist to get a squares stream"
+odd = LazyList.tabulate(1) { |x| 2 * x - 1 }
+puts odd
+squares = LazyList.tabulate(0) do |x|
+	(0..x).inject(0) { |s, i| s + odd[i] }
+end
+puts squares
+squares.each(10) { |x| print x, " " } ; puts
+puts squares
+puts odd
+puts
+
+puts "Lazy lists from io objects"
+me = LazyList.io(File.new($0)) { |io| io.readline }
+me.each(6) { |line| puts line }
+p me[55]
+puts me.length
+puts
+
+me = LazyList[File.new($0)]
+me.each(6) { |line| puts line }
+p me[61]
+puts me.length
+	# vim: set noet sw=4 ts=4: 

data/examples/hamming.rb

@@ -0,0 +1,18 @@
+require 'lazylist'
+
+# Computes the hamming sequence: that is the sequence of natural numbers that
+# are dividable only by 1, 2, 3 or 5.
+hamming = LazyList.new(1) do
+	hamming.mapper { |x| 2 * x }.merge(
+		hamming.mapper { |x| 3 * x }.merge(
+			hamming.mapper { |x| 5 * x }))
+end
+
+max = (ARGV.shift || 100).to_i
+hamming.each(max) do |x|
+	print x, " "
+	STDOUT.flush
+end
+puts
+print hamming[1000], ", ", hamming[1001], "\n"
+	# vim: set noet sw=4 ts=4: 

data/examples/pi.rb

@@ -0,0 +1,32 @@
+require 'lazylist'
+
+# This spigot algorithm computes an unbounded number of digits of Pi and
+# uses a lazy list to save them.
+#
+# References:
+# - Jeremy Gibbons (2003). An Unbounded Spigot Algorithm for the Digits of Pi.
+#   http://web.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/spigot.pdf
+#
+
+def f(q,r,t, k)
+	n = (3 * q + r) / t
+	if n == (4 * q + r) / t
+		LazyList.new(n) { f(10 * q, 10 * (r - n * t), t, k) }
+	else
+		f(q * k, q * (4 * k + 2) + r * (2 * k + 1), t * (2 * k + 1), k + 1)
+	end
+end
+
+max = ARGV.empty? ? nil : ARGV.shift.to_i
+pi = f(1, 0, 1, 1)	# Setup my lazy list
+sum = pi[0, 1000].inject(0) do |s, i| s += i end
+puts "Sum of the first 1000 digitis of pi: #{sum}"
+puts "500th digit using memoized computation: #{pi[499]}"
+
+puts "Printing #{max ? "the first #{max}" : "all the "} digits of pi:"
+pi.each!(max) do |x|
+	STDOUT.print x
+	STDOUT.flush
+end
+puts
+	# vim: set noet sw=4 ts=4: 

data/examples/sieve.rb

@@ -0,0 +1,22 @@
+require 'lazylist'
+
+# Sieve or Eratosthenes with filters on Lazy Lists. It has a very nice
+# notation, but is a real memory and cpu hog. Enjoy!
+
+class LazyList
+
+	def prime_filter
+		LazyList.new(head) do
+			tail.filter { |x| x % head != 0 }.prime_filter
+		end
+	end
+
+end
+
+max = (ARGV.shift || 100).to_i
+LazyList.tabulate(2) { |x| x }.prime_filter.each(max) do |x|
+	print x, " "
+	STDOUT.flush
+end
+puts
+	# vim: set noet sw=4 ts=4: 

data/install.rb

@@ -0,0 +1,11 @@
+#!/usr/bin/env ruby
+
+require 'rbconfig'
+include Config
+require 'fileutils'
+include FileUtils::Verbose
+
+libdir = CONFIG["sitelibdir"]
+file = "lib/lazylist.rb"
+install(file, libdir)
+  # vim: set et sw=2 ts=2: 

data/lib/lazylist.rb

@@ -0,0 +1,396 @@
+# = lazylist.rb - Implementation of lazy lists for Ruby
+#
+# == Author
+#
+# Florian Frank mailto:flori@ping.de
+#
+# == Description
+#
+# 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.
+# 
+# == Example
+#
+# To compute the square numbers with a lazy list you can define one as
+#
+#  sq = LazyList.tabulate(1) { |x| x * x }
+#
+# Now it's possible to get the first 10 square numbers by calling
+# LazyList#take
+#
+#  sq.take(10)
+#      ==>[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]
+#
+# To compute every square number and do something with it you can call the
+# "each" method:
+#
+# sq.each { |x| puts x }
+#
+# Notice that calls to each will not return if applied to infinite lazylists.
+#
+# You can also use indices on lazy lists to get the values at a certain range:
+#
+# sq[ 0..9 ] or sq[0, 10]
+#
+#      ==>[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]
+# 
+# To spare memory it's possible to throw away every element after it was
+# fetched:
+#
+# sq.take!(1) => [1]
+# sq.take!(1) => [4]
+#
+# Of course it's also possible to compute more complex lists like the Fibonacci
+# sequence:
+#
+# fib = LazyList.tabulate(0) { |x| x < 2 ? 1 : fib[x-2] + fib[x-1] }
+#
+# fib[100] => 573147844013817084101
+# computes the 99th Fibonacci number. (We always start with index 0.)
+# fib[101] => 927372692193078999176
+# computes the 100th Fibonacci number. The already computed values are reused
+# to compute this result. That's a very transparent way to get memoization for
+# sequences that require heavy computation.
+# 
+# You create LazyLists that are based on arbitrary Enumerables, so can
+# for example wrap your passwd file in one pretty easily:
+#
+# pw = LazyList[ File.new("/etc/passwd") ]
+# 
+# Call grep to find the users root and flori:
+# pw.grep /^(root|flori):/ => ["root:x:0:0:...\n", "flori:x:500:500...\n"]
+#
+# In this case the whole passwd file is slurped into the memory. If
+# you use 
+# pw.find { |x| x =~ /^root:/ } => "root:x:0:0:root:/root:/bin/bash\n"
+# instead, only every line until the root line is loaded into the memory.
+#
+# == References
+#
+# A very good introduction into lazy lists can be found in the scheme bible
+# Structure and Interpretation of Computer Programs (SICP)
+# [http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-24.html#%25_sec_3.5]
+# 
+
+class LazyList
+
+  # ReadQueue is the implementation of an read-only queue that only supports
+  # #pop and #empty? methods.  It's used as a wrapper to encapsulate
+  # enumerables in LazyLists.
+  class ReadQueue
+
+    # Creates an ReadQueue object from an enumerable.
+    def initialize(enumerable)
+      @enumerable = enumerable
+      prepare
+    end
+
+    # Extracts the top element from the queue or nil if the queue is
+    # empty.
+    def pop
+      top = @current
+      callcc { |@break| @continue.call } unless empty?
+      top
+    end
+
+    # Returns true if the queue is empty.
+    def empty?
+      @continue == false
+    end
+
+    private 
+
+    def prepare
+      @break = lambda {}
+      @enumerable.each do |x|
+        @current = x
+        callcc do |@continue|
+          @break.call
+          return
+        end
+      end
+      @continue = false
+      @break.call
+    end
+
+  end
+
+  include Enumerable  # OK. Infinite lazy lists aren't really enumerable...
+
+  # Exceptions raised by the LazyList implementation.
+  class Exception < ::Exception; end
+
+  # Creates a new LazyList element. The tail can be given either as
+  # second argument or as block.
+  def initialize(head, tail = nil, &block_tail)
+    @ref_cache = {}
+    if tail
+      raise LazyList::Exception.new(
+        "Use block xor second argument for constructor") if block_tail
+      @head, @tail = head, tail
+    elsif block_tail
+      @head, @tail = head, block_tail
+    end
+  end
+
+  # Returns the value of this element.
+  attr_accessor :head
+  protected :head=
+
+  # Writes a tail value.
+  attr_writer :tail
+  protected :tail=
+
+  # Returns the next element by computing its value if necessary.
+  def tail
+    if @tail.is_a? Proc
+      @tail = @tail[@head]
+    end
+    @tail
+  end
+
+  # Returns the tail of this list without dooing evaluation.
+  def peek_tail
+    @tail
+  end
+  protected :peek_tail
+
+  # Denotes the empty LazyList which is a guard at the end of finite
+  # LazyLists.
+  Empty = new(nil, nil)
+
+  # Identity lambda expression, mostly used as a default.
+  Identity = lambda { |x| x }
+
+  # Returns a finite LazyList which is generated by LazyList.from_enum or
+  # LazyList.span. (See below.)
+  def self.[](a, n = nil)
+    if n
+      span(a, n)
+    else
+      from_enum(a)
+    end
+  end
+
+  # Generates a finite LazyList from any datastructure e which
+  # responds to the #each method. 
+  def self.from_enum(e)
+    oq = ReadQueue.new(e)
+    return Empty if oq.empty?
+    next_top = lambda do
+      if oq.empty?
+        Empty
+      else
+        new(oq.pop, next_top)
+      end
+    end
+    new(oq.pop, next_top)
+  end
+
+  # Generates a finite LazyList beginning with element a and spanning
+  # n elements. The datastructure members have to support the
+  # successor method succ.
+  def self.span(a, n)
+    if n > 0
+      new(a) { span(a.succ, n - 1) }
+    else
+      Empty
+    end
+  end
+
+  # Generates a LazyList which tabulates every element beginning with n
+  # and succeding with succ by calling the Proc object f or the given block.
+  # If none is given the identity function is computed instead.
+  def self.tabulate(n, &f)
+    f = Identity unless f
+    new(f[n]) { tabulate(n.succ, &f) }
+  end
+
+  # Generates a LazyList which iterates over its previous values
+  # computing something like: f(i), f(f(i)), f(f(f(i))), ...
+  def self.iterate(i, &f)
+    new(i) { iterate(f[i], &f) }
+  end
+
+  # Generates a LazyList of a give IO-object using a given
+  # block or Proc object to read from this object.
+  def self.io(io, &f)
+    io.eof? ? Empty : new(f[io]) { io(io, &f) }
+  end
+
+  # Returns the n-th LazyList-Object.
+  def ref(n)
+    if @ref_cache.key?(n)
+      return @ref_cache[n]
+    end
+    s = self
+    i = n
+    while i > 0 do
+      if s.empty?
+        return @ref_cache[n] = nil
+      end
+      s = s.tail
+      i -= 1
+    end
+    @ref_cache[n] = s
+  end
+  private :ref
+
+  # If n is a Range every element in this range is returned.
+  # If n isn't a Range object the element at index n is returned.
+  # If m is given the next m elements beginning the n-th element are
+  # returned.
+  def [](n, m = nil)
+    if n.is_a? Range
+      n.map { |i| ref(i).head }
+    elsif n < 0
+      nil
+    elsif m
+      s = ref(n)
+      s ? s.take(m) : nil
+    else
+      ref(n).head rescue nil
+    end
+  end
+
+  # Iterates over all elements. If n is given only n iterations are done.
+  # If self is a finite LazyList each returns also if there are no more
+  # elements to iterate over.
+  def each(n = nil)
+    s = self
+    while (n.nil? or n > 0) and not s.empty? do
+      yield s.head
+      s = s.tail
+      n -= 1 unless n.nil?
+    end
+    s
+  end
+
+  # Similar to LazyList#each but destroys elements from past
+  # iterations perhaps saving some memory.
+  def each!(n = nil)
+    s = self
+    while (n.nil? or n > 0) and not s.empty? do
+      yield s.head
+      s = s.tail
+      n -= 1 unless n.nil?
+      @head, @tail = s.head, s.tail
+    end
+    self
+  end
+
+  # Filters only elements for which predicate p is true.
+  def filter(&p)
+    p = Identity unless p
+    s = self
+    until s.empty? or p[s.head] do
+      s = s.tail
+    end
+    return Empty if s.empty?
+    self.class.new(s.head) { s.tail.filter(&p) }
+  end
+
+  # Creates a new Lazylist that maps the block or Proc object f to every
+  # element in the old list.
+  def mapper(&f)
+    return Empty if empty?
+    f = Identity unless f
+    self.class.new(f[head]) { tail.mapper(&f) }
+  end
+
+  # Merges this LazyList with the other. It uses the &compare block to decide
+  # which elements to place first in the result LazyList. If no compare block
+  # is given lambda { |a,b| a < b } is used as a default value.
+  def merge(other, &compare)
+    compare = lambda { |a,b| a < b } unless compare
+    return other if empty?
+    return self if other.empty?
+    if compare[head, other.head]
+      self.class.new(head) { tail.merge(other, &compare) }
+    elsif compare[other.head, head]
+      self.class.new(other.head) { merge(other.tail, &compare) }
+    else
+      self.class.new(head) { tail.merge(other.tail, &compare) }
+    end
+  end
+
+  # Combines this LazyList with the other to a new LazyList.
+  # The elements of the resulting lists are computed
+  # by calling the binary operator block on the two elemnts
+  # of the input lists. E.g. lambda { |x, y| x + y } adds
+  # the two input lists.
+  def combine(other, &operator)
+    self.class.new(operator.call(head, other.head)) do
+      tail.combine(other.tail, &operator)
+    end
+  end
+
+  # Takes the next n elements and returns them as an array.
+  def take(n)
+    result = []
+    each(n) { |x| result << x }
+    result
+  end
+
+  # Takes the next n elements and returns them as an array. It destroys these
+  # elements in the LazyList.
+  def take!(n)
+    result = []
+    each!(n) { |x| result << x }
+    result
+  end
+
+  # Drops the next n elements and returns the rest of this LazyList. n
+  # defaults to 1.
+  def drop(n)
+    each(n) { }
+  end
+
+  # Drops the next n elements, destroys them in the LazyList and
+  # returns the rest of this LazyList.
+  def drop!(n)
+    each!(n) { }
+  end
+
+  # Returns the size. This is only sensible if the LazyList is finite
+  # of course.
+  def size
+    inject(0) { |s,| s += 1 }
+  end
+
+  alias length size
+
+  # Returns true if this is the empty LazyList.
+  def empty?
+    self == Empty
+  end
+
+  # Inspects the list as far as it has been computed by returning
+  # a string of the form [1, 2, 3,... ].
+  def inspect
+    result = "["
+    s = self
+    until s.empty?
+      case s.peek_tail
+      when Empty
+        result << s.head.inspect
+        break
+      when Proc
+        result << s.head.inspect << ",... "
+        break
+      else
+        result << s.head.inspect << ", "
+        s = s.tail
+      end
+    end
+    result << "]"
+  end
+
+  alias to_s inspect
+
+end
+  # vim: set et sw=2 ts=2:

data/make_doc.rb

@@ -0,0 +1,6 @@
+#!/usr/bin/env ruby
+
+$outdir = 'doc/'
+puts "Creating documentation in '#$outdir'."
+system "rdoc -o #$outdir lib/lazylist.rb"
+  # vim: set et sw=2 ts=2:

data/tests/test.rb

@@ -0,0 +1,235 @@
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'lazylist'
+require 'tempfile'
+
+class MyEnum
+
+	include Enumerable
+
+	def initialize(n)
+		@n = n
+	end
+
+	def each(&block) (1..@n).each(&block) end
+
+end
+
+class TC_LazyList < Test::Unit::TestCase
+
+	def setup
+		@strings = LazyList.tabulate("a")
+		@natural = LazyList.tabulate(1)
+		@ones = LazyList.iterate(1) { 1 }
+		@oddp = lambda { |x| x % 2 == 1 }
+		@odd = @natural.filter(&@oddp)
+		@evenp = lambda { |x| x % 2 == 0 }
+		@boolean = @natural.mapper { |x| x % 2 == 0}
+		@even = @natural.filter(&@evenp)
+		@finite_inner0 = MyEnum.new(0)
+		@finite0 = LazyList[@finite_inner0]
+		@finite_inner1 = MyEnum.new(1)
+		@finite1 = LazyList[@finite_inner1]
+		@finite_inner10 = MyEnum.new(10)
+		@finite10 = LazyList[@finite_inner10]
+		@finite_span = LazyList.span("A", 10)
+		@finite_span_generated = ("A".."J").to_a
+	end
+
+	def test_constructor
+		ll1 = LazyList.new(:foo, LazyList::Empty)
+		assert(!ll1.empty?)
+		ll2 = LazyList.new(:foo) { Empty }
+		assert(!ll2.empty?)
+		assert_raises(LazyList::Exception) do
+			 ll3 = LazyList.new(:foo, :argh) { Empty }
+		end
+	end
+
+	def test_read_queue
+		@read_queue0 = LazyList::ReadQueue.new(1..0)
+		@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(!@read_queue1.empty?)
+		assert_equal(1, @read_queue1.pop)
+		assert(!@read_queue10.empty?)
+		for i in 1..10 do
+			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)
+	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)
+	end
+
+	def test_filter
+		assert_equal(1, @odd[0])
+		assert_equal(3, @odd[1])
+		assert_equal(5, @odd[2])
+		assert_equal((1..19).select(&@oddp), @odd[0, 10])
+		assert_equal((1..10).to_a, @natural[0, 10])
+		assert_equal([ 1 ] * 10, @ones[0, 10].to_a)
+		ends_with_a = @strings.filter { |x| x[-1] == ?a }
+		assert(ends_with_a[0, 27] ==
+			[ "a", ("a".."z").map { |x| x + "a" }  ].flatten)
+	end
+
+	def test_map
+		id = @natural.mapper
+		assert_equal(1, id[0])
+		assert_equal(2, id[1])
+		assert_equal(3, id[2])
+		assert_equal((1..10).map, id[0, 10])
+		assert_equal((1..10).to_a, @natural[0, 10])
+		squaredf = lambda { |x| x ** 2 }
+		squared = @natural.mapper(&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])
+		assert_equal((1..10).to_a, @natural[0, 10])
+		strangef = lambda { |x| x * (x[0] - ?a + 1) }
+		strange = @strings.mapper(&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])
+		assert_equal(("a".."z").to_a, @strings[0, 26])
+	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((1..10).to_a, @natural[0, 10])
+		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
+
+	def test_merge
+		natural = @even.merge(@odd)
+		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)
+		double_list = @natural.merge(@natural) { |a,b| a <= b }
+		assert(double_list[0, 10].to_a, (1..5).map { |x| [x, x] }.flatten)
+		odd2 = @natural.filter(&@oddp).drop(1)
+		some = @even.merge(odd2)
+		assert_equal(@natural[1, 9].to_a, some[0, 9].to_a)
+	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))
+		@odd.drop!(0)
+		assert_equal([ 7, 9, 11 ], @odd.take(3))
+		@odd.drop!(1)
+		assert_equal([ 9, 11, 13 ], @odd.take(3))
+		@odd.drop!(2)
+		assert_equal([ 13, 15, 17 ], @odd.take(3))
+	end
+
+	def test_io
+		@tempfile0 = Tempfile.new("test")
+		1.upto(0) do |i|
+			@tempfile0.puts i
+		end
+		@tempfile0.close
+		@tempfile0_list = LazyList[File.new(@tempfile0.path)]
+		@tempfile10 = Tempfile.new("test")
+		1.upto(10) do |i|
+			@tempfile10.puts i
+		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)
+		temp = LazyList.io(File.new(@tempfile0.path)) do |io|
+			io.readline
+		end
+		content = temp.inject([]) { |c, line| c << line }
+		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)
+	end
+
+	def test_iterate
+		f = LazyList.iterate(5) do |x|
+			if x % 2 == 0
+				x / 2
+			else
+				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])
+	end
+
+	def test_inpsect
+		list = LazyList[1..11]
+		assert_equal("[]", LazyList::Empty.inspect)
+		assert_equal("[1,... ]", list.inspect)
+		list[1]
+		assert_equal("[1, 2,... ]", list.inspect)
+		list[2]
+		assert_equal("[1, 2, 3,... ]", list.inspect)
+		list[9]
+		assert_equal("[1, 2, 3, 4, 5, 6, 7, 8, 9, 10,... ]", list.inspect)
+		list.to_a
+		assert_equal("[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]", list.inspect)
+	end
+
+	def test_combine
+		combined = @natural.combine(@ones) { |x, y| x + y }
+		assert_equal((12..21).to_a, combined[10,10])
+		assert_equal((2..11).to_a, combined[0,10])
+	end
+
+end
+	# vim: set noet sw=4 ts=4: 

metadata

@@ -0,0 +1,52 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.8.1
+specification_version: 1
+name: lazylist
+version: !ruby/object:Gem::Version 
+  version: 0.1.2
+date: 2004-09-30
+summary: Implementation of lazy lists for Ruby
+require_paths: 
+  - lib
+author: Florian Frank
+email: flori@ping.de
+homepage: http://lazylist.rubyforge.org
+rubyforge_project: lazylist
+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
+  version: 
+platform: ruby
+files: 
+  - README.en
+  - CHANGES
+  - GPL
+  - examples
+  - Rakefile
+  - VERSION
+  - install.rb
+  - make_doc.rb
+  - lib
+  - tests
+  - examples/examples.rb
+  - examples/hamming.rb
+  - examples/pi.rb
+  - examples/sieve.rb
+  - lib/lazylist.rb
+  - tests/test.rb
+test_files: 
+  - tests/test.rb
+rdoc_options: []
+extra_rdoc_files: []
+executables: []
+extensions: []
+requirements: []
+dependencies: []