Special details for the Caesar Cipher exercise specs

Author: CarlosCD

README.md

@@ -92,30 +92,30 @@ To run all the specs, run `rake`:
 
 ```Shell
 rake
-  Run options: --seed 51435
+  Run options: --seed 33218
 
   # Running:
 
-  .........
+  ..........
 
-  Finished in 0.113061s, 79.6030 runs/s, 902.1679 assertions/s.
+  Finished in 0.110904s, 90.1681 runs/s, 919.7143 assertions/s.
 
-  9 runs, 102 assertions, 0 failures, 0 errors, 0 skips
+  10 runs, 102 assertions, 0 failures, 0 errors, 0 skips
 ```
 
 The tests can also be run independently, for each exercise:
 
 ```Shell
 rake test TEST=spec/7_caesar_cipher_variation_spec.rb
-  Run options: --seed 62243
+  Run options: --seed 37685
 
   # Running:
 
-  .
+  ..
 
-  Finished in 0.000786s, 1272.2644 runs/s, 24173.0229 assertions/s.
+  Finished in 0.000713s, 2805.0488 runs/s, 26647.9636 assertions/s.
 
-  1 runs, 19 assertions, 0 failures, 0 errors, 0 skips
+  2 runs, 19 assertions, 0 failures, 0 errors, 0 skips
 ```
 
 See the exercises' specs under the `spec/` folder`.

spec/7_caesar_cipher_variation_spec.rb

@@ -2,68 +2,69 @@
 
 require_relative 'spec_helper'
 
-describe 'Exercise 7_caesar_cipher_variation' do
-  before do
-    # Other exercises could be using the same method name:
-    require_relative '../exercises/7_caesar_cipher_variation/solution'
-    alias solution_7_1 encode_str
-    alias solution_7_2 decode
-  end
+class CaesarCipherVariationSpecs < Minitest::Spec
+  # Next line is equivalent to RSpec's before(:all)
+  #   For more details see https://github.com/minitest/minitest/issues/61
+  #   It creates a class as SolutionClass:CaesarCipherVariation wrapping with the solution's code,
+  #   to be shared by all test runs:
+  @@solution_class = SolutionClass.create_wrapping_class_for '7_caesar_cipher_variation'
 
-  describe '#encode_str' do
-    let(:sample_data) do
-      {
-        ['I should have known that you would have a perfect answer for me!!!', 1] =>
-          ['ijJ tipvme ibw', 'f lopxo uibu z', 'pv xpvme ibwf ', 'b qfsgfdu botx', 'fs gps nf!!!'],
-        ['Now you know your ABCs!', 1] => ['noOpx', ' zpv ', 'lopx ', 'zpvs ', 'BCDt!'],
-        ['The same sentence, but split in 5 chunks', 0] =>
-          ['ttThe sam', 'e sentenc', 'e, but sp', 'lit in 5 ', 'chunks'],
-        # Less than 5 chunks (small String):
-        ['A', 2] => ['a','c','C'],
-        # Checking letters cycle (if shift is 1, Z => A, z => a):
-        ['Z becomes A and z becomes a, right?', 1] =>
-          ['zaA cfdp', 'nft B bo', 'e a cfdp', 'nft b, s', 'jhiu?'],
-        ['Hello world!', 6] => ['hnN', 'krr', 'u c', 'uxr', 'j!'],
-        ['Z', 1] => ['z','a','A'],
-        # Cases where the first character is not a letter:
-        ['1 is a valid string', 2] => ['ik1 k', 'u c x', "cnkf ", "uvtkp", "i"],
-        ['123456789Z', 1] => ["za1", "234", "567", "89A"],
-        # Not valid, I need at least one letter to encode the shift:
-        ['12345--#', 2] => []
-      }
-    end
+  describe '7_caesar_cipher_variation' do
+    describe '#encode_str' do
+      let(:sample_data) do
+        {
+          ['I should have known that you would have a perfect answer for me!!!', 1] =>
+            ['ijJ tipvme ibw', 'f lopxo uibu z', 'pv xpvme ibwf ', 'b qfsgfdu botx', 'fs gps nf!!!'],
+          ['Now you know your ABCs!', 1] => ['noOpx', ' zpv ', 'lopx ', 'zpvs ', 'BCDt!'],
+          ['The same sentence, but split in 5 chunks', 0] =>
+            ['ttThe sam', 'e sentenc', 'e, but sp', 'lit in 5 ', 'chunks'],
+          # Less than 5 chunks (small String):
+          ['A', 2] => ['a','c','C'],
+          # Checking letters cycle (if shift is 1, Z => A, z => a):
+          ['Z becomes A and z becomes a, right?', 1] =>
+            ['zaA cfdp', 'nft B bo', 'e a cfdp', 'nft b, s', 'jhiu?'],
+          ['Hello world!', 6] => ['hnN', 'krr', 'u c', 'uxr', 'j!'],
+          ['Z', 1] => ['z','a','A'],
+          # Cases where the first character is not a letter:
+          ['1 is a valid string', 2] => ['ik1 k', 'u c x', "cnkf ", "uvtkp", "i"],
+          ['123456789Z', 1] => ["za1", "234", "567", "89A"],
+          # Not valid, I need at least one letter to encode the shift:
+          ['12345--#', 2] => []
+        }
+      end
 
-    it 'sample cases match' do
-      sample_data.each do |arg, result|
-        assert_equal(result, solution_7_1(*arg), "#{arg} should output #{result}")
+      it 'sample cases match' do
+        sample_data.each do |arg, result|
+          assert_equal(result, @@solution_class.encode_str(*arg), "#{arg} should output #{result}")
+        end
       end
     end
-  end
 
-  describe '#decode' do
-    let(:sample_data) do
-      {
-        ['ijJ tipvme ibw', 'f lopxo uibu z', 'pv xpvme ibwf ', 'b qfsgfdu botx', 'fs gps nf!!!'] =>
-          'I should have known that you would have a perfect answer for me!!!',
-        ['noOpx', ' zpv ', 'lopx ', 'zpvs ', 'BCDt!'] => 'Now you know your ABCs!',
-        ['ttThe sam', 'e sentenc', 'e, but sp', 'lit in 5 ', 'chunks'] =>
-          'The same sentence, but split in 5 chunks',
-        # Less than 5 chunks (small String):
-        ['a','c','C'] => 'A',
-        # Checking letters cycle (if shift is 1, Z => A, z => a):
-        ['zaA cfdp', 'nft B bo', 'e a cfdp', 'nft b, s', 'jhiu?'] =>
-          'Z becomes A and z becomes a, right?',
-        ['hnN', 'krr', 'u c', 'uxr', 'j!'] => 'Hello world!',
-        ['z','a','A'] => 'Z',
-        # Cases where the first character is not a letter:
-        ['ik1 k', 'u c x', "cnkf ", "uvtkp", "i"] => '1 is a valid string',
-        ["za1", "234", "567", "89A"] => '123456789Z'
-      }
-    end
+    describe '#decode' do
+      let(:sample_data) do
+        {
+          ['ijJ tipvme ibw', 'f lopxo uibu z', 'pv xpvme ibwf ', 'b qfsgfdu botx', 'fs gps nf!!!'] =>
+            'I should have known that you would have a perfect answer for me!!!',
+          ['noOpx', ' zpv ', 'lopx ', 'zpvs ', 'BCDt!'] => 'Now you know your ABCs!',
+          ['ttThe sam', 'e sentenc', 'e, but sp', 'lit in 5 ', 'chunks'] =>
+            'The same sentence, but split in 5 chunks',
+          # Less than 5 chunks (small String):
+          ['a','c','C'] => 'A',
+          # Checking letters cycle (if shift is 1, Z => A, z => a):
+          ['zaA cfdp', 'nft B bo', 'e a cfdp', 'nft b, s', 'jhiu?'] =>
+            'Z becomes A and z becomes a, right?',
+          ['hnN', 'krr', 'u c', 'uxr', 'j!'] => 'Hello world!',
+          ['z','a','A'] => 'Z',
+          # Cases where the first character is not a letter:
+          ['ik1 k', 'u c x', "cnkf ", "uvtkp", "i"] => '1 is a valid string',
+          ["za1", "234", "567", "89A"] => '123456789Z'
+        }
+      end
 
-    it 'sample cases match' do
-      sample_data.each do |arg, result|
-        assert_equal(result, solution_7_2(arg), "#{arg} should output #{result}")
+      it 'sample cases match' do
+        sample_data.each do |arg, result|
+          assert_equal(result, @@solution_class.decode(arg), "#{arg} should output #{result}")
+        end
       end
     end
   end