opal-rspec 0.6.2 → 0.7.0.rc.1

data/rspec-core/benchmarks/index_v_take_while.rb

@@ -1,47 +0,0 @@
-require 'benchmark'
-
-n = 10000
-
-list = 1.upto(10).to_a
-
-Benchmark.benchmark do |bm|
-  puts "take_while"
-  3.times do
-    bm.report do
-      n.times do
-        list.
-          take_while {|i| i < 6}.
-          map {|i| i}.
-          compact
-      end
-    end
-  end
-
-  puts
-
-  puts "list[0,n]"
-  3.times do
-    bm.report do
-      n.times do
-        if index = list.index(6)
-          list[0, index].map {|i| i.to_s}
-        else
-          list.map {|i| i}.compact
-        end
-      end
-    end
-  end
-end
-
-__END__
-
-ruby benchmarks/index_v_take_while.rb
-take_while
-   0.020000   0.000000   0.020000 (  0.020005)
-   0.010000   0.000000   0.010000 (  0.015907)
-   0.010000   0.000000   0.010000 (  0.015962)
-
-list[0,n]
-   0.020000   0.000000   0.020000 (  0.023561)
-   0.020000   0.000000   0.020000 (  0.018812)
-   0.030000   0.000000   0.030000 (  0.022389)

data/rspec-core/benchmarks/map_then_flatten_vs_flat_map_benchmarks.rb

@@ -1,94 +0,0 @@
-require 'benchmark'
-
-$n = 10000
-size = 100
-
-puts "size: #{size}"
-puts
-
-def report
-  reals = []
-  Benchmark.benchmark do |bm|
-    3.times do
-      reals << bm.report { $n.times { yield } }.real
-    end
-  end
-
-  reals.inject(&:+) / reals.count
-end
-
-avgs = []
-
-puts "map then flatten"
-avgs << report {
-  (1..size).
-    map {|n| [n]}.
-    flatten
-}
-
-puts
-
-puts "flat_map"
-avgs << report {
-  (1..size).
-    flat_map {|n| [n]}
-}
-
-puts avgs
-if avgs[0] < avgs[1]
-  puts "map then flatten faster by #{((1.0 - avgs[0]/avgs[1]) * 100).round(2)} %"
-else
-  puts "flat_map faster by #{((1.0 - avgs[1]/avgs[0]) * 100).round(2)} %"
-end
-
-__END__
-
-for each size (10, 100, 1000) showing smallest diff
-  between map-then-flatten and flat_map in at least
-  5 runs
-
-size: 10
-
-map then flatten
-   0.550000   0.000000   0.550000 (  0.547897)
-   0.570000   0.000000   0.570000 (  0.565139)
-   0.550000   0.000000   0.550000 (  0.557421)
-
-flat_map
-   0.320000   0.000000   0.320000 (  0.316801)
-   0.320000   0.010000   0.330000 (  0.325373)
-   0.330000   0.000000   0.330000 (  0.325169)
-
-flat_map faster by 42.09 %
-
-**********************************************
-
-size: 100
-
-map then flatten
-   0.390000   0.000000   0.390000 (  0.387307)
-   0.390000   0.000000   0.390000 (  0.387630)
-   0.380000   0.000000   0.380000 (  0.389421)
-
-flat_map
-   0.250000   0.000000   0.250000 (  0.259444)
-   0.270000   0.000000   0.270000 (  0.261972)
-   0.250000   0.000000   0.250000 (  0.252584)
-
-flat_map faster by 33.53 %
-
-**********************************************
-
-size: 1000
-
-map then flatten
-   0.380000   0.000000   0.380000 (  0.382788)
-   0.380000   0.000000   0.380000 (  0.372447)
-   0.370000   0.000000   0.370000 (  0.370065)
-
-flat_map
-   0.240000   0.000000   0.240000 (  0.240357)
-   0.240000   0.000000   0.240000 (  0.242325)
-   0.240000   0.000000   0.240000 (  0.240985)
-
-flat_map faster by 35.69 %

data/rspec-core/benchmarks/require_relative_v_require.rb

@@ -1,75 +0,0 @@
-require 'benchmark'
-
-n = 20
-
-Benchmark.benchmark do |bm|
-  3.times.each do
-    bm.report do
-      n.times do
-        pid = fork do
-          require 'rspec/core'
-        end
-        Process.wait(pid)
-      end
-    end
-  end
-end
-
-# ###################################
-# Ruby 1.9.3 - 3 x 20
-# require
-# $ bundle exec ruby benchmarks/require_relative_v_require.rb
-#    0.000000   0.020000   2.540000 (  2.568784)
-#    0.000000   0.010000   2.550000 (  2.580621)
-#    0.000000   0.020000   2.510000 (  2.548631)
-#
-# require_relative
-# $ bundle exec ruby benchmarks/require_relative_v_require.rb
-#    0.000000   0.010000   2.220000 (  2.288229)
-#    0.000000   0.010000   2.250000 (  2.289886)
-#    0.000000   0.020000   2.260000 (  2.296639)
-#
-# roughly 12% improvement
-#
-# ###################################
-#
-# Ruby 1.8.7 - 3 x 20
-# before change (using require, but no conditional)
-# $ bundle exec ruby benchmarks/require_relative_v_require.rb
-#   0.000000   0.010000   1.210000 (  1.242291)
-#   0.000000   0.010000   1.230000 (  1.259518)
-#   0.000000   0.010000   1.230000 (  1.250333)
-#
-# after change (still using require, but adding conditional)
-# $ bundle exec ruby benchmarks/require_relative_v_require.rb
-#   0.000000   0.010000   1.200000 (  1.227249)
-#   0.000000   0.010000   1.230000 (  1.257012)
-#   0.000000   0.010000   1.230000 (  1.259278)
-#
-# virtually no penalty
-#
-# ###################################
-
-__END__
-
-Ruby 2.0:
-
-➜  rspec-core git:(benchmark-require-relative) REQUIRE_RELATIVE=1 bundle exec ruby benchmarks/require_relative_v_require.rb
-   0.000000   0.030000   1.470000 (  1.481949)
-   0.000000   0.020000   1.440000 (  1.462620)
-   0.000000   0.020000   1.470000 (  1.491825)
-➜  rspec-core git:(benchmark-require-relative) bundle exec ruby benchmarks/require_relative_v_require.rb
-   0.000000   0.010000   1.510000 (  1.549906)
-   0.000000   0.010000   1.530000 (  1.546252)
-   0.000000   0.020000   1.510000 (  1.531644)
-
-Ruby 2.1:
-
-➜  rspec-core git:(benchmark-require-relative) bundle exec ruby benchmarks/require_relative_v_require.rb
-   0.000000   0.020000   1.570000 (  1.613217)
-   0.000000   0.020000   1.600000 (  1.618540)
-   0.010000   0.020000   1.570000 (  1.608205)
-➜  rspec-core git:(benchmark-require-relative) REQUIRE_RELATIVE=1 bundle exec ruby benchmarks/require_relative_v_require.rb
-   0.000000   0.020000   1.480000 (  1.515131)
-   0.000000   0.010000   1.480000 (  1.527766)
-   0.000000   0.020000   1.490000 (  1.515631)

data/rspec-core/benchmarks/respond_to_v_defined.rb

@@ -1,72 +0,0 @@
-require 'benchmark'
-
-n = 1_000_000
-
-puts "Kernel.respond_to?(:warn)"
-
-Benchmark.benchmark do |bm|
-  3.times do
-    bm.report do
-      n.times do
-       Kernel.respond_to?(:warn)
-      end
-    end
-  end
-end
-
-puts "defined?(warn)"
-
-Benchmark.benchmark do |bm|
-  3.times do
-    bm.report do
-      n.times do
-        defined?(warn)
-      end
-    end
-  end
-end
-
-puts "Kernel.respond_to?(:foo)"
-
-Benchmark.benchmark do |bm|
-  3.times do
-    bm.report do
-      n.times do
-        Kernel.respond_to?(:foo)
-      end
-    end
-  end
-end
-
-puts "defined?(foo)"
-
-Benchmark.benchmark do |bm|
-  3.times do
-    bm.report do
-      n.times do
-        defined?(foo)
-      end
-    end
-  end
-end
-
-# $ ruby benchmarks/respond_to_v_defined.rb
-# Kernel.respond_to?(:warn)
-#    0.190000   0.000000   0.190000 (  0.206502)
-#    0.190000   0.000000   0.190000 (  0.197547)
-#    0.190000   0.000000   0.190000 (  0.189731)
-# defined?(warn)
-#    0.190000   0.000000   0.190000 (  0.187334)
-#    0.180000   0.000000   0.180000 (  0.201078)
-#    0.190000   0.000000   0.190000 (  0.202295)
-# Kernel.respond_to?(:foo)
-#    0.250000   0.010000   0.260000 (  0.255003)
-#    0.240000   0.000000   0.240000 (  0.247376)
-#    0.250000   0.000000   0.250000 (  0.251196)
-# defined?(foo)
-#    0.100000   0.000000   0.100000 (  0.104748)
-#    0.110000   0.000000   0.110000 (  0.107250)
-#    0.110000   0.000000   0.110000 (  0.107990)
-#
-# defined is consistently faster, but it takes 1,000,000 x to have a meaningful
-# diff

data/rspec-core/benchmarks/several_regexps_v_one_big_one.rb

@@ -1,86 +0,0 @@
-require 'benchmark'
-
-$t = 3
-$n = 100000
-
-def report(header)
-  puts header
-  reals = []
-  Benchmark.bm do |bm|
-    $t.times do
-      reals << bm.report { $n.times { yield } }.real
-    end
-  end
-
-  [header, (reals.inject(&:+) / reals.count).round(5)]
-end
-
-multi = [
-  /\/lib\d*\/ruby\//,
-  /org\/jruby\//,
-  /bin\//,
-  %r|/gems/|,
-  /lib\/rspec\/(core|expectations|matchers|mocks)/
-]
-
-union = [Regexp.union(multi)]
-
-avgs = []
-
-avgs << report("multi w/ match") {
-  multi.any? {|e| e =~ "lib/rspec/core"}
-}
-
-avgs << report("union w/ match") {
-  union.any? {|e| e =~ "lib/rspec/core"}
-}
-
-avgs << report("multi w/ no match") {
-  multi.any? {|e| e =~ "foo/bar"}
-}
-
-avgs << report("union w/ no match") {
-  union.any? {|e| e =~ "foo/bar"}
-}
-
-puts
-
-avgs.each do |header, val|
-  puts header, val
-  puts
-end
-
-__END__
-
-multi w/ match
-       user     system      total        real
-   0.400000   0.000000   0.400000 (  0.405063)
-   0.410000   0.000000   0.410000 (  0.402778)
-   0.430000   0.000000   0.430000 (  0.435447)
-union w/ match
-       user     system      total        real
-   0.130000   0.000000   0.130000 (  0.127526)
-   0.130000   0.000000   0.130000 (  0.135529)
-   0.130000   0.000000   0.130000 (  0.127866)
-multi w/ no match
-       user     system      total        real
-   0.320000   0.000000   0.320000 (  0.318921)
-   0.330000   0.000000   0.330000 (  0.328375)
-   0.340000   0.000000   0.340000 (  0.341230)
-union w/ no match
-       user     system      total        real
-   0.170000   0.000000   0.170000 (  0.175144)
-   0.170000   0.000000   0.170000 (  0.168816)
-   0.170000   0.000000   0.170000 (  0.168362)
-
-multi w/ match
-0.41443
-
-union w/ match
-0.13031
-
-multi w/ no match
-0.32951
-
-union w/ no match
-0.17077

data/rspec-core/benchmarks/sort_by_v_shuffle.rb

@@ -1,83 +0,0 @@
-require "benchmark"
-
-# This benchmark demonstrates the speed of Array#shuffle versus sorting by
-# random numbers. This is in reference to ordering examples using the
-# --order=rand command line flag. Array#shuffle also respects seeded random via
-# Kernel.srand.
-
-LIST = (1..1_000).to_a.freeze
-
-Benchmark.bmbm do |x|
-  x.report("sort_by") do
-    1_000.times do
-      LIST.sort_by { Kernel.rand(LIST.size) }
-    end
-  end
-
-  x.report("shuffle") do
-    1_000.times do
-      LIST.shuffle
-    end
-  end
-
-  # http://en.wikipedia.org/wiki/Fisher-Yates_shuffle
-  #
-  # We use this algorithm as an alternative to `shuffle` on
-  # rubies (< 1.9.3) for which Array#shuffle does not accept
-  # a `:random` option. We do this to avoid affecting ruby's
-  # global randomization.
-  x.report('fisher-yates') do
-    1_000.times do
-      rng = Random.new
-      list = LIST.dup
-      LIST.size.times do |i|
-        j = i + rng.rand(LIST.size - i)
-        next if i == j
-        list[i], list[j] = list[j], list[i]
-      end
-    end
-  end
-end
-
-=begin
-
-Ruby 2.0.0:
-
-Rehearsal ------------------------------------------------
-sort_by        0.570000   0.010000   0.580000 (  0.581875)
-shuffle        0.020000   0.000000   0.020000 (  0.021524)
-fisher-yates   0.370000   0.020000   0.390000 (  0.387855)
---------------------------------------- total: 0.990000sec
-
-                   user     system      total        real
-sort_by        0.560000   0.000000   0.560000 (  0.561014)
-shuffle        0.010000   0.000000   0.010000 (  0.019814)
-fisher-yates   0.350000   0.010000   0.360000 (  0.358932)
-
-Ruby 1.9.3:
-
-Rehearsal ------------------------------------------------
-sort_by        0.690000   0.010000   0.700000 (  0.701035)
-shuffle        0.020000   0.000000   0.020000 (  0.017603)
-fisher-yates   0.440000   0.020000   0.460000 (  0.464778)
---------------------------------------- total: 1.180000sec
-
-                   user     system      total        real
-sort_by        0.690000   0.000000   0.690000 (  0.697824)
-shuffle        0.020000   0.000000   0.020000 (  0.018622)
-fisher-yates   0.440000   0.010000   0.450000 (  0.452260)
-
-JRuby:
-
-Rehearsal ------------------------------------------------
-sort_by        2.550000   0.050000   2.600000 (  1.325000)
-shuffle        0.090000   0.000000   0.090000 (  0.057000)
-fisher-yates   0.770000   0.010000   0.780000 (  0.477000)
---------------------------------------- total: 3.470000sec
-
-                   user     system      total        real
-sort_by        0.470000   0.010000   0.480000 (  0.442000)
-shuffle        0.040000   0.000000   0.040000 (  0.042000)
-fisher-yates   0.300000   0.010000   0.310000 (  0.283000)
-
-=end