rdx 0.9.0.pre

data/examples/ruby-2.0.0-p0/install/stdlib/.rdx

@@ -0,0 +1,6 @@
+
+RDX::Specification.new do
+	use_convention :result_indicative
+	use_convention :result_inspect
+	use_convention :numeric_inspect
+end

data/examples/ruby-2.0.0-p0/install/stdlib/README

@@ -0,0 +1,19 @@
+
+Directory structure:
+
+stdlib
+  |- README (this file)
+  |
+  |- orig
+  |    + Original (Ruby 2.0.0p0) files (Ruby sources)
+  |
+  |- patched
+  |    + Patched files (RDX works correctly on these)
+  | 
+  |- rakefile
+  |    Allows an easy interface for running RDX.
+  |    The most useful action is to run
+  |      rake rdx
+  |
+  +- .rdx
+       Contains the RDX::Specification

data/examples/ruby-2.0.0-p0/install/stdlib/Rakefile

@@ -0,0 +1,53 @@
+
+require 'rubygems'
+require 'rake'
+require 'pathname'
+
+OLD = 'orig'
+NEW = 'patched'
+RDX_ROOT = Pathname(__FILE__).dirname.dirname.dirname.dirname + 'lib'
+$LOAD_PATH.unshift RDX_ROOT
+require 'rdx'
+
+
+
+require 'rdoc/task'
+rdoc_task = RDoc::Task.new do |rdoc|
+	%w[
+		*
+	].each{ |fname| rdoc.rdoc_files.add "#{NEW}/lib/**/#{fname}.rb" }
+	%w[
+		
+	].each{ |fname| rdoc.rdoc_files.exclude "#{NEW}/lib/**/#{fname}.rb" }
+	rdoc.options << '--all' << '--line-numbers' << '--tab-width=2'
+	rdoc.options << "--root=#{NEW}"
+	rdoc.rdoc_dir = "rdoc"
+end
+
+
+
+RDX::Task.new do |task|
+	task.name = :rdx_on_orig
+	task.description = 'Run RDX on the original stdlib sources'
+	task.files.add OLD
+	task.lib_dirs << "#{OLD}/lib"
+#	task.verbose = true
+#	task.full_trace = true
+	task.doc_output = false
+#	task.dry_run = true
+end
+
+RDX::Task.new do |task|
+	task.description = 'Run RDX on the patched Ruby source files (Ruby 2.0.0 p0)'
+	task.rdoc_task = rdoc_task
+	task.lib_dirs << "#{NEW}/lib"
+# Conflict between these two:
+	# task.files.exclude /mathn/
+	task.files.exclude /cmath/
+# Edit free:
+	# task.debug = true
+	# task.verbose = true
+	# task.full_trace = true
+	# task.doc_output = false
+	# task.dry_run = true
+end

data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/abbrev.rb.diff

@@ -0,0 +1,77 @@
+--- stdlib/orig/lib/abbrev.rb	2015-06-11 07:51:45 +0000
++++ stdlib/patched/lib/abbrev.rb	2015-06-11 07:51:47 +0000
+@@ -14,33 +14,33 @@
+ # Calculates the set of unique abbreviations for a given set of strings.
+ #
+ #   require 'abbrev'
+-#   require 'pp'
+ #
+-#   pp Abbrev.abbrev(['ruby', 'rules'])
+-#
+-# Generates:
+-#
+-#   { "rub"   =>  "ruby",
+-#     "ruby"  =>  "ruby",
+-#     "rul"   =>  "rules",
+-#     "rule"  =>  "rules",
+-#     "rules" =>  "rules" }
++#   Abbrev.abbrev(['ruby', 'rules'])
++#   # => {
++#   #   "rub"   =>  "ruby",
++#   #   "ruby"  =>  "ruby",
++#   #   "rul"   =>  "rules",
++#   #   "rule"  =>  "rules",
++#   #   "rules" =>  "rules"
++#   # }
+ #
+ # It also provides an array core extension, Array#abbrev.
+ #
+-#   pp %w{summer winter}.abbrev
+-#   #=> {"summe"=>"summer",
+-#        "summ"=>"summer",
+-#        "sum"=>"summer",
+-#        "su"=>"summer",
+-#        "s"=>"summer",
+-#        "winte"=>"winter",
+-#        "wint"=>"winter",
+-#        "win"=>"winter",
+-#        "wi"=>"winter",
+-#        "w"=>"winter",
+-#        "summer"=>"summer",
+-#        "winter"=>"winter"}
++#   %w{summer winter}.abbrev
++#   # => {
++#   #   "summe" => "summer",
++#   #   "summ"  => "summer",
++#   #   "sum"   => "summer",
++#   #   "su"    => "summer",
++#   #   "s"     => "summer",
++#   #   "winte" => "winter",
++#   #   "wint"  => "winter",
++#   #   "win"   => "winter",
++#   #   "wi"    => "winter",
++#   #   "w"     => "winter",
++#   #   "summer"=>"summer",
++#   #   "winter"=>"winter"
++#   # }
+ 
+ module Abbrev
+ 
+@@ -109,7 +109,7 @@
+   #   require 'abbrev'
+   #   %w{ car cone }.abbrev
+   #   #=> {"ca" => "car", "con"=>"cone", "co" => "cone",
+-  #        "car"=>"car", "cone" => "cone"}
++  #   #     "car"=>"car", "cone" => "cone"}
+   #
+   # The optional +pattern+ parameter is a pattern or a string. Only
+   # input strings that match the pattern or start with the string
+@@ -117,7 +117,7 @@
+   #
+   #   %w{ fast boat day }.abbrev(/^.a/)
+   #   #=> {"fas"=>"fast", "fa"=>"fast", "da"=>"day",
+-  #        "fast"=>"fast", "day"=>"day"}
++  #   #     "fast"=>"fast", "day"=>"day"}
+   #
+   # See also Abbrev.abbrev
+   def abbrev(pattern = nil)

data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/base64.rb.diff

@@ -0,0 +1,42 @@
+--- stdlib/orig/lib/base64.rb	2015-06-11 07:51:45 +0000
++++ stdlib/patched/lib/base64.rb	2015-06-25 11:15:23 +0000
+@@ -13,9 +13,9 @@
+ #     require "base64"
+ #
+ #     enc   = Base64.encode64('Send reinforcements')
+-#                         # -> "U2VuZCByZWluZm9yY2VtZW50cw==\n"
++#                         # => "U2VuZCByZWluZm9yY2VtZW50cw==\n"
+ #     plain = Base64.decode64(enc)
+-#                         # -> "Send reinforcements"
++#                         # => "Send reinforcements"
+ #
+ # The purpose of using base64 to encode data is that it translates any
+ # binary data into purely printable characters.
+@@ -28,12 +28,12 @@
+   # Line feeds are added to every 60 encoded charactors.
+   #
+   #    require 'base64'
+-  #    Base64.encode64("Now is the time for all good coders\nto learn Ruby")
+-  #
+-  # <i>Generates:</i>
+-  #
+-  #    Tm93IGlzIHRoZSB0aW1lIGZvciBhbGwgZ29vZCBjb2RlcnMKdG8gbGVhcm4g
+-  #    UnVieQ==
++  #    puts Base64.encode64("Now is the time for all good coders\nto learn Ruby")
++	#    
++  # <i>Produces:</i>
++	#    
++	#    Tm93IGlzIHRoZSB0aW1lIGZvciBhbGwgZ29vZCBjb2RlcnMKdG8gbGVhcm4g
++	#    UnVieQ==
+   def encode64(bin)
+     [bin].pack("m")
+   end
+@@ -48,7 +48,7 @@
+   #         'ZSB0aHJlZQpBbmQgc28gb24uLi4K'
+   #   puts Base64.decode64(str)
+   #
+-  # <i>Generates:</i>
++  # <i>Produces:</i>
+   #
+   #    This is line one
+   #    This is line two

data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/benchmark.rb.diff

@@ -0,0 +1,144 @@
+--- stdlib/orig/lib/benchmark.rb	2015-06-11 07:51:45 +0000
++++ stdlib/patched/lib/benchmark.rb	2015-06-25 16:34:23 +0000
+@@ -18,6 +18,8 @@
+ # The Benchmark module provides methods to measure and report the time
+ # used to execute Ruby code.
+ #
++# :rdx: indicative_numbers!
++#
+ # * Measure the time to construct the string given by the expression
+ #   <code>"a"*1_000_000</code>:
+ #
+@@ -26,6 +28,7 @@
+ #       puts Benchmark.measure { "a"*1_000_000 }
+ #
+ #   On my machine (FreeBSD 3.2 on P5, 100MHz) this generates:
++#   :rdx: output
+ #
+ #       1.166667   0.050000   1.216667 (  0.571355)
+ #
+@@ -45,6 +48,7 @@
+ #       end
+ #
+ #   The result:
++#   :rdx: output
+ #
+ #              user     system      total        real
+ #          1.033333   0.016667   1.016667 (  0.492106)
+@@ -62,7 +66,8 @@
+ #         x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
+ #       end
+ #
+-# The result:
++#   The result:
++#   :rdx: output
+ #
+ #                     user     system      total        real
+ #        for:     1.050000   0.000000   1.050000 (  0.503462)
+@@ -75,6 +80,7 @@
+ #   allocation and garbage collection. To avoid these discrepancies,
+ #   the #bmbm method is provided.  For example, to compare ways to
+ #   sort an array of floats:
++#   :rdx: is_slow
+ #
+ #       require 'benchmark'
+ #
+@@ -86,6 +92,7 @@
+ #       end
+ #
+ #   The result:
++#   :rdx: indicative_output
+ #
+ #        Rehearsal -----------------------------------------
+ #        sort!  11.928000   0.010000  11.938000 ( 12.756000)
+@@ -112,6 +119,7 @@
+ #       end
+ #
+ #   The result:
++#   :rdx: output
+ #
+ #                     user     system      total        real
+ #        for:     1.016667   0.016667   1.033333 (  0.485749)
+@@ -140,6 +148,8 @@
+   # suitable for nearly all benchmarking requirements.  See the examples in
+   # Benchmark, and the #bm and #bmbm methods.
+   #
++	# :rdx: indicative_numbers
++	# 
+   # Example:
+   #
+   #     require 'benchmark'
+@@ -153,7 +163,7 @@
+   #       [tf+tt+tu, (tf+tt+tu)/3]
+   #     end
+   #
+-  # Generates:
++  # Produces:
+   #
+   #                     user     system      total        real
+   #        for:     1.016667   0.016667   1.033333 (  0.485749)
+@@ -184,6 +194,8 @@
+   # A simple interface to the #benchmark method, #bm is generates sequential
+   # reports with labels.  The parameters have the same meaning as for
+   # #benchmark.
++	# 
++	# :rdx: indicative_numbers
+   #
+   #     require 'benchmark'
+   #
+@@ -194,7 +206,7 @@
+   #       x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
+   #     end
+   #
+-  # Generates:
++  # Produces:
+   #
+   #                     user     system      total        real
+   #        for:     1.050000   0.000000   1.050000 (  0.503462)
+@@ -220,6 +232,8 @@
+   #
+   # Because #bmbm takes two passes through the tests, it can
+   # calculate the required label width.
++	# 
++	# :rdx: is_slow
+   #
+   #       require 'benchmark'
+   #
+@@ -230,7 +244,8 @@
+   #         x.report("sort")  { array.dup.sort  }
+   #       end
+   #
+-  # Generates:
++  # Produces something like:
++	# :rdx: indicative_output
+   #
+   #        Rehearsal -----------------------------------------
+   #        sort!  11.928000   0.010000  11.938000 ( 12.756000)
+@@ -411,7 +426,12 @@
+     # +utime+ as the user CPU time, +stime+ as the system CPU time,
+     # +cutime+ as the children's user CPU time, +cstime+ as the children's
+     # system CPU time, +real+ as the elapsed real time and +label+ as the label.
+-    #
++		#
++		#   Benchmark::Tms.new.to_s            #=> "  0.000000   0.000000   0.000000 (  0.000000)\n"
++		#   Benchmark::Tms.new(1,2,3,4,5).to_s #=> "  1.000000   2.000000  10.000000 (  5.000000)\n"
++		#   Benchmark::Tms.new(100, 150, 0, 0, 200).to_s
++		#     #=> "100.000000 150.000000 250.000000 (200.000000)\n"
++		#
+     def initialize(utime = 0.0, stime = 0.0, cutime = 0.0, cstime = 0.0, real = 0.0, label = nil)
+       @utime, @stime, @cutime, @cstime, @real, @label = utime, stime, cutime, cstime, real, label.to_s
+       @total = @utime + @stime + @cutime + @cstime
+@@ -482,6 +502,13 @@
+     #
+     # If _format_ is not given, FORMAT is used as default value, detailing the
+     # user, system and real elapsed time.
++		# 
++		#   Benchmark::Tms.new(1,2,3,4,5,'label').format('%u %y %U %Y %t %r %n')
++		#     # => "1.000000 2.000000 3.000000 4.000000 10.000000 (5.000000) label"
++		#   Benchmark::Tms.new(1).format('%u %.3f', 2) #=> "1.000000 2.000"
++		#-- rdx
++		#   f = "format %u"
++		#   Benchmark::Tms.new.format(f).equal?(f) #=> false
+     #
+     def format(format = nil, *args)
+       str = (format || FORMAT).dup

data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/cmath.rb.diff

@@ -0,0 +1,52 @@
+--- stdlib/orig/lib/cmath.rb	2015-06-11 07:51:45 +0000
++++ stdlib/patched/lib/cmath.rb	2015-06-25 11:19:58 +0000
+@@ -9,10 +9,15 @@
+ # To start using this library, simply:
+ #
+ #   require "cmath"
++#   
++# In the following examples we assume that CMath is included at toplevel for the sake of clarity:
++# :rdx: setup
++# 
++#   include CMath
+ #
+ # Square root of a negative number is a complex number.
+ #
+-#   CMath.sqrt(-9)  #=> 0+3.0i
++#   sqrt(-9)  #=> 0+3.0i
+ #
+ 
+ module CMath
+@@ -67,7 +72,7 @@
+   # Returns the natural logarithm of Complex.  If a second argument is given,
+   # it will be the base of logarithm.
+   #
+-  #   log(Complex(0,0)) #=> -Infinity+0.0i
++  #   log(Complex(0,0)) # > (-Infinity+0.0i)
+   def log(*args)
+     begin
+       z, b = args
+@@ -119,6 +124,7 @@
+   ##
+   # Returns the non-negative square root of Complex.
+   #   sqrt(-1)            #=> 0+1.0i
++	#   sqrt(1.i)           #=> sqrt(1.0.i)   # [ruby-core:31672]
+   #   sqrt(Complex(-1,0)) #=> 0.0+1.0i
+   #   sqrt(Complex(0,8))  #=> 2.0+2.0i
+   def sqrt(z)
+@@ -146,6 +152,7 @@
+ 
+   ##
+   # returns the principal value of the cube root of +z+
++	#   cbrt(-8) #=> (-8)**(1.0/3)   # 3676
+   def cbrt(z)
+     z ** (1.0/3)
+   end
+@@ -254,6 +261,7 @@
+ 
+   ##
+   # returns the arc cosine of +z+
++	#   acos(Complex(3, 4)) # > (0.9368124611557199-2.305509031243477i)
+   def acos(z)
+     begin
+       if z.real? and z >= -1 and z <= 1

data/examples/ruby-2.0.0-p0/install/stdlib/diffs/lib/forwardable.rb.diff

@@ -0,0 +1,150 @@
+--- stdlib/orig/lib/forwardable.rb	2015-06-11 07:51:45 +0000
++++ stdlib/patched/lib/forwardable.rb	2015-06-25 15:16:16 +0000
+@@ -1,5 +1,6 @@
+ #
+ #   forwardable.rb -
++#   :rdx: off
+ #       $Release Version: 1.1$
+ #       $Revision: 38689 $
+ #       by Keiju ISHITSUKA(keiju@ishitsuka.com)
+@@ -22,7 +23,12 @@
+ #   class RecordCollection
+ #     extend Forwardable
+ #     def_delegator :@records, :[], :record_number
++#     def initialize records
++#       @records = Array(records)
++#     end
+ #   end
++#   collection = RecordCollection.new %w[a b c]
++#   collection.record_number 2 #=> 'c'
+ #
+ # Further, if you wish to provide the methods #size, #<<, and #map,
+ # all of which delegate to @records, this is how you can do it:
+@@ -31,18 +37,21 @@
+ #     # extend Forwardable, but we did that above
+ #     def_delegators :@records, :size, :<<, :map
+ #   end
+-#   f = Foo.new
+-#   f.printf ...
+-#   f.gets
+-#   f.content_at(1)
++#   collection << 'd'
++#   collection.map(&:upcase) #=> %w[A B C D]
++#   collection.size #=> 4
+ #
+ # If the object isn't a Module and Class, You can too extend Forwardable
+ # module.
+ #
+ #   printer = String.new
+ #   printer.extend Forwardable              # prepare object for delegation
+-#   printer.def_delegator "STDOUT", "puts"  # add delegation for STDOUT.puts()
++#   printer.def_delegator "$stdout", "puts" # add delegation for $stdout.puts()
+ #   printer.puts "Howdy!"
++#   
++# produces:
++# 
++#   Howdy!
+ #
+ # == Another example
+ #
+@@ -78,9 +87,9 @@
+ #   q.enq "Ruby", "Perl", "Python"
+ #   puts q.first
+ #   q.clear
+-#   puts q.first
++#   p q.first
+ #
+-# This should output:
++# produces:
+ #
+ #   2
+ #   3
+@@ -101,7 +110,7 @@
+ module Forwardable
+   # Version of +forwardable.rb+
+   FORWARDABLE_VERSION = "1.1.0"
+-
++	
+   @debug = nil
+   class << self
+     # If true, <tt>__FILE__</tt> will remain in the backtrace in the event an
+@@ -130,6 +139,7 @@
+   # Shortcut for defining multiple delegator methods, but with no
+   # provision for using a different name.  The following two code
+   # samples have the same effect:
++	# :rdx: off
+   #
+   #   def_delegators :@records, :size, :<<, :map
+   #
+@@ -162,7 +172,7 @@
+   #   q = MyQueue.new
+   #   q.mypush 42
+   #   q.queue    #=> [42]
+-  #   q.push 23  #=> NoMethodError
++  #   q.push 23  # raises NoMethodError
+   #
+   def def_instance_delegator(accessor, method, ali = method)
+     line_no = __LINE__; str = %{
+@@ -193,14 +203,19 @@
+ #
+ #    printer = String.new
+ #    printer.extend SingleForwardable        # prepare object for delegation
+-#    printer.def_delegator "STDOUT", "puts"  # add delegation for STDOUT.puts()
++#    printer.def_delegator "$stdout", "puts" # add delegation for $stdout.puts()
+ #    printer.puts "Howdy!"
++#    
++# produces:
++# 
++#    Howdy!
+ #
+ # Also, SingleForwardable can be used to set up delegation for a Class or Module.
++# :rdx: toplevel
+ #
+ #   class Implementation
+ #     def self.service
+-#       puts "serviced!"
++#       "serviced!"
+ #     end
+ #   end
+ #   
+@@ -209,7 +224,12 @@
+ #     def_delegator :Implementation, :service
+ #   end
+ #
+-#   Facade.service #=> serviced!
++#   Facade.service #=> "serviced!"
++#   
++#-- rdx
++#   Object.send :remove_const, :Implementation
++#   Object.send :remove_const, :Facade
++#++
+ #   
+ # If you want to use both Forwardable and SingleForwardable, you can
+ # use methods def_instance_delegator and def_single_delegator, etc.
+@@ -235,6 +255,8 @@
+   # Shortcut for defining multiple delegator methods, but with no
+   # provision for using a different name.  The following two code
+   # samples have the same effect:
++	# 
++	# :rdx: off
+   #
+   #   def_delegators :@records, :size, :<<, :map
+   #
+@@ -257,7 +279,7 @@
+   # the method of the same name in _accessor_).  If _new_name_ is
+   # provided, it is used as the name for the delegate method.
+   def def_single_delegator(accessor, method, ali = method)
+-    str = %{
++    line_no = __LINE__; str = %{
+       def #{ali}(*args, &block)
+         begin
+           #{accessor}.__send__(:#{method}, *args, &block)
+@@ -268,7 +290,7 @@
+       end
+     }
+ 
+-    instance_eval(str, __FILE__, __LINE__)
++    instance_eval(str, __FILE__, line_no)
+   end
+ 
+   alias delegate single_delegate