comp_tree 0.7.6 → 1.0.0

data/CHANGES.rdoc

@@ -1,6 +1,12 @@
 
 = CompTree ChangeLog
 
+== Version 1.0.0
+
+* better errors and error handling
+* single-threaded compute() now checks exceptions
+* compute(:root, :threads => 3) option deprecated; use compute(:root, 3)
+
 == Version 0.7.6
 
 * Driver#define returns created node

data/MANIFEST

@@ -3,24 +3,23 @@ MANIFEST
 README.rdoc
 Rakefile
 devel/jumpstart.rb
-devel/jumpstart/lazy_attribute.rb
-devel/jumpstart/ruby.rb
-devel/jumpstart/simple_installer.rb
 install.rb
 lib/comp_tree.rb
 lib/comp_tree/algorithm.rb
+lib/comp_tree/comp_tree.rb
 lib/comp_tree/driver.rb
 lib/comp_tree/error.rb
 lib/comp_tree/node.rb
-lib/comp_tree/queue.rb
-lib/comp_tree/queue_new.rb
-lib/comp_tree/queue_old.rb
-test/common.rb
-test/test_basic.rb
-test/test_circular.rb
-test/test_drain.rb
-test/test_exception.rb
-test/test_flood.rb
-test/test_grind.rb
-test/test_sequential.rb
-test/test_throw.rb
+lib/comp_tree/queue/queue.rb
+lib/comp_tree/queue/queue_18.rb
+lib/comp_tree/queue/queue_19.rb
+test/basic_test.rb
+test/circular_test.rb
+test/comp_tree_test_base.rb
+test/drain_test.rb
+test/exception_test.rb
+test/flood_test.rb
+test/grind_test.rb
+test/readme_test.rb
+test/sequential_test.rb
+test/throw_test.rb

data/README.rdoc

@@ -3,8 +3,7 @@
 
 == Summary
 
-Automatic parallelism and lazy evaluation via pure functional
-programming.
+A simple framework for parallelizing computations.
 
 == Synopsis
   
@@ -33,7 +32,7 @@ programming.
     }
     
     # Compute the area using four parallel threads.
-    puts driver.compute(:area, :threads => 4)
+    puts driver.compute(:area, 4)
     # => 63
 
     # We've done this computation.
@@ -51,14 +50,15 @@ Or for the (non-gem) .tgz package,
 
 == Description
 
-CompTree is a framework for parallelizing interrelated computations.
+CompTree is parallel computation tree structure based upon concepts
+from pure functional programming.
 
-The user should have a basic understanding of <em>functional
-programming</em> (see for example
-http://en.wikipedia.org/wiki/Functional_programming) and the meaning
-of <em>side effects</em>.
+The user should have a basic understanding of functional programming
+(see for example http://en.wikipedia.org/wiki/Functional_programming)
+and the meaning of <em>side effects</em>.
 
-Every function you define must explicitly depend on the data it uses.
+Every pure function you define must explicitly depend on the data it
+uses.
 
   #
   # BAD example: depending on state -- offset not listed as a parameter
@@ -68,8 +68,7 @@ Every function you define must explicitly depend on the data it uses.
   }
 
 Unless <em>offset</em> is really a constant, the result of
-<tt>driver.compute(:area, :threads => n)</tt> is not well-defined
-for _n_ > 1.
+<tt>driver.compute(:area, n)</tt> is not well-defined for _n_ > 1.
 
 Just as depending on some changeable state is bad, it is likewise bad
 to affect a state (to produce a <em>side effect</em>).
@@ -83,12 +82,12 @@ to affect a state (to produce a <em>side effect</em>).
   }
 
 Given a tree where nodes are modifying _accumulator_, the end state of
-_accumulator_ is not well-defined.  Moreover if _accumulator_ is not
-thread-safe, the result will be even worse.
+_accumulator_ is not well-defined, even if _accumulator_ is a
+thread-safe object.
 
 Note however it is OK affect a state as long as <em>no other function
 depends on that state</em>.  This is the principle under which
-+comp_tree+ parallelizes Rake tasks (http://drake.rubyforge.org).
+CompTree parallelizes Rake tasks (http://drake.rubyforge.org).
 
 == Links
 

data/Rakefile

@@ -6,7 +6,7 @@ Jumpstart.new "comp_tree" do |s|
   s.developer "James M. Lawrence", "quixoticsycophant@gmail.com"
   s.rubyforge_user = "quix"
   s.rdoc_files = %w[
-    lib/comp_tree.rb
+    lib/comp_tree/comp_tree.rb
     lib/comp_tree/driver.rb
     lib/comp_tree/error.rb
   ]