build-graph 2.1.0 → 2.2.0

data/spec/build/graph/task_spec.rb

@@ -1,69 +0,0 @@
-#!/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'
-
-require_relative 'process_graph'
-
-RSpec.describe Build::Graph::Task do
-	it "should wait for children" do
-		node_a = Build::Graph::Node.new(Build::Files::Paths::NONE, Build::Files::Paths::NONE)
-		node_b = Build::Graph::Node.new(Build::Files::Paths::NONE, :inherit)
-		
-		nodes = Set.new([node_a])
-		
-		sequence = []
-		
-		# A walker runs repeatedly, updating tasks which have been marked as dirty.
-		walker = Build::Graph::Walker.new do |walker, node|
-			task = Build::Graph::Task.new(walker, node)
-			
-			task.visit do
-				sequence << [:entered, node]
-				
-				if node == node_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 << [:exited, node]
-		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 == [
-			[:entered, node_a],
-			[:entered, node_b],
-			[:exited, node_b],
-			[:exited, node_a]
-		]
-	end
-end

data/spec/build/graph/walker_spec.rb

@@ -1,125 +0,0 @@
-#!/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'
-
-RSpec.describe Build::Graph::Walker do
-	it "can generate the same output from multiple tasks" do
-		test_glob = Build::Files::Glob.new(__dir__, "*.rb")
-		listing_output = Build::Files::Paths.directory(__dir__, ["listing.txt"])
-		
-		node_a = Build::Graph::Node.new(test_glob, listing_output)
-		node_b = Build::Graph::Node.new(Build::Files::Paths::NONE, listing_output)
-		
-		sequence = []
-		
-		# A walker runs repeatedly, updating tasks which have been marked as dirty.
-		walker = Build::Graph::Walker.new do |walker, node|
-			task = Build::Graph::Task.new(walker, node)
-			
-			task.visit do
-				if node == node_a
-					task.invoke(node_b)
-				end
-				
-				node.outputs.each do |output|
-					output.touch
-				end
-				
-				sequence << node
-			end
-		end
-		
-		edge = double()
-		walker.outputs[listing_output.first.to_s] ||= [edge]
-		expect(edge).to receive(:traverse)
-		
-		walker.update([node_a, node_a])
-		
-		expect(walker.tasks.count).to be == 2
-		expect(walker.failed_tasks.count).to be == 0
-		expect(sequence).to be == [node_b, node_a]
-	end
-	
-	it "should be unique" do
-		test_glob = Build::Files::Glob.new(__dir__, "*.rb")
-		listing_output = Build::Files::Paths.directory(__dir__, ["listing.txt"])
-		
-		node_a = Build::Graph::Node.new(test_glob, listing_output)
-		node_b = Build::Graph::Node.new(listing_output, Build::Files::Paths::NONE)
-		
-		sequence = []
-		
-		# A walker runs repeatedly, updating tasks which have been marked as dirty.
-		walker = Build::Graph::Walker.new do |walker, node|
-			task = Build::Graph::Task.new(walker, node)
-			
-			task.visit do
-				node.outputs.each do |output|
-					output.touch
-				end
-				
-				sequence << node
-			end
-		end
-		
-		walker.update([node_a, node_b])
-		
-		expect(walker.tasks.count).to be == 2
-		expect(walker.failed_tasks.count).to be == 0
-		expect(sequence).to be == [node_a, node_b]
-	end
-	
-	it "should cascade failure" do
-		test_glob = Build::Files::Glob.new(__dir__, "*.rb")
-		listing_output = Build::Files::Paths.directory(__dir__, ["listing.txt"])
-		summary_output = Build::Files::Paths.directory(__dir__, ["summary.txt"])
-		
-		node_a = Build::Graph::Node.new(test_glob, listing_output)
-		node_b = Build::Graph::Node.new(listing_output, summary_output)
-		
-		# A walker runs repeatedly, updating tasks which have been marked as dirty.
-		walker = Build::Graph::Walker.new do |walker, node|
-			task = Build::Graph::Task.new(walker, node)
-			
-			task.visit do
-				if node == node_a
-					raise Build::Graph::TransientError.new('Test Failure')
-				end
-			end
-		end
-		
-		walker.update([node_a, node_b])
-		
-		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

data/spec/spec_helper.rb

@@ -1,13 +0,0 @@
-
-require 'covered/rspec'
-
-RSpec.configure do |config|
-	config.disable_monkey_patching!
-	
-	# Enable flags like --only-failures and --next-failure
-	config.example_status_persistence_file_path = ".rspec_status"
-
-	config.expect_with :rspec do |c|
-		c.syntax = :expect
-	end
-end