Guard ruby/spec with spec/mspec/tool/wrap_with_guard.rb

4 files changed, 54 insertions, 42 deletions

diff --git a/spec/ruby/library/prime/integer/each_prime_spec.rb b/spec/ruby/library/prime/integer/each_prime_spec.rb
index a71296b0df..6034802e73 100644
--- a/spec/ruby/library/prime/integer/each_prime_spec.rb
+++ b/spec/ruby/library/prime/integer/each_prime_spec.rb
@@ -1,13 +1,16 @@
 require_relative '../../../spec_helper'
-require 'prime'
 
-describe "Integer.each_prime" do
-  it "is transferred to Prime.each" do
-    Prime.should_receive(:each).with(100).and_yield(2).and_yield(3).and_yield(5)
-    yielded = []
-    Integer.each_prime(100) do |prime|
-      yielded << prime
+ruby_version_is ""..."3.1" do
+  require 'prime'
+
+  describe "Integer.each_prime" do
+    it "is transferred to Prime.each" do
+      Prime.should_receive(:each).with(100).and_yield(2).and_yield(3).and_yield(5)
+      yielded = []
+      Integer.each_prime(100) do |prime|
+        yielded << prime
+      end
+      yielded.should == [2,3,5]
     end
-    yielded.should == [2,3,5]
   end
 end
diff --git a/spec/ruby/library/prime/integer/from_prime_division_spec.rb b/spec/ruby/library/prime/integer/from_prime_division_spec.rb
index e0e74fb336..5422bc651c 100644
--- a/spec/ruby/library/prime/integer/from_prime_division_spec.rb
+++ b/spec/ruby/library/prime/integer/from_prime_division_spec.rb
@@ -1,13 +1,16 @@
 require_relative '../../../spec_helper'
-require 'prime'
 
-describe "Integer.from_prime_division" do
-  it "returns the product of the given factorization" do
-    Integer.from_prime_division([[2,3], [3,3], [5,3], [7,3], [11,3], [13,3], [17,3]]).
-      should == 2**3 * 3**3 * 5**3 * 7**3 * 11**3 * 13**3 * 17**3
-  end
+ruby_version_is ""..."3.1" do
+  require 'prime'
+
+  describe "Integer.from_prime_division" do
+    it "returns the product of the given factorization" do
+      Integer.from_prime_division([[2,3], [3,3], [5,3], [7,3], [11,3], [13,3], [17,3]]).
+        should == 2**3 * 3**3 * 5**3 * 7**3 * 11**3 * 13**3 * 17**3
+    end
 
-  it "returns 1 for an empty factorization" do
-    Integer.from_prime_division([]).should == 1
+    it "returns 1 for an empty factorization" do
+      Integer.from_prime_division([]).should == 1
+    end
   end
 end
diff --git a/spec/ruby/library/prime/integer/prime_division_spec.rb b/spec/ruby/library/prime/integer/prime_division_spec.rb
index be03438a6f..03be0be27b 100644
--- a/spec/ruby/library/prime/integer/prime_division_spec.rb
+++ b/spec/ruby/library/prime/integer/prime_division_spec.rb
@@ -1,19 +1,22 @@
 require_relative '../../../spec_helper'
-require 'prime'
 
-describe "Integer#prime_division" do
-  it "returns an array of a prime factor and a corresponding exponent" do
-    (2*3*5*7*11*13*17).prime_division.should ==
-      [[2,1], [3,1], [5,1], [7,1], [11,1], [13,1], [17,1]]
-  end
+ruby_version_is ""..."3.1" do
+  require 'prime'
 
-  it "returns an empty array for 1" do
-    1.prime_division.should == []
-  end
-  it "returns an empty array for -1" do
-    -1.prime_division.should == [[-1, 1]]
-  end
-  it "raises ZeroDivisionError for 0" do
-    -> { 0.prime_division }.should raise_error(ZeroDivisionError)
+  describe "Integer#prime_division" do
+    it "returns an array of a prime factor and a corresponding exponent" do
+      (2*3*5*7*11*13*17).prime_division.should ==
+        [[2,1], [3,1], [5,1], [7,1], [11,1], [13,1], [17,1]]
+    end
+
+    it "returns an empty array for 1" do
+      1.prime_division.should == []
+    end
+    it "returns an empty array for -1" do
+      -1.prime_division.should == [[-1, 1]]
+    end
+    it "raises ZeroDivisionError for 0" do
+      -> { 0.prime_division }.should raise_error(ZeroDivisionError)
+    end
   end
 end
diff --git a/spec/ruby/library/prime/integer/prime_spec.rb b/spec/ruby/library/prime/integer/prime_spec.rb
index 53de76d5ab..65b779e319 100644
--- a/spec/ruby/library/prime/integer/prime_spec.rb
+++ b/spec/ruby/library/prime/integer/prime_spec.rb
@@ -1,17 +1,20 @@
 require_relative '../../../spec_helper'
-require 'prime'
 
-describe "Integer#prime?" do
-  it "returns a true value for prime numbers" do
-    2.prime?.should be_true
-    3.prime?.should be_true
-    (2**31-1).prime?.should be_true  # 8th Mersenne prime (M8)
-  end
+ruby_version_is ""..."3.1" do
+  require 'prime'
+
+  describe "Integer#prime?" do
+    it "returns a true value for prime numbers" do
+      2.prime?.should be_true
+      3.prime?.should be_true
+      (2**31-1).prime?.should be_true  # 8th Mersenne prime (M8)
+    end
 
-  it "returns a false value for composite numbers" do
-    4.prime?.should be_false
-    15.prime?.should be_false
-    (2**32-1).prime?.should be_false
-    ( (2**17-1)*(2**19-1) ).prime?.should be_false  # M6*M7
+    it "returns a false value for composite numbers" do
+      4.prime?.should be_false
+      15.prime?.should be_false
+      (2**32-1).prime?.should be_false
+      ( (2**17-1)*(2**19-1) ).prime?.should be_false  # M6*M7
+    end
   end
 end