extract_curves 0.0.1-i586-linux

data/ruby_libs/pav/search.rb

@@ -0,0 +1,210 @@
+require 'pav/heap'
+
+module PSearch
+
+def self.bsearch(arr, lm, start_i=0, end_i=nil) # &block = optional comparator
+	end_i = arr.length-1 if !end_i
+	if block_given?
+		while start_i < end_i
+			mid_i = (end_i + start_i) / 2
+			if (leg = yield(arr[mid_i], lm)) > 0
+				end_i = mid_i-1
+			elsif leg < 0
+				start_i = mid_i+1
+			else
+				return mid_i
+			end
+		end
+		if start_i == end_i
+			if (leg = yield(arr[start_i], lm)) == 0
+				return start_i
+			elsif leg > 0
+				return -start_i-1
+			else
+				return -start_i-2
+			end
+		end
+	else
+		while start_i < end_i
+			mid_i = (end_i + start_i) / 2
+			if (val = arr[mid_i]) > lm
+				end_i = mid_i-1
+			elsif val < lm
+				start_i = mid_i+1
+			else
+				return mid_i
+			end
+		end
+		if start_i == end_i
+			if arr[start_i] == lm
+				return start_i
+			elsif arr[start_i] > lm
+				return -start_i-1
+			else
+				return -start_i-2
+			end
+		end
+	end
+	-start_i-1
+end
+
+def self.path_cache_get_path(path_cache, start_pos, pos, get_pos_id_proc=nil)
+	#$PDbgLog.sig_call(self)
+	#$PDbgLog.print_msg "start_pos=#{start_pos}, pos=#{pos}: "
+#	$PDbgLog.print_msg "path_cache: #{path_cache.keys.sort.collect{|k|
+#		k.inspect+'=>[' + path_cache[k].join(', ') + ']'}.join('; ')}: "
+	res = []
+	if get_pos_id_proc
+		pos, to_link = *path_cache[get_pos_id_proc.call(pos)]
+		return res unless to_link
+		start_pos_id = get_pos_id_proc.call(start_pos)
+		while to_link
+			res << to_link
+			break if get_pos_id_proc.call(pos) == start_pos_id
+			pos, to_link = *path_cache[get_pos_id_proc.call(pos)]
+		end
+	else
+		pos, to_link = *path_cache[pos]
+		return res unless pos
+		while to_link
+			res << to_link
+			break if pos == start_pos
+			pos, to_link = *path_cache[pos]
+		end
+	end
+	#$PDbgLog.sig_return(res.join(' '))
+	res
+end
+
+# Wave (breadth) / Dijkstra search:
+def self.first_loop(start_pos, dest_proc, max_lev=1.0/0.0, get_pos_id_proc=nil)
+# &get_neighb_posns
+  #$PDbgLog.sig_call(self)
+  path_cache={}
+  tail = PMinHeap.new { |frm1,frm2| frm1[1] <=> frm2[1] }
+  if get_pos_id_proc
+	yield(start_pos, 0).each { |args| neighb, to_link, neighb_lev = *args
+		unless (path_cache.include?(get_pos_id_proc.call(neighb)) &&
+		path_cache[get_pos_id_proc.call(neighb)][2] <= neighb_lev) ||
+		neighb_lev > max_lev
+			tail.push([neighb, neighb_lev])
+			path_cache[get_pos_id_proc.call(neighb)] =
+				[start_pos, to_link, neighb_lev]
+		end
+	}
+	while !tail.empty?
+		#$PDbgLog.puts_msg "tail: " + tail.collect { |frm|
+		#  (frm[0] ? frm[0].coords_to_s : frm[0].inspect) +
+		#  ":#{frm[1]}" }.join(" ")
+		pos, lev = *tail.pop
+		next if (tmp=path_cache[get_pos_id_proc.call(pos)])&& tmp[2]<lev
+		if dest_proc.call(pos, lev)
+			(res = self.path_cache_get_path(path_cache, start_pos,
+				pos, get_pos_id_proc)).reverse!
+			#$PDbgLog.sig_return
+			return res
+		end
+		yield(pos, lev).each { |args| neighb, to_link,neighb_lev = *args
+			unless ((tmp=path_cache[get_pos_id_proc.call(neighb)])&&
+			tmp[2] <= neighb_lev) || neighb_lev > max_lev
+				tail.push([neighb, neighb_lev])
+				path_cache[get_pos_id_proc.call(neighb)] =
+					[pos, to_link, neighb_lev]
+			end
+		}
+	end
+	#$PDbgLog.sig_return("nil")
+	nil
+  else
+	yield(start_pos, 0).each { |args| neighb, to_link, neighb_lev = *args
+		unless (path_cache.include?(neighb) &&
+		path_cache[neighb][2] <= neighb_lev) || neighb_lev > max_lev
+			tail.push([neighb, neighb_lev])
+			path_cache[neighb] = [start_pos, to_link, neighb_lev]
+		end
+	}
+	while !tail.empty?
+		#$PDbgLog.puts_msg "tail: " + tail.collect { |frm|
+		#  (frm[0] ? frm[0].coords_to_s : frm[0].inspect) +
+		#  ":#{frm[1]}" }.join(" ")
+		pos, lev = *tail.pop
+		next if path_cache.include?(pos) && path_cache[pos][2] < lev
+		if dest_proc.call(pos, lev)
+			(res = self.path_cache_get_path(path_cache, start_pos,
+				pos)).reverse!
+			#$PDbgLog.sig_return
+			return res
+		end
+		yield(pos, lev).each { |args| neighb, to_link,neighb_lev = *args
+			unless (path_cache.include?(neighb) &&
+			path_cache[neighb][2] <= neighb_lev) ||
+			neighb_lev > max_lev
+				tail.push([neighb, neighb_lev])
+				path_cache[neighb] = [pos, to_link, neighb_lev]
+			end
+		}
+	end
+	#$PDbgLog.sig_return("nil")
+	nil
+  end
+end
+
+# Find a loop which functions without a repetition of a connection in the
+# _undirected_ graph of positions.
+def self.first_norep_loop(start_pos, max_lev=1.0/0.0, max_len=1.0/0.0,
+get_pos_id_proc=nil) # &get_neighb_posns
+  #$PDbgLog.sig_call(self)
+  tail = PMinHeap.new { |frm1,frm2| frm1[1] <=> frm2[1] }
+  get_pos_id_proc = proc { |a| a } unless get_pos_id_proc
+  start_pos_id = get_pos_id_proc.call(start_pos)
+  path_cache = {start_pos_id => [nil, nil, 0, -1]}
+  sol = nil
+	yield(start_pos, 0).each_with_index { |args, thr_i|
+		neighb, to_link, neighb_lev = *args
+		next if neighb_lev > max_lev
+		if (tmp=path_cache[get_pos_id_proc.call(neighb)])
+			len = tmp[2] + neighb_lev
+			if (!sol || sol[3] > len) && len <= max_len
+				sol = [neighb, start_pos, to_link, len]
+			end
+		else
+			tail.push([neighb, neighb_lev, thr_i])
+			path_cache[get_pos_id_proc.call(neighb)] =
+				[start_pos, to_link, neighb_lev, thr_i]
+		end
+	}
+	loop do
+		if sol
+			p1 = self.path_cache_get_path(path_cache, start_pos,
+				sol[0], get_pos_id_proc)
+			path_cache[get_pos_id_proc.call(sol[0])] = [sol[1],
+				sol[2]]
+			#$PDbgLog.sig_return
+			return [p1, self.path_cache_get_path(path_cache,
+			  	start_pos, sol[0], get_pos_id_proc), sol[3]]
+		end
+		if tail.empty?
+			#$PDbgLog.sig_return("nil")
+			return nil
+		end
+		pos, lev, thr_i = *tail.pop
+		next if (tmp=path_cache[get_pos_id_proc.call(pos)]) &&tmp[2]<lev
+		yield(pos, lev).each { |args| neighb, to_link,neighb_lev = *args
+			next if neighb_lev > max_lev ||
+				get_pos_id_proc.call(neighb) == start_pos_id
+			if (tmp=path_cache[get_pos_id_proc.call(neighb)]) &&
+			tmp[3] != thr_i
+				if (len=tmp[2] + neighb_lev) <= max_len &&
+				(!sol || sol[3] > len)
+					sol = [neighb, pos, to_link, len]
+				end
+			elsif !tmp || tmp[2] > neighb_lev
+				tail.push([neighb, neighb_lev, thr_i])
+				path_cache[get_pos_id_proc.call(neighb)] =
+					[pos, to_link, neighb_lev, thr_i]
+			end
+		}
+	end
+end
+
+end

data/ruby_libs/pav/set.rb

@@ -0,0 +1,20 @@
+require 'pav/search'
+
+class SortedArrSet
+	attr_reader :arr, :comparator
+	
+	def initialize(arr, &comparator)
+		@arr = arr
+		@comparator = comparator
+	end
+	
+	def include?(m)
+		PSearch.bsearch(@arr, m, &@comparator) >= 0
+	end
+	
+	alias_method :member?, :include?
+	
+	def method_missing(id, *args, &block)
+		@arr.send(id, *args, &block)
+	end
+end

data/ruby_libs/pav/string/CVS/Entries

@@ -0,0 +1,6 @@
+/bits.rb/1.1.1.1/Tue Nov 15 17:32:41 2005//
+/ext.rb/1.1.1.1/Tue Nov 15 17:32:40 2005//
+/observable.rb/1.1.1.1/Tue Nov 15 17:32:41 2005//
+/text.rb/1.1.1.1/Tue Nov 15 17:32:41 2005//
+/words.rb/1.1.1.1/Tue Nov 15 17:32:40 2005//
+D

data/ruby_libs/pav/string/CVS/Repository

@@ -0,0 +1 @@
+extract-curves/ruby_libs/pav/string

data/ruby_libs/pav/string/CVS/Root

@@ -0,0 +1 @@
+:ext:pavpen@rubyforge.org:/var/cvs/extract-curves