build-graph 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 93ccee936d5902138b3cd45b565d8dfa20a477d6
+  data.tar.gz: 221ef37fa2440af4b5b12be9cc209402c741096d
+SHA512:
+  metadata.gz: 3bebcf37fa8a68d1f602317d39af3fbe778687baea8cd9fc1fdbe93df20ea1964402183aa052b166557293fea0eeefb183c27735e46dd7a5261a2b8fb7483b16
+  data.tar.gz: cb91ae793eaa9ae002060d3bc407255376a4a5a3a7592fb0912d306a4a972ef872c77b9ac9a4ca0f192503ee926e1f1c7a0e868cf3a31514ae73e39af669b6fe

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in build.gemspec
+gemspec

data/README.md

@@ -0,0 +1,53 @@
+# Build::Graph
+
+Build::Graph is a framework for build systems, with specific functionality for dealing with file based processes.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'build-graph'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install build-graph
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request
+
+## License
+
+Released under the MIT license.
+
+Copyright, 2012, 2014, by [Samuel G. D. Williams](http://www.codeotaku.com/samuel-williams).
+
+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.

data/Rakefile

@@ -0,0 +1,9 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new do |t|
+	t.libs << 'test'
+end
+
+desc "Run tests"
+task :default => :test

data/build-graph.gemspec

@@ -0,0 +1,28 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'build/version'
+
+Gem::Specification.new do |spec|
+	spec.name          = "build-graph"
+	spec.version       = Build::VERSION
+	spec.authors       = ["Samuel Williams"]
+	spec.email         = ["samuel.williams@oriontransfer.co.nz"]
+	spec.summary       = %q{Build::Graph is a framework for build systems, with specific functionality for dealing with file based processes.}
+	spec.description   = <<-EOF
+	Build::Graph is a framework for managing file-system based build processes. It provides graph based build functionality which monitors the file-system for changes. Because of this, it can efficiently manage large and complex process based builds.
+	EOF
+	spec.homepage      = ""
+	spec.license       = "MIT"
+
+	spec.files         = `git ls-files`.split($/)
+	spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+	spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+	spec.require_paths = ["lib"]
+
+	spec.add_dependency "system"
+	spec.add_dependency "rainbow"
+
+	spec.add_development_dependency "bundler", "~> 1.3"
+	spec.add_development_dependency "rake"
+end

data/lib/build.rb

@@ -0,0 +1,5 @@
+require "build/version"
+
+module Build
+	
+end

data/lib/build/edge.rb

@@ -0,0 +1,49 @@
+
+require 'build/error'
+
+module Build
+	# Represents an input to a graph node, with count inputs.
+	class Edge
+		def initialize(count = 0)
+			@fiber = Fiber.current
+			@count = count
+			
+			@failed = []
+		end
+		
+		attr :failed
+		
+		attr :fiber
+		attr :count
+		
+		def wait
+			if @count > 0
+				Fiber.yield
+			end
+			
+			failed?
+		end
+		
+		attr :failed
+		
+		def failed?
+			@failed.size != 0
+		end
+		
+		def traverse(node)
+			@count -= 1
+			
+			if node.failed?
+				@failed << node
+			end
+			
+			if @count == 0
+				@fiber.resume
+			end
+		end
+		
+		def increment!
+			@count += 1
+		end
+	end
+end

data/lib/build/error.rb

@@ -0,0 +1,18 @@
+
+
+module Build
+	class TransientError < StandardError
+	end
+	
+	class CommandFailure < TransientError
+		def initialize(command, status)
+			super "Command #{command.inspect} failed with exit status #{status}!"
+		
+			@command = command
+			@status = status
+		end
+	
+		attr :command
+		attr :status
+	end
+end

data/lib/build/files.rb

@@ -0,0 +1,273 @@
+# Copyright, 2014, 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 'set'
+require 'pathname'
+
+module Build
+	module Files
+		class List
+			include Enumerable
+		
+			def +(list)
+				Composite.new([self, list])
+			end
+		
+			def intersects? other
+				other.any?{|path| include?(path)}
+			end
+		
+			def rebase(root)
+				raise NotImplementedError
+			end
+		
+			def to_paths
+				relative_paths = self.each do |path|
+					path.relative_path
+				end
+			
+				return Paths.new(@root, relative_paths)
+			end
+		
+			def match(pattern)
+				all? {|path| path.match(pattern)}
+			end
+		end
+		
+		class RelativePath < String
+			# Both paths must be full absolute paths, and path must have root as an prefix.
+			def initialize(path, root)
+				raise ArgumentError.new("#{root} is not a prefix of #{path}") unless path.start_with?(root)
+			
+				super path
+			
+				@root = root
+			end
+		
+			attr :root
+		
+			def relative_path
+				self.slice(@root.length..-1)
+			end
+		end
+	
+		class Directory < List
+			def initialize(root, path = "")
+				@root = root.to_s
+				@path = path
+			end
+		
+			attr :root
+			attr :path
+		
+			def full_path
+				File.join(@root, @path)
+			end
+		
+			def each(&block)
+				Dir.glob(full_path + "**/*").each do |path|
+					yield RelativePath.new(path, @root)
+				end
+			end
+		
+			def roots
+				[full_path]
+			end
+		
+			def eql?(other)
+				other.kind_of?(self.class) and @root.eql?(other.root) and @path.eql?(other.path)
+			end
+		
+			def hash
+				[@root, @path].hash
+			end
+		
+			def include?(path)
+				# Would be true if path is a descendant of full_path.
+				path.start_with?(full_path)
+			end
+		
+			def rebase(root)
+				self.class.new(root, @path)
+			end
+		end
+	
+		class Glob < List
+			def initialize(root, pattern)
+				@root = root.to_s
+				@pattern = pattern
+			end
+	
+			attr :root
+			attr :pattern
+		
+			def full_pattern
+				File.join(@root, @pattern)
+			end
+		
+			# Enumerate all paths matching the pattern.
+			def each(&block)
+				Dir.glob(full_pattern).each do |path|
+					yield RelativePath.new(path, @root)
+				end
+			end
+	
+			def roots
+				[@root]
+			end
+		
+			def eql?(other)
+				other.kind_of?(self.class) and @root.eql?(other.root) and @pattern.eql?(other.pattern)
+			end
+		
+			def hash
+				[@root, @pattern].hash
+			end
+		
+			def include?(path)
+				File.fnmatch(full_pattern, path)
+			end
+		
+			def rebase(root)
+				self.class.new(root, @pattern)
+			end
+		end
+	
+		class Paths < List
+			def initialize(root, paths)
+				@root = root.to_s
+				@paths = Array(paths)
+			end
+	
+			attr :paths
+	
+			def each(&block)
+				@paths.each do |path|
+					full_path = File.join(@root, path)
+					yield RelativePath.new(full_path, @root)
+				end
+			end
+	
+			def roots
+				[@root]
+			end
+		
+			def eql? other
+				other.kind_of?(self.class) and @paths.eql?(other.paths)
+			end
+		
+			def hash
+				@paths.hash
+			end
+		
+			def include?(path)
+				# Compute a full relative path:
+				full_path = File.absolute_path(path, @root)
+				
+				# If the full path starts with @root, test it for inclusion:
+				if full_path.start_with? @root
+					# Compute the relative component:
+					relative_path = full_path[@root.length..-1]
+					
+					# Does this list of paths include it?
+					return @paths.include?(relative_path)
+				else
+					return false
+				end
+			end
+		
+			def rebase(root)
+				self.class.new(root, @paths)
+			end
+		
+			def to_paths
+				return self
+			end
+		end
+	
+		class Composite < List
+			def initialize(files = Set.new)
+				@files = files
+			end
+		
+			attr :files
+		
+			def each(&block)
+				@files.each do |files|
+					files.each &block
+				end
+			end
+		
+			def roots
+				@files.collect(&:roots).flatten.uniq
+			end
+		
+			def eql?(other)
+				other.kind_of?(self.class) and @files.eql?(other.files)
+			end
+		
+			def hash
+				@files.hash
+			end
+		
+			def merge(list)
+				if list.kind_of? Composite
+					@files += list.files
+				elsif list.kind_of? List
+					@files << list
+				else
+					raise ArgumentError.new("Cannot merge non-list of file paths.")
+				end
+			end
+		
+			def +(list)
+				if list.kind_of? Composite
+					Composite.new(@files + list.files)
+				else
+					Composite.new(@files + [list])
+				end
+			end
+		
+			def include?(path)
+				@files.any? {|list| list.include?(path)}
+			end
+		
+			def rebase(root)
+				self.class.new(@files.collect{|list| list.rebase(root)})
+			end
+		
+			def to_paths
+				Composite.new(@files.collect(&:to_paths))
+			end
+		
+			def self.[](files)
+				if files.size == 0
+					return None
+				elsif files.size == 1
+					files.first
+				else
+					self.class.new(files)
+				end
+			end
+		end
+	
+		NONE = Composite.new
+	end
+end