npgrt 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 444d0978a8020feaefb2a5e0adcad3e4c161d8d3
-  data.tar.gz: c771aeaef308edf04c7005103865d61011fcae85
+  metadata.gz: 7b4a63c69e53e5b3931b1190c18a36d97609e815
+  data.tar.gz: 05368d350a9eed5f83e360da4302abe2429c633f
 SHA512:
-  metadata.gz: 1145e1cfcfa9a752eab716013492a6df6a711de972f2dc61cecfb1e5eb62a5bc5d50082da70926bd98fa233c33fbd9e318d40f046cbb79e45e97957e96ecb118
-  data.tar.gz: 9a1303dd3ef1be63407acf1e16e2a9671eb237b025c739798fe8a3aa8533af764c4414e09840d6767b48094cf4ff78633416d2c521c524a38d4d17401b55e3f3
+  metadata.gz: 7fc1519805172f33d646f83fee5c8a6a22f46c13726ea8a7df4f8f2c21e492f1f84a7f92c7aff602dd45077b3618541bf939362f9304fdddd938309fc721d8c6
+  data.tar.gz: ab0cb7fa3460e9565c44c2d953e3d1e7929e33600e10dc39fd195ec422aa91fdf3a3cd000279d15bf83315ab4d425a12b2e02e375570bfdcb2f8870216c656a6

data/lib/npgrt.rb

@@ -1,5 +1,16 @@
 require "npgrt/version"
 require 'npgrt/win32api'
 require 'npgrt/message'
+require 'npgrt/filesystem'
 require 'npgrt/require'
-
+require 'npgrt/algorithm'
+require 'npgrt/find'
+require 'npgrt/report'
+module NPGRT
+	extend Win32API
+	extend Message
+	extend FileSystem
+	extend Require
+	extend Algorithm
+	extend Find
+end

data/lib/npgrt.rb~

@@ -1,4 +1,16 @@
 require "npgrt/version"
+require 'npgrt/win32api'
 require 'npgrt/message'
+require 'npgrt/filesystem'
 require 'npgrt/require'
-
+require 'npgrt/algorithm'
+require 'npgrt/find'
+require 'npgrt/report'
+module NPGRT
+	extend Win32API
+	extend Message
+	extend FileSystem
+	extend Require
+	extend Algorithm
+	extend Find
+end

data/lib/npgrt/algorithm.rb

@@ -0,0 +1,178 @@
+module NPGRT
+	module Algorithm
+		def dfs(start, &b)
+			yield(lambda{|v| dfs(v, &b)}, start)
+		end
+
+		def bfs(*start)
+			yield(start.method(:push), start.shift)	until start.empty?
+		end
+
+		def array_to_hash(arr)
+			hsh = {}
+			arr.each_with_index{|e, i| hsh[i] = e if e}
+			hsh	
+		end
+
+		def hash_to_array(hsh)
+			arr = []
+			hsh.each{|k, v| arr[k] = v}
+			arr
+		end
+
+		class AlgorithmError < StandardError; end
+		class CycleFound < StandardError; end
+		class NotFound < StandardError; end
+		def graph_buildpath(st, ed, pre)
+			ret = []
+			while ed != st && ed != -1
+				raise CycleFound, 'path cycled' if ret.include?(ed)
+				ret.unshift ed
+				ed = pre[ed]
+			end	
+			if ed == st
+				ret.unshift st
+			else
+				raise NotFound
+			end	
+			ret		
+		end
+
+
+		class Graph
+			attr_accessor :adjlist, :adjmat
+
+			RelaxOperators = Struct.new(:add, :min, :maxvalue)
+			DefaultRelax = RelaxOperators.new(
+				lambda{|a, b| a + b},
+				lambda{|a, b| [a,b].min},
+				Float::INFINITY
+			)
+
+			def adjlist
+				@adjlist ||= adjmat.map(&NPGRT.method(:array_to_hash))
+			end
+			def adjmat
+				@adjmat ||= adjlist.map(&NPGRT.method(:hash_to_array))
+			end
+			def floyd!(relax = DefaultRelax)
+				a = adjmat
+				n = adjmat.size
+				self.adjlist = nil #reset
+				(0...n).each{|k|
+					(0...n).each{|i|
+						next if i == k
+						next if a[i][k] == nil
+						(0...n).each{|j|
+							next if j == k || j == i
+						        next if a[i][k] == nil || a[k][j] == nil
+							if !a[i][j]
+								a[i][j] = relax.add[ a[i][k], a[k][j] ]
+							else	
+								a[i][j] = relax.min[
+									a[i][j],
+							       		relax.add[a[i][k], a[k][j] ] 
+
+								]
+							end
+						}
+					}
+				}
+				self
+			end
+
+			def floyd
+				deepcopy_adjmat.floyd!
+			end
+
+			def bellman_ford(start = [0], relax = DefaultRelax)
+				a   = self.adjlist
+				dis = a.map { relax.maxvalue }
+				pre = a.map { -1 }
+				start.each{|i| dis[i] = 0; pre[i] = i }
+				n   = a.size
+				(n-1).times{
+					relaxed = false
+					each_edge do |u, v, w|
+							next if w == nil
+							rel = relax.add[ dis[u] , w]
+							if rel == relax.min[ rel, dis[v] ]
+								dis[v] = rel
+								pre[v] = u
+								relaxed = true
+							end
+					end	
+					break if !relaxed
+				}
+				[dis, pre]
+			end
+
+			def spfa(start = [0], relax = DefaultRelax)
+				a   = self.adjlist
+				dis = a.map { relax.maxvalue }
+				pre = a.map { -1 }
+				inq = []
+				start.each{|i| dis[i] = 0; pre[i] = i; inq[i] = true }
+				n   = a.size
+				
+				NPGRT.bfs *start do |yielder, u|
+					inq[u] = false
+					a[u].each do |v, w|
+						next if w == nil
+						rel = relax.add[ dis[u] , w]
+						if rel == relax.min[ rel, dis[v] ]
+							dis[v] = rel
+							pre[v] = u
+							if !inq[v]
+								inq[v] = true
+								yielder.call v
+							end
+						end 
+					end
+				end
+
+				[dis, pre]
+			end
+
+			def each_edge(start = (0...adjlist.size))
+				start.each{|u| self.adjlist[u].each{|v, w|
+					yield u, v, w
+				}}
+			end
+
+			def toposort
+				x = self.adjlist
+				id = x.map { 0 }
+			 	each_edge{|u, v, w| id[v] += 1 if w}
+				n = x.size
+				ret = []
+				while true
+				   a = (0...n).select{|u| id[u] == 0} - ret
+				   break if a == []
+				   ret.concat a
+				   each_edge a do |u, v, w|
+ 					id[v] -= 1 if w
+				   end
+				end
+				raise CycleFound, 'in toposorting' if ret.size != n
+				ret
+			end
+			
+			def deepcopy_adjmat
+				x = Graph.new
+				x.adjmat = Marshal.load Marshal.dump adjmat
+				x.adjlist = nil
+				x
+			end
+
+			def deepcopy_adjlist
+				x = Graph.new
+				x.adjlist = Marshal.load Marshal.dump adjlist
+				x.adjmat  = nil
+				x
+			end
+		end
+	end
+end
+
+

data/lib/npgrt/algorithm.rb~

@@ -0,0 +1,179 @@
+module NPGRT
+	module Algorithm
+		def dfs(start, &b)
+			yield(lambda{|v| dfs(v, &b)}, start)
+		end
+
+		def bfs(*start)
+			yield(start.method(:push), start.shift)	until start.empty?
+		end
+
+		def array_to_hash(arr)
+			hsh = {}
+			arr.each_with_index{|e, i| hsh[i] = e if e}
+			hsh	
+		end
+
+		def hash_to_array(hsh)
+			arr = []
+			hsh.each{|k, v| arr[k] = v}
+			arr
+		end
+
+		class AlgorithmError < StandardError; end
+		class CycleFound < StandardError; end
+		class NotFound < StandardError; end
+		def graph_buildpath(st, ed, pre)
+			ret = []
+			while ed != st && ed != -1
+				raise CycleFound, 'path cycled' if ret.include?(ed)
+				ret.unshift ed
+				ed = pre[ed]
+			end	
+			if ed == st
+				ret.unshift st
+			else
+				raise NotFound
+			end	
+			ret		
+		end
+
+
+		class Graph
+			attr_accessor :adjlist, :adjmat
+
+			RelaxOperators = Struct.new(:add, :min, :maxvalue)
+			DefaultRelax = RelaxOperators.new(
+				lambda{|a, b| a + b},
+				lambda{|a, b| [a,b].min},
+				Float::INFINITY
+			)
+
+			def adjlist
+				@adjlist ||= adjmat.map(&NPGRT.method(:array_to_hash))
+			end
+			def adjmat
+				@adjmat ||= adjlist.map(&NPGRT.method(:hash_to_array))
+			end
+			def floyd!(relax = DefaultRelax)
+				a = adjmat
+				n = adjmat.size
+				self.adjlist = nil #reset
+				(0...n).each{|k|
+					(0...n).each{|i|
+						next if i == k
+						next if a[i][k] == nil
+						(0...n).each{|j|
+							next if j == k || j == i
+						        next if a[i][k] == nil || a[k][j] == nil
+							if !a[i][j]
+								a[i][j] = relax.add[ a[i][k], a[k][j] ]
+							else	
+								a[i][j] = relax.min[
+									a[i][j],
+							       		relax.add[a[i][k], a[k][j] ] 
+
+								]
+							end
+						}
+					}
+				}
+				self
+			end
+
+			def floyd
+				deepcopy_adjmat.floyd!
+			end
+
+			def bellman_ford(start = [0], relax = DefaultRelax)
+				a   = self.adjlist
+				dis = a.map { relax.maxvalue }
+				pre = a.map { -1 }
+				start.each{|i| dis[i] = 0; pre[i] = i }
+				n   = a.size
+				(n-1).times{
+					relaxed = false
+					each_edge do |u, v, w|
+							next if w == nil
+							rel = relax.add[ dis[u] , w]
+							if rel == relax.min[ rel, dis[v] ]
+								dis[v] = rel
+								pre[v] = u
+								relaxed = true
+							end
+					end	
+					break if !relaxed
+				}
+				[dis, pre]
+			end
+
+			def spfa(start = [0], relax = DefaultRelax)
+				a   = self.adjlist
+				dis = a.map { relax.maxvalue }
+				pre = a.map { -1 }
+				inq = []
+				start.each{|i| dis[i] = 0; pre[i] = i; inq[i] = true }
+				n   = a.size
+				
+				NPGRT.bfs *start do |yielder, u|
+					inq[u] = false
+					a[u].each do |v, w|
+						next if w == nil
+						rel = relax.add[ dis[u] , w]
+						if rel == relax.min[ rel, dis[v] ]
+							dis[v] = rel
+							pre[v] = u
+							if !inq[v]
+								inq[v] = true
+								yielder.call v
+							end
+						end 
+					end
+				end
+
+				[dis, pre]
+			end
+
+			def each_edge(start = (0...adjlist.size))
+				start.each{|u| self.adjlist[u].each{|v, w|
+					yield u, v, w
+				}}
+			end
+
+			def toposort
+				x = self.adjlist
+				id = x.map { 0 }
+			 	each_edge{|u, v, w| id[v] += 1 if w}
+				n = x.size
+				ret = []
+				while true
+				   a = (0...n).select{|u| id[u] == 0} - ret
+				   break if a == []
+				   ret.concat a
+				   each_edge a do |u, v, w|
+ 					id[v] -= 1 if w
+				   end
+				end
+				raise CycleFound, 'in toposorting' if ret.size != n
+				ret
+			end
+			
+			def deepcopy_adjmat
+				x = Graph.new
+				x.adjmat = Marshal.load Marshal.dump adjmat
+				x.adjlist = nil
+				x
+			end
+
+			def deepcopy_adjlist
+				x = Graph.new
+				x.adjlist = Marshal.load Marshal.dump adjlist
+				x.adjmat  = nil
+				x
+			end
+		end
+	end
+	extend Algorithm
+end
+
+

data/lib/npgrt/filesystem.rb

@@ -0,0 +1,8 @@
+module NPGRT
+	module FileSystem
+		def normalize_pathsep_os(path)
+			path.tr("/", "\\")
+		end
+	end
+
+end

data/lib/npgrt/filesystem.rb~

@@ -0,0 +1,9 @@
+module NPGRT
+	module FileSystem
+		def normalize_pathsep_os(path)
+			path.tr("/", "\\")
+		end
+	end
+
+	extend FileSystem
+end

data/lib/npgrt/find.rb

@@ -0,0 +1,31 @@
+module NPGRT
+	module Find
+		extend self
+		private 
+		def each_path
+			ENV['path'].split(";").each{|x|
+				yield x
+			}
+		end
+		public 
+		
+		def binary(name)
+			each_path do |path|
+				v = File.join(path, name)
+				return NPGRT.normalize_pathsep_os(v) if FileTest.file?(v)
+			end
+			Gem.find_files(name).each do |v|
+				return NPGRT.normalize_pathsep_os(v) if FileTest.file?(v)
+			end
+
+			nil
+		end	
+		def hostruby
+			binary("ruby.exe")
+		end
+
+		
+	end
+
+
+end