opal-rspec 0.6.2 → 0.7.0.rc.1

data/rspec-expectations/benchmarks/autoload_v_require.rb

@@ -1,25 +0,0 @@
-require 'benchmark'
-
-n = 10
-
-Benchmark.benchmark do |bm|
-  3.times do
-    bm.report do
-      n.times do
-        `bin/rspec benchmarks/example_spec.rb`
-      end
-    end
-  end
-end
-
-# Before autoloading matcher class files
-#    0.000000   0.010000   8.800000 (  8.906383)
-#    0.010000   0.010000   8.880000 (  8.980907)
-#    0.000000   0.010000   8.820000 (  8.918083)
-#
-# After autoloading matcher class files
-#    0.000000   0.010000   8.610000 (  8.701434)
-#    0.010000   0.010000   8.620000 (  8.741811)
-#    0.000000   0.000000   8.580000 (  8.677235)
-#
-# Roughly 2.5% improvement in load time (every bit counts!)

data/rspec-expectations/benchmarks/cloning_matchers.rb

@@ -1,19 +0,0 @@
-require 'benchmark'
-require 'rspec/expectations'
-include RSpec::Matchers
-
-n = 1_000_000
-matcher = eq(3)
-
-Benchmark.bm do |x|
-  x.report do
-    n.times { matcher.clone }
-  end
-end
-
-__END__
-
-We can do about 1000 clones per ms:
-
-      user     system      total        real
-  1.080000   0.030000   1.110000 (  1.120009)

data/rspec-expectations/benchmarks/default_messages_as_methods_v_blocks.rb

@@ -1,27 +0,0 @@
-require 'benchmark'
-require 'rspec/expectations'
-
-include RSpec::Expectations
-include RSpec::Matchers
-
-RSpec::Matchers.define :eq_using_dsl do |expected|
-  match do |actual|
-    actual == expected
-  end
-end
-
-n = 10000
-
-Benchmark.benchmark do |bm|
-  3.times do
-    bm.report do
-      n.times do
-        eq_using_dsl(5).tap do |m|
-          m.description
-          m.failure_message_for_should
-          m.failure_message_for_should_not
-        end
-      end
-    end
-  end
-end

data/rspec-expectations/benchmarks/example_spec.rb

@@ -1,9 +0,0 @@
-describe "something" do
-  it "does something that passes" do
-    1.should eq(1)
-  end
-
-  it "does something that fails" do
-    1.should eq(2)
-  end
-end

data/rspec-expectations/benchmarks/include_v_superclass.rb

@@ -1,39 +0,0 @@
-require 'benchmark'
-
-n = 10_000
-
-class  Foo; end
-module Bar; end
-
-
-Benchmark.benchmark do |bm|
-  puts "Class.new(Foo)"
-
-  3.times do
-    bm.report do
-      n.times do
-        Class.new(Foo)
-      end
-    end
-  end
-
-  puts "Class.new { include Bar }"
-
-  3.times do
-    bm.report do
-      n.times do
-        Class.new { include Bar }
-      end
-    end
-  end
-end
-
-# $ ruby benchmarks/include_v_superclass.rb
-# Class.new(Foo)
-#   0.030000   0.000000   0.030000 (  0.033536)
-#   0.020000   0.000000   0.020000 (  0.022077)
-#   0.040000   0.010000   0.050000 (  0.035813)
-# Class.new { include Bar }
-#   0.040000   0.000000   0.040000 (  0.041427)
-#   0.040000   0.000000   0.040000 (  0.039019)
-#   0.030000   0.000000   0.030000 (  0.037018)

data/rspec-expectations/benchmarks/match_array/failing_with_distinct_items.rb

@@ -1,147 +0,0 @@
-$LOAD_PATH.unshift "./lib"
-require 'benchmark'
-require 'rspec/expectations'
-require 'securerandom'
-
-extend RSpec::Matchers
-
-sizes = [10, 100, 1000, 2000, 4000]
-
-puts "rspec-expectations #{RSpec::Expectations::Version::STRING} -- #{RUBY_ENGINE}/#{RUBY_VERSION}"
-
-puts
-puts "Failing `match_array` expectation with lists of distinct strings having 1 unmatched pair"
-puts
-
-Benchmark.benchmark do |bm|
-  sizes.each do |size|
-    actual = Array.new(size) { SecureRandom.uuid }
-
-    expecteds = Array.new(3) do
-      array = actual.shuffle
-      # replace one entry with a different value
-      array[rand(array.length)] = SecureRandom.uuid
-      array
-    end
-
-    expecteds.each do |expected|
-      bm.report("#{size.to_s.rjust(5)} items") do
-        begin
-          expect(actual).to match_array(expected)
-        rescue RSpec::Expectations::ExpectationNotMetError
-        else
-          raise "did not fail but should have"
-        end
-      end
-    end
-  end
-end
-
-__END__
-
-Before new composable matchers algo:
-
-   10 items  0.000000   0.000000   0.000000 (  0.000813)
-   10 items  0.000000   0.000000   0.000000 (  0.000099)
-   10 items  0.000000   0.000000   0.000000 (  0.000127)
-  100 items  0.000000   0.000000   0.000000 (  0.000707)
-  100 items  0.000000   0.000000   0.000000 (  0.000612)
-  100 items  0.000000   0.000000   0.000000 (  0.000600)
- 1000 items  0.040000   0.000000   0.040000 (  0.038679)
- 1000 items  0.040000   0.000000   0.040000 (  0.041379)
- 1000 items  0.040000   0.000000   0.040000 (  0.036680)
- 2000 items  0.130000   0.000000   0.130000 (  0.131681)
- 2000 items  0.120000   0.000000   0.120000 (  0.123664)
- 2000 items  0.130000   0.000000   0.130000 (  0.128799)
- 4000 items  0.490000   0.000000   0.490000 (  0.489446)
- 4000 items  0.510000   0.000000   0.510000 (  0.511915)
- 4000 items  0.480000   0.010000   0.490000 (  0.477616)
-
-After:
-
-   10 items  0.000000   0.000000   0.000000 (  0.001382)
-   10 items  0.000000   0.000000   0.000000 (  0.000156)
-   10 items  0.000000   0.000000   0.000000 (  0.000161)
-  100 items  0.010000   0.000000   0.010000 (  0.005052)
-  100 items  0.000000   0.000000   0.000000 (  0.004991)
-  100 items  0.010000   0.000000   0.010000 (  0.004984)
- 1000 items  0.470000   0.000000   0.470000 (  0.470043)
- 1000 items  0.500000   0.000000   0.500000 (  0.499316)
- 1000 items  0.490000   0.000000   0.490000 (  0.488582)
- 2000 items  1.910000   0.000000   1.910000 (  1.917279)
- 2000 items  1.930000   0.010000   1.940000 (  1.931002)
- 2000 items  1.920000   0.000000   1.920000 (  1.928989)
- 4000 items  7.860000   0.010000   7.870000 (  7.881995)
- 4000 items  7.980000   0.010000   7.990000 (  8.003643)
- 4000 items  8.000000   0.010000   8.010000 (  8.031382)
-
-With "smaller subproblem" optimization: (about 25% slower)
-
-   10 items  0.010000   0.000000   0.010000 (  0.001331)
-   10 items  0.000000   0.000000   0.000000 (  0.000175)
-   10 items  0.000000   0.000000   0.000000 (  0.000165)
-  100 items  0.000000   0.000000   0.000000 (  0.006137)
-  100 items  0.010000   0.000000   0.010000 (  0.005880)
-  100 items  0.000000   0.000000   0.000000 (  0.005950)
- 1000 items  0.630000   0.000000   0.630000 (  0.634294)
- 1000 items  0.620000   0.000000   0.620000 (  0.622427)
- 1000 items  0.640000   0.000000   0.640000 (  0.641505)
- 2000 items  2.420000   0.000000   2.420000 (  2.419876)
- 2000 items  2.430000   0.000000   2.430000 (  2.442544)
- 2000 items  2.380000   0.010000   2.390000 (  2.385106)
- 4000 items  9.780000   0.010000   9.790000 (  9.811499)
- 4000 items  9.670000   0.010000   9.680000 (  9.688799)
- 4000 items  9.710000   0.010000   9.720000 (  9.743054)
-
-With "implement `values_match?` ourselves" optimization: (more than twice as fast!)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001189)
-   10 items  0.000000   0.000000   0.000000 (  0.000149)
-   10 items  0.000000   0.000000   0.000000 (  0.000130)
-  100 items  0.000000   0.000000   0.000000 (  0.002927)
-  100 items  0.000000   0.000000   0.000000 (  0.002856)
-  100 items  0.010000   0.000000   0.010000 (  0.003028)
- 1000 items  0.250000   0.000000   0.250000 (  0.245146)
- 1000 items  0.240000   0.000000   0.240000 (  0.246291)
- 1000 items  0.320000   0.000000   0.320000 (  0.315192)
- 2000 items  1.120000   0.000000   1.120000 (  1.128162)
- 2000 items  1.030000   0.000000   1.030000 (  1.034982)
- 2000 items  1.060000   0.000000   1.060000 (  1.063870)
- 4000 items  4.530000   0.000000   4.530000 (  4.556346)
- 4000 items  4.400000   0.010000   4.410000 (  4.414447)
- 4000 items  4.410000   0.000000   4.410000 (  4.417440)
-
-With e === a || a == e || values_match?(e,a)
-   10 items  0.000000   0.000000   0.000000 (  0.001466)
-   10 items  0.000000   0.000000   0.000000 (  0.000258)
-   10 items  0.000000   0.000000   0.000000 (  0.000251)
-  100 items  0.020000   0.000000   0.020000 (  0.012369)
-  100 items  0.010000   0.000000   0.010000 (  0.012345)
-  100 items  0.010000   0.000000   0.010000 (  0.012744)
- 1000 items  1.180000   0.000000   1.180000 (  1.187754)
- 1000 items  1.200000   0.000000   1.200000 (  1.198681)
- 1000 items  1.210000   0.000000   1.210000 (  1.210159)
- 2000 items  4.760000   0.000000   4.760000 (  4.764911)
- 2000 items  4.760000   0.000000   4.760000 (  4.757022)
- 2000 items  4.760000   0.000000   4.760000 (  4.771776)
- 4000 items 19.070000   0.010000  19.080000 ( 19.077930)
- 4000 items 19.090000   0.010000  19.100000 ( 19.104171)
- 4000 items 19.260000   0.010000  19.270000 ( 19.289653)
-
-With values_match?(e,a)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001462)
-   10 items  0.000000   0.000000   0.000000 (  0.000253)
-   10 items  0.000000   0.000000   0.000000 (  0.000244)
-  100 items  0.010000   0.000000   0.010000 (  0.011913)
-  100 items  0.010000   0.000000   0.010000 (  0.011858)
-  100 items  0.020000   0.000000   0.020000 (  0.011992)
- 1000 items  1.210000   0.000000   1.210000 (  1.226960)
- 1000 items  1.140000   0.000000   1.140000 (  1.147002)
- 1000 items  1.180000   0.000000   1.180000 (  1.194010)
- 2000 items  4.690000   0.010000   4.700000 (  4.740503)
- 2000 items  4.680000   0.000000   4.680000 (  4.676084)
- 2000 items  4.570000   0.000000   4.570000 (  4.581262)
- 4000 items 18.450000   0.010000  18.460000 ( 18.532578)
- 4000 items 18.400000   0.010000  18.410000 ( 18.520454)
- 4000 items 18.490000   0.020000  18.510000 ( 18.592491)

data/rspec-expectations/benchmarks/match_array/failing_with_duplicate_items.rb

@@ -1,122 +0,0 @@
-$LOAD_PATH.unshift "./lib"
-require 'benchmark'
-require 'rspec/expectations'
-
-extend RSpec::Matchers
-
-sizes = [10, 100, 1000]
-
-puts "rspec-expectations #{RSpec::Expectations::Version::STRING} -- #{RUBY_ENGINE}/#{RUBY_VERSION}"
-
-puts
-puts "Failing `match_array` expectation with lists of integers (w/dups) having 1 unmatched pair"
-puts
-
-Benchmark.benchmark do |bm|
-  sizes.each do |size|
-    actual    = Array.new(size) { rand(size / 2) }
-    expecteds = Array.new(3) do
-      array = actual.shuffle
-      array[rand(array.length)] = 9999999
-      array
-    end
-
-    expecteds.each do |expected|
-      bm.report("#{size.to_s.rjust(5)} items") do
-        begin
-          expect(actual).to match_array(expected)
-        rescue RSpec::Expectations::ExpectationNotMetError
-        else
-          raise "did not fail but should have"
-        end
-      end
-    end
-  end
-end
-
-__END__
-
-Before new composable matchers algo:
-
-   10 items  0.000000   0.000000   0.000000 (  0.000711)
-   10 items  0.000000   0.000000   0.000000 (  0.000079)
-   10 items  0.000000   0.000000   0.000000 (  0.000080)
-   20 items  0.000000   0.000000   0.000000 (  0.000105)
-   20 items  0.000000   0.000000   0.000000 (  0.000122)
-   20 items  0.000000   0.000000   0.000000 (  0.000101)
-   25 items  0.000000   0.000000   0.000000 (  0.000125)
-   25 items  0.000000   0.000000   0.000000 (  0.000137)
-   25 items  0.000000   0.000000   0.000000 (  0.000116)
-
-After:
-
-  This varies widly based on the inputs. One run:
-
-     10 items  0.010000   0.000000   0.010000 (  0.005884)
-     10 items  0.000000   0.000000   0.000000 (  0.004429)
-     10 items  0.000000   0.000000   0.000000 (  0.004733)
-     20 items  2.040000   0.000000   2.040000 (  2.049461)
-     20 items  2.080000   0.010000   2.090000 (  2.087983)
-     20 items  1.950000   0.000000   1.950000 (  1.950013)
-     25 items 10.240000   0.020000  10.260000 ( 10.280575)
-     25 items 10.390000   0.010000  10.400000 ( 10.433754)
-     25 items 10.250000   0.020000  10.270000 ( 10.311604)
-
-  Another run:
-
-     10 items  0.010000   0.010000   0.020000 (  0.015355)
-     10 items  0.010000   0.000000   0.010000 (  0.010347)
-     10 items  0.020000   0.000000   0.020000 (  0.013657)
-     20 items 36.140000   0.030000  36.170000 ( 36.236651)
-     20 items 36.010000   0.040000  36.050000 ( 36.098006)
-     20 items 35.990000   0.030000  36.020000 ( 36.071397)
-
-  (I lost patience and didn't wait for it to finish 25 items...)
-
-With "smaller subproblem" optimization: (way faster!)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001411)
-   10 items  0.000000   0.000000   0.000000 (  0.000615)
-   10 items  0.000000   0.000000   0.000000 (  0.000413)
-   20 items  0.000000   0.000000   0.000000 (  0.000947)
-   20 items  0.000000   0.000000   0.000000 (  0.001725)
-   20 items  0.000000   0.000000   0.000000 (  0.001345)
-   25 items  0.010000   0.000000   0.010000 (  0.002348)
-   25 items  0.000000   0.000000   0.000000 (  0.002836)
-   25 items  0.000000   0.000000   0.000000 (  0.002721)
-
-With "implement `values_match?` ourselves" optimization: (about twice as fast!)
-
-   10 items  0.000000   0.000000   0.000000 (  0.002450)
-   10 items  0.000000   0.000000   0.000000 (  0.000857)
-   10 items  0.000000   0.000000   0.000000 (  0.000883)
-  100 items  0.040000   0.000000   0.040000 (  0.043661)
-  100 items  0.060000   0.000000   0.060000 (  0.053046)
-  100 items  0.040000   0.010000   0.050000 (  0.051760)
- 1000 items  3.620000   0.060000   3.680000 (  3.688289)
- 1000 items  2.600000   0.020000   2.620000 (  2.628405)
- 1000 items  4.660000   0.040000   4.700000 (  4.712196)
-
-With e === a || a == e || values_match?(e,a)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001992)
-   10 items  0.000000   0.000000   0.000000 (  0.000821)
-   10 items  0.000000   0.000000   0.000000 (  0.000794)
-  100 items  0.060000   0.000000   0.060000 (  0.068597)
-  100 items  0.060000   0.000000   0.060000 (  0.056409)
-  100 items  0.070000   0.010000   0.080000 (  0.072950)
- 1000 items  4.090000   0.100000   4.190000 (  4.218107)
- 1000 items  3.000000   0.050000   3.050000 (  3.070019)
- 1000 items  6.040000   0.070000   6.110000 (  6.102311)
-
-With values_match?(e,a)
-
-   10 items  0.000000   0.000000   0.000000 (  0.002177)
-   10 items  0.000000   0.000000   0.000000 (  0.001201)
-   10 items  0.000000   0.000000   0.000000 (  0.000928)
-  100 items  0.050000   0.000000   0.050000 (  0.051785)
-  100 items  0.040000   0.000000   0.040000 (  0.032323)
-  100 items  0.040000   0.000000   0.040000 (  0.046934)
- 1000 items  4.050000   0.100000   4.150000 (  4.175914)
- 1000 items  3.040000   0.050000   3.090000 (  3.130656)
- 1000 items  4.110000   0.050000   4.160000 (  4.161170)

data/rspec-expectations/benchmarks/match_array/passing_with_distinct_items.rb

@@ -1,154 +0,0 @@
-$LOAD_PATH.unshift "./lib"
-require 'benchmark'
-require 'rspec/expectations'
-require 'securerandom'
-
-extend RSpec::Matchers
-
-sizes = [10, 100, 1000, 2000, 4000]
-
-puts "rspec-expectations #{RSpec::Expectations::Version::STRING} -- #{RUBY_ENGINE}/#{RUBY_VERSION}"
-
-puts
-puts "Passing `match_array` expectation with lists of distinct strings"
-puts
-
-Benchmark.benchmark do |bm|
-  sizes.each do |size|
-    actual    = Array.new(size) { SecureRandom.uuid }
-    expecteds = Array.new(3)    { actual.shuffle }
-    expecteds.each do |expected|
-      bm.report("#{size.to_s.rjust(5)} items") do
-        expect(actual).to match_array(expected)
-      end
-    end
-  end
-end
-
-__END__
-
-Before new composable matchers algo:
-
-   10 items  0.000000   0.000000   0.000000 (  0.000857)
-   10 items  0.000000   0.000000   0.000000 (  0.000029)
-   10 items  0.000000   0.000000   0.000000 (  0.000018)
-  100 items  0.000000   0.000000   0.000000 (  0.000334)
-  100 items  0.000000   0.000000   0.000000 (  0.000372)
-  100 items  0.000000   0.000000   0.000000 (  0.000331)
- 1000 items  0.030000   0.000000   0.030000 (  0.029778)
- 1000 items  0.030000   0.000000   0.030000 (  0.030566)
- 1000 items  0.030000   0.000000   0.030000 (  0.033150)
- 2000 items  0.140000   0.000000   0.140000 (  0.141719)
- 2000 items  0.120000   0.000000   0.120000 (  0.124348)
- 2000 items  0.120000   0.000000   0.120000 (  0.121202)
- 4000 items  0.490000   0.000000   0.490000 (  0.500631)
- 4000 items  0.470000   0.000000   0.470000 (  0.468477)
- 4000 items  0.490000   0.010000   0.500000 (  0.492957)
-
-After:
-
-   10 items  0.000000   0.000000   0.000000 (  0.001165)
-   10 items  0.000000   0.000000   0.000000 (  0.000131)
-   10 items  0.000000   0.000000   0.000000 (  0.000127)
-  100 items  0.000000   0.000000   0.000000 (  0.005636)
-  100 items  0.010000   0.000000   0.010000 (  0.004881)
-  100 items  0.000000   0.000000   0.000000 (  0.004676)
- 1000 items  0.500000   0.000000   0.500000 (  0.505676)
- 1000 items  0.490000   0.000000   0.490000 (  0.483469)
- 1000 items  0.490000   0.000000   0.490000 (  0.497841)
- 2000 items  1.950000   0.000000   1.950000 (  1.966324)
- 2000 items  1.970000   0.000000   1.970000 (  1.975567)
- 2000 items  1.900000   0.000000   1.900000 (  1.902315)
- 4000 items  7.650000   0.010000   7.660000 (  7.672907)
- 4000 items  7.720000   0.010000   7.730000 (  7.735615)
- 4000 items  7.730000   0.000000   7.730000 (  7.756837)
-
-With "smaller subproblem" optimization: (about 20% slower)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001099)
-   10 items  0.000000   0.000000   0.000000 (  0.000110)
-   10 items  0.000000   0.000000   0.000000 (  0.000102)
-  100 items  0.010000   0.000000   0.010000 (  0.005462)
-  100 items  0.010000   0.000000   0.010000 (  0.005433)
-  100 items  0.000000   0.000000   0.000000 (  0.005409)
- 1000 items  0.570000   0.000000   0.570000 (  0.569302)
- 1000 items  0.570000   0.000000   0.570000 (  0.577496)
- 1000 items  0.560000   0.000000   0.560000 (  0.555496)
- 2000 items  2.330000   0.000000   2.330000 (  2.325537)
- 2000 items  2.450000   0.000000   2.450000 (  2.464415)
- 2000 items  2.470000   0.000000   2.470000 (  2.472999)
- 4000 items  9.380000   0.010000   9.390000 (  9.406678)
- 4000 items  9.320000   0.010000   9.330000 (  9.340727)
- 4000 items  9.330000   0.010000   9.340000 (  9.358326)
-
-With "implement `values_match?` ourselves" optimization: (about twice as fast!)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001113)
-   10 items  0.000000   0.000000   0.000000 (  0.000074)
-   10 items  0.000000   0.000000   0.000000 (  0.000071)
-  100 items  0.000000   0.000000   0.000000 (  0.002558)
-  100 items  0.010000   0.000000   0.010000 (  0.002528)
-  100 items  0.000000   0.000000   0.000000 (  0.002555)
- 1000 items  0.300000   0.000000   0.300000 (  0.306318)
- 1000 items  0.260000   0.000000   0.260000 (  0.253526)
- 1000 items  0.240000   0.000000   0.240000 (  0.246096)
- 2000 items  1.070000   0.000000   1.070000 (  1.065989)
- 2000 items  1.040000   0.000000   1.040000 (  1.047495)
- 2000 items  1.080000   0.000000   1.080000 (  1.078392)
- 4000 items  4.520000   0.000000   4.520000 (  4.529568)
- 4000 items  4.570000   0.010000   4.580000 (  4.597785)
- 4000 items  5.030000   0.010000   5.040000 (  5.079452)
-
-With `match_when_sorted?` optimization: (many orders of magnitude faster!)
-
-   10 items  0.010000   0.000000   0.010000 (  0.002044)
-   10 items  0.000000   0.000000   0.000000 (  0.000038)
-   10 items  0.000000   0.000000   0.000000 (  0.000031)
-  100 items  0.000000   0.000000   0.000000 (  0.000149)
-  100 items  0.000000   0.000000   0.000000 (  0.000137)
-  100 items  0.000000   0.000000   0.000000 (  0.000136)
- 1000 items  0.000000   0.000000   0.000000 (  0.001426)
- 1000 items  0.000000   0.000000   0.000000 (  0.001369)
- 1000 items  0.000000   0.000000   0.000000 (  0.001355)
- 2000 items  0.010000   0.000000   0.010000 (  0.003304)
- 2000 items  0.000000   0.000000   0.000000 (  0.002192)
- 2000 items  0.000000   0.000000   0.000000 (  0.002849)
- 4000 items  0.000000   0.000000   0.000000 (  0.007730)
- 4000 items  0.010000   0.000000   0.010000 (  0.006074)
- 4000 items  0.010000   0.000000   0.010000 (  0.006514)
-
-With e === a || a == e || values_match?(e,a)
-
-   10 items  0.000000   0.000000   0.000000 (  0.002202)
-   10 items  0.000000   0.000000   0.000000 (  0.000054)
-   10 items  0.000000   0.000000   0.000000 (  0.000046)
-  100 items  0.000000   0.000000   0.000000 (  0.000203)
-  100 items  0.000000   0.000000   0.000000 (  0.000199)
-  100 items  0.000000   0.000000   0.000000 (  0.000192)
- 1000 items  0.010000   0.000000   0.010000 (  0.001438)
- 1000 items  0.000000   0.000000   0.000000 (  0.001419)
- 1000 items  0.000000   0.000000   0.000000 (  0.001474)
- 2000 items  0.010000   0.000000   0.010000 (  0.003341)
- 2000 items  0.000000   0.000000   0.000000 (  0.003224)
- 2000 items  0.000000   0.000000   0.000000 (  0.003251)
- 4000 items  0.010000   0.000000   0.010000 (  0.007156)
- 4000 items  0.010000   0.000000   0.010000 (  0.006715)
- 4000 items  0.000000   0.000000   0.000000 (  0.006676)
-
-With values_match?(e,a)
-
-   10 items  0.000000   0.000000   0.000000 (  0.001173)
-   10 items  0.000000   0.000000   0.000000 (  0.000051)
-   10 items  0.000000   0.000000   0.000000 (  0.000026)
-  100 items  0.000000   0.000000   0.000000 (  0.000171)
-  100 items  0.000000   0.000000   0.000000 (  0.000138)
-  100 items  0.000000   0.000000   0.000000 (  0.000136)
- 1000 items  0.010000   0.000000   0.010000 (  0.001506)
- 1000 items  0.000000   0.000000   0.000000 (  0.001486)
- 1000 items  0.000000   0.000000   0.000000 (  0.001510)
- 2000 items  0.010000   0.000000   0.010000 (  0.003153)
- 2000 items  0.000000   0.010000   0.010000 (  0.003883)
- 2000 items  0.000000   0.000000   0.000000 (  0.003199)
- 4000 items  0.010000   0.000000   0.010000 (  0.007178)
- 4000 items  0.000000   0.000000   0.000000 (  0.006629)
- 4000 items  0.010000   0.000000   0.010000 (  0.006435)