build-graph 0.3.6 → 0.3.7

data/spec/build/graph/inherit_spec.rb

@@ -0,0 +1,56 @@
+#!/usr/bin/env rspec
+# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
+# 
+# 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.
+
+require 'build/graph/walker'
+require 'build/graph/task'
+require 'build/files'
+
+module Build::Graph::InheritSpec
+	include Build::Graph
+	include Build::Files
+	
+	describe Build::Graph::Walker do
+		it "should inherit children outputs", :focus do
+			test_glob = Glob.new(__dir__, "*.rb")
+			listing_output = Paths.directory(__dir__, ["listing.txt"])
+			
+			node_a = Node.new(Paths::NONE, :inherit, "a")
+			node_b = Node.new(test_glob, listing_output, "b")
+			
+			walker = Walker.new do |walker, node|
+				task = Task.new(walker, node)
+				
+				task.visit do
+					if node.process == 'a'
+						task.invoke(node_b)
+					end
+				end
+			end
+			
+			walker.update([node_a])
+			
+			task_a = walker.tasks[node_a]
+			task_b = walker.tasks[node_b]
+			
+			expect(task_a.outputs.to_a).to be == task_b.outputs.to_a
+		end
+	end
+end

data/spec/build/graph/node_spec.rb

@@ -0,0 +1,68 @@
+#!/usr/bin/env rspec
+# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
+# 
+# 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.
+
+require 'build/graph/node'
+require 'build/files/glob'
+require 'build/files/path/filesystem'
+
+module Build::Graph::NodeSpec
+	include Build::Graph
+	include Build::Files
+	
+	describe Build::Graph::Node do
+		it "should be unique" do
+			test_glob = Glob.new(__dir__, "*.rb")
+			listing_output = Paths.directory(__dir__, ["listing.txt"])
+			
+			node_a = Node.new(test_glob, listing_output, "a")
+			node_b = Node.new(listing_output, Paths::NONE, "b")
+			
+			expect(node_a).to be_eql node_a
+			expect(node_a).to_not be_eql node_b
+			
+			node_c = Node.new(test_glob, listing_output, "a")
+			
+			expect(node_a).to be_eql node_c
+		end
+		
+		it "should be dirty" do
+			test_glob = Glob.new(__dir__, "*.rb")
+			listing_output = Paths.directory(__dir__, ["listing.txt"])
+			
+			node_a = Node.new(test_glob, listing_output, "a")
+			
+			expect(node_a.dirty?).to be true
+		end
+		
+		it "should be clean" do
+			test_glob = Glob.new(__dir__, "*.rb")
+			listing_output = Paths.directory(__dir__, ["listing.txt"])
+			
+			listing_output.first.touch
+			
+			node_a = Node.new(test_glob, listing_output, "a")
+			
+			expect(node_a.dirty?).to be false
+			
+			listing_output.first.delete
+		end
+	end
+end

data/spec/build/graph/task_spec.rb

@@ -0,0 +1,66 @@
+#!/usr/bin/env rspec
+# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
+# 
+# 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.
+
+require 'build/graph/node'
+require 'build/graph/walker'
+require 'build/graph/task'
+require 'build/files/glob'
+
+module Build::Graph::TaskSpec
+	include Build::Graph
+	include Build::Files
+	
+	describe Build::Graph::Task do
+		it "should wait for children" do
+			node_a = Node.new(Paths::NONE, Paths::NONE, "a")
+			node_b = Node.new(Paths::NONE, Paths::NONE, "b")
+			
+			nodes = Set.new([node_a])
+			
+			sequence = []
+			
+			# A walker runs repeatedly, updating tasks which have been marked as dirty.
+			walker = Walker.new do |walker, node|
+				task = Task.new(walker, node)
+				
+				task.visit do
+					sequence << node.process.upcase
+					
+					if node.process == 'a'
+						# This will invoke node_b concurrently, but as it is a child, task.visit won't finish until node_b is done.
+						task.invoke(node_b)
+					end
+				end
+				
+				sequence << node.process
+			end
+			
+			walker.update(nodes)
+			
+			expect(walker.tasks.count).to be == 2
+			expect(walker.failed_tasks.count).to be == 0
+			
+			task_b = walker.tasks[node_b]
+			expect(walker.tasks[node_a].children).to be == [task_b]
+			expect(sequence).to be == ['A', 'B', 'b', 'a']
+		end
+	end
+end

data/spec/build/graph/walker_spec.rb

@@ -0,0 +1,93 @@
+#!/usr/bin/env rspec
+# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
+# 
+# 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.
+
+require 'build/graph/node'
+require 'build/graph/walker'
+require 'build/graph/task'
+require 'build/files/glob'
+
+module Build::Graph::WalkerSpec
+	include Build::Graph
+	include Build::Files
+	
+	describe Build::Graph::Walker do
+		it "should be unique" do
+			test_glob = Glob.new(__dir__, "*.rb")
+			listing_output = Paths.directory(__dir__, ["listing.txt"])
+			
+			node_a = Node.new(test_glob, listing_output, "a")
+			node_b = Node.new(listing_output, Paths::NONE, "b")
+			
+			nodes = Set.new([node_a, node_b])
+			
+			sequence = []
+			
+			# A walker runs repeatedly, updating tasks which have been marked as dirty.
+			walker = Walker.new do |walker, node|
+				task = Task.new(walker, node)
+				
+				task.visit do
+					sequence << node.process
+				end
+			end
+			
+			walker.update(nodes)
+			
+			expect(walker.tasks.count).to be == 2
+			expect(walker.failed_tasks.count).to be == 0
+			expect(sequence).to be == ['a', 'b']
+		end
+		
+		it "should cascade failure" do
+			test_glob = Glob.new(__dir__, "*.rb")
+			listing_output = Paths.directory(__dir__, ["listing.txt"])
+			summary_output = Paths.directory(__dir__, ["summary.txt"])
+			
+			node_a = Node.new(test_glob, listing_output, "a")
+			node_b = Node.new(listing_output, summary_output, "b")
+			
+			nodes = Set.new([node_a, node_b])
+			
+			# A walker runs repeatedly, updating tasks which have been marked as dirty.
+			walker = Walker.new do |walker, node|
+				task = Task.new(walker, node)
+				
+				task.visit do
+					if node.process == 'a'
+						raise TransientError.new('Test Failure')
+					end
+				end
+			end
+			
+			walker.update(nodes)
+			
+			expect(walker.tasks.count).to be == 2
+			expect(walker.failed_tasks.count).to be == 2
+			expect(listing_output).to be_intersect walker.failed_outputs
+			expect(summary_output).to be_intersect walker.failed_outputs
+			
+			walker.clear_failed
+			
+			expect(walker.tasks.count).to be == 0
+			expect(walker.failed_tasks.count).to be == 0
+		end
+	end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: build-graph
 version: !ruby/object:Gem::Version
-  version: 0.3.6
+  version: 0.3.7
 platform: ruby
 authors:
 - Samuel Williams
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-02-24 00:00:00.000000000 Z
+date: 2015-04-21 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: process-group
@@ -30,14 +30,14 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.3.0
+        version: 0.3.3
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.3.0
+        version: 0.3.3
 - !ruby/object:Gem::Dependency
   name: system
   requirement: !ruby/object:Gem::Requirement
@@ -100,14 +100,14 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.2.0
+        version: 0.3.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.2.0
+        version: 0.3.0
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
@@ -143,14 +143,19 @@ files:
 - lib/build/graph/edge.rb
 - lib/build/graph/error.rb
 - lib/build/graph/node.rb
+- lib/build/graph/task.rb
 - lib/build/graph/version.rb
 - lib/build/graph/walker.rb
 - spec/build/graph/graph_spec.rb
+- spec/build/graph/inherit_spec.rb
+- spec/build/graph/node_spec.rb
 - spec/build/graph/program/Benchmark.cpp
 - spec/build/graph/program/Benchmark.h
 - spec/build/graph/program/DictionarySort.h
 - spec/build/graph/program/ParallelMergeSort.h
 - spec/build/graph/program/main.cpp
+- spec/build/graph/task_spec.rb
+- spec/build/graph/walker_spec.rb
 homepage: ''
 licenses:
 - MIT
@@ -178,9 +183,12 @@ summary: Build::Graph is a framework for build systems, with specific functional
   for dealing with file based processes.
 test_files:
 - spec/build/graph/graph_spec.rb
+- spec/build/graph/inherit_spec.rb
+- spec/build/graph/node_spec.rb
 - spec/build/graph/program/Benchmark.cpp
 - spec/build/graph/program/Benchmark.h
 - spec/build/graph/program/DictionarySort.h
 - spec/build/graph/program/ParallelMergeSort.h
 - spec/build/graph/program/main.cpp
-has_rdoc: 
+- spec/build/graph/task_spec.rb
+- spec/build/graph/walker_spec.rb