trackler 2.1.0.9 → 2.1.0.10

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c4641a9164d7c10684cccf03044f43ec746c4652
-  data.tar.gz: af6cf2aff8d93a5ec110a2c65fe5676f90e836d8
+  metadata.gz: f2a21bf8340d9ec5c5ee37ef6293c960edcb96a6
+  data.tar.gz: 19888fea6477f6e3538950844ee946deb33040b1
 SHA512:
-  metadata.gz: ed95dff49c3c7509719cc4a8d8abfe8ef26c9f4e39869b2eccf934f077357c6d6a1446fe93433c609d8cf474a6e3756bdc26cc573aeefaac6045e13d4ceee25a
-  data.tar.gz: 03373c698f08a120bab897e8613e7da90e00c8455044c86d774494d338e6e083308dc7fb5f8827a857e15b0989ba81422183e614787dc6e99c1e60e77252a61b
+  metadata.gz: 7aa55c5be13d4c3a2795304620f184f8f05c98453d6dbe6af8da4f546af39fc836bb99cc5e694a5748563625e5ca86f19635906fd9072944ec9f5f4ebff81184
+  data.tar.gz: 68715d7a0939dba01499480eca11259b3bb3b0497a35fc7b07dfeec70f8da13ec76489f6a41f6a58c07f7250b9f6710283075915eb400ea858dbd5fcc101324f

data/common/exercises/perfect-numbers/description.md

@@ -1,4 +1,4 @@
-The Greek mathematican [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
+The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
 
 - **Perfect**: aliquot sum = number 
   - 6 is a perfect number because (1 + 2 + 3) = 6
@@ -10,4 +10,4 @@ The Greek mathematican [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) de
   - 8 is a deficient number because (1 + 2 + 4) = 7
   - Prime numbers are deficient
   
-Implement a way to determine whether a given number is **perfect**. Depending on your language track, you may also need to implement a way to determine whethether a given number is **abundant** or **deficient**.
+Implement a way to determine whether a given number is **perfect**. Depending on your language track, you may also need to implement a way to determine whether a given number is **abundant** or **deficient**.

data/common/exercises/phone-number/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "phone-number",
-  "version": "1.1.0",
+  "version": "1.2.0",
   "cases": [
     {
       "description": "Cleanup user-entered phone numbers",
@@ -70,12 +70,6 @@
           "phrase": "123-@:!-7890",
           "expected": null
         },
-        {
-          "description": "invalid with right number of digits but letters mixed in",
-          "property": "clean",
-          "phrase": "1a2b3c4d5e6f7g8h9i0j",
-          "expected": null
-        },
         {
           "description": "invalid if area code does not start with 2-9",
           "property": "clean",

data/common/exercises/tournament/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "tournament",
-  "version": "1.1.0",
+  "version": "1.3.0",
   "comments": [
     "The inputs and outputs are represented as arrays of strings to",
     "improve readability in this JSON file.",
@@ -10,6 +10,101 @@
     "a single string."
   ],
   "cases": [
+    {
+      "description": "just the header if no input",
+      "property": "tally",
+      "input": [],
+      "expected": [ "Team                           | MP |  W |  D |  L |  P" ]
+    },
+    {
+      "description": "a win is three points, a loss is zero points",
+      "property": "tally",
+      "input": [
+        "Allegoric Alaskans;Blithering Badgers;win"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Allegoric Alaskans             |  1 |  1 |  0 |  0 |  3",
+        "Blithering Badgers             |  1 |  0 |  0 |  1 |  0"
+		]
+	},
+    {
+      "description": "a win can also be expressed as a loss",
+      "property": "tally",
+      "input": [
+        "Blithering Badgers;Allegoric Alaskans;loss"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Allegoric Alaskans             |  1 |  1 |  0 |  0 |  3",
+        "Blithering Badgers             |  1 |  0 |  0 |  1 |  0"
+		]
+	},
+    {
+      "description": "a different team can win",
+      "property": "tally",
+      "input": [
+        "Blithering Badgers;Allegoric Alaskans;win"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Blithering Badgers             |  1 |  1 |  0 |  0 |  3",
+        "Allegoric Alaskans             |  1 |  0 |  0 |  1 |  0"
+		]
+	},
+    {
+      "description": "a draw is one point each",
+      "property": "tally",
+      "input": [
+        "Allegoric Alaskans;Blithering Badgers;draw"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Allegoric Alaskans             |  1 |  0 |  1 |  0 |  1",
+        "Blithering Badgers             |  1 |  0 |  1 |  0 |  1"
+		]
+	},
+    {
+      "description": "There can be more than one match",
+      "property": "tally",
+      "input": [
+        "Allegoric Alaskans;Blithering Badgers;win",
+        "Allegoric Alaskans;Blithering Badgers;win"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Allegoric Alaskans             |  2 |  2 |  0 |  0 |  6",
+        "Blithering Badgers             |  2 |  0 |  0 |  2 |  0"
+		]
+	},
+    {
+      "description": "There can be more than one winner",
+      "property": "tally",
+      "input": [
+        "Allegoric Alaskans;Blithering Badgers;loss",
+        "Allegoric Alaskans;Blithering Badgers;win"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Allegoric Alaskans             |  2 |  1 |  0 |  1 |  3",
+        "Blithering Badgers             |  2 |  1 |  0 |  1 |  3"
+		]
+	},
+    {
+      "description": "There can be more than two teams",
+      "property": "tally",
+      "input": [
+        "Allegoric Alaskans;Blithering Badgers;win",
+        "Blithering Badgers;Courageous Californians;win",
+        "Courageous Californians;Allegoric Alaskans;loss"
+      ],
+      "expected": [
+        "Team                           | MP |  W |  D |  L |  P",
+        "Allegoric Alaskans             |  2 |  2 |  0 |  0 |  6",
+        "Blithering Badgers             |  2 |  1 |  0 |  1 |  3",
+        "Courageous Californians        |  2 |  0 |  0 |  2 |  0"
+		]
+	},
     {
       "description": "typical input",
       "property": "tally",
@@ -64,26 +159,6 @@
         "Blithering Badgers             |  3 |  0 |  1 |  2 |  1",
         "Devastating Donkeys            |  3 |  0 |  1 |  2 |  1"
       ]
-    },
-    {
-      "comments": [
-        "Invalid input lines in an otherwise-valid game",
-        "still results in valid output."
-      ],
-      "description": "mostly invalid lines",
-      "property": "tally",
-      "input": [
-        "",
-        "Allegoric Alaskans@Blithering Badgers;draw",
-        "Blithering Badgers;Devastating Donkeys;loss",
-        "Devastating Donkeys;Courageous Californians;win;5",
-        "Courageous Californians;Allegoric Alaskans;los"
-      ],
-      "expected": [
-        "Team                           | MP |  W |  D |  L |  P",
-        "Devastating Donkeys            |  1 |  1 |  0 |  0 |  3",
-        "Blithering Badgers             |  1 |  0 |  0 |  1 |  0"
-      ]
     }
   ]
 }

data/common/exercises/tournament/description.md

@@ -60,8 +60,3 @@ Devastating Donkeys;Courageous Californians;draw
 ```
 
 Means that the Devastating Donkeys and Courageous Californians tied.
-
-Your program should only process input lines that follow this format.
-All other lines should be ignored:
-If an input contains both valid and invalid input lines,
-output a table that contains just the results from the valid lines.

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.1.0.9"
+  VERSION = "2.1.0.10"
 end

data/tracks/coq/README.md

@@ -6,8 +6,6 @@ Exercism exercises in Coq.
 
 ## Setup
 
-
-
 There are 2 ways to insal Coq:
 
 1. [Recommened] Using OPAM package manger: https://coq.inria.fr/opam/www/using.html
@@ -43,8 +41,11 @@ We simulate Test-Driven Development (TDD) by implementing the tests in order of
 
 Test files should use the following format:
 
-```
-# include the body of an example test
+```Coq
+Theorem TautologyExercise: True.
+Proof.
+  (* Add your proof here *)
+Qed.
 ```
 
 ## Submitting a Pull Request ##
@@ -65,16 +66,13 @@ Please keep the following in mind:
 
 ## Contributing a New Exercise ##
 
-- All Exercism exercises must be defined in [x-common](https://github.com/exercism/x-common/tree/master/exercises) before they are implemented for a specific track. Please submit a PR there if your exercise is new to Exercism.
-
 - Please make sure the new exercise conforms to specifications in the [exercism/x-common](https://github.com/exercism/x-common) repo.
 
 - Each exercise must stand on its own. Do not reference files outside the exercise directory. They will not be included when the user fetches the exercise.
 
 - Exercises should use only the Coq core libraries.
 
-- Please do not add a README or README.md file to the exercise directory. The READMEs are constructed using shared metadata, which lives in the
-[exercism/x-common](https://github.com/exercism/x-common) repository. Further explanation can be found in [fixing-exercise-readmes](https://github.com/exercism/exercism.io/blob/master/docs/fixing-exercise-readmes.md)
+- Please do not add a README or README.md file to the exercise directory. The READMEs are constructed using shared metadata. Further explanation can be found in [fixing-exercise-readmes](https://github.com/exercism/exercism.io/blob/master/docs/fixing-exercise-readmes.md)
 
 - Each exercise should have a test suite, an example solution, a template file for the real implementation and ... (anything else that needs to go with each exercise for this track). The CI build expects files to be named using the following convention: (describe the Coq convention for naming the various files that make up an exercise).
 

data/tracks/coq/exercises/hello-world/example.v

@@ -0,0 +1,3 @@
+Require Import Coq.Strings.String.
+
+Definition hello:string := "Hello, World!".

data/tracks/coq/exercises/hello-world/hello-world.v

@@ -0,0 +1,3 @@
+Require Import Coq.Strings.String.
+
+Definition hello:string :=  (* add your definition here *).

data/tracks/coq/exercises/rna-transcription/DNA.v

@@ -0,0 +1,4 @@
+(* Type definitions *)
+
+Inductive DNA := dA | dC | dG | dT.
+Inductive RNA := rA | rC | rG | rU.

data/tracks/coq/exercises/rna-transcription/example.v

@@ -0,0 +1,15 @@
+Require Import Coq.Lists.List.
+
+Definition to_rna: list DNA -> list RNA
+  := map (fun x => match x with
+                | dG => rC
+                | dC => rG
+                | dT => rA
+                | dA => rU
+                end).
+
+
+(* TEST:
+Import ListNotations.
+Compute to_rna [dA ; dG].
+*)

data/tracks/coq/exercises/rna-transcription/rna-transcription.v

@@ -0,0 +1,5 @@
+Require Import DNA.
+
+Definition to_rna: list DNA -> list RNA :=
+  (* Add your definition here *)
+  .

data/tracks/coq/exercises/tautology/description.md

@@ -0,0 +1 @@
+Let us start by proving something we already know is true.

data/tracks/coq/exercises/tautology/example.v

@@ -0,0 +1,4 @@
+Theorem TautologyExercise: True.
+Proof.
+  tauto.
+Qed.

data/tracks/coq/exercises/tautology/tautology.v

@@ -0,0 +1,4 @@
+Theorem TautologyExercise: True.
+Proof.
+  (* Add your proof here *)
+Qed.

data/tracks/haskell/exercises/accumulate/package.yaml

@@ -1,4 +1,5 @@
 name: accumulate
+version: 0.1.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/accumulate/test/Tests.hs

@@ -10,9 +10,6 @@ main = hspecWith defaultConfig {configFastFail = True} specs
 specs :: Spec
 specs = describe "accumulate" $ do
 
-    -- As of 2016-07-27, there was no reference file
-    -- for the test cases in `exercism/x-common`.
-
     let square x = x * x :: Int
 
     it "empty accumulation" $

data/tracks/haskell/exercises/acronym/package.yaml

@@ -1,4 +1,5 @@
 name: acronym
+version: 1.0.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/acronym/test/Tests.hs

@@ -15,11 +15,6 @@ specs = describe "acronym" $
   where
     test Case {..} = it description $ abbreviate input `shouldBe` expected
 
--- Adapted from
--- Source: exercism/x-common/exercises/acronym/canonical-data.json
--- Version: 1.0.0
--- Date: 2017-03-31
-
 data Case = Case { description :: String
                  , input       :: String
                  , expected    :: String

data/tracks/haskell/exercises/all-your-base/package.yaml

@@ -1,4 +1,5 @@
 name: all-your-base
+version: 0.9.0.1 # 2016-06-29
 
 dependencies:
   - base

data/tracks/haskell/exercises/all-your-base/test/Tests.hs

@@ -19,8 +19,6 @@ specs = describe "all-your-base" $
         assertion  = expression `shouldBe` outputDigits
         expression = rebase inputBase outputBase inputDigits
 
--- Test cases adapted from `exercism/x-common/all-your-base.json` on 2016-06-29.
-
 data Case = Case { description  ::        String
                  , inputBase    ::        Integer
                  , inputDigits  ::       [Integer]

data/tracks/haskell/exercises/allergies/package.yaml

@@ -1,4 +1,5 @@
 name: allergies
+version: 0.9.0.1 # 2016-08-01
 
 dependencies:
   - base

data/tracks/haskell/exercises/allergies/test/Tests.hs

@@ -23,8 +23,6 @@ main = hspecWith defaultConfig {configFastFail = True} specs
 specs :: Spec
 specs = describe "allergies" $ do
 
-          -- Test cases adapted from `exercism/x-common/allergies.json` on 2016-08-01.
-
           describe "isAllergicTo" $ do
 
             it "no allergies means not allergic" $ do

data/tracks/haskell/exercises/alphametics/package.yaml

@@ -1,4 +1,5 @@
 name: alphametics
+version: 0.9.0.1 # 2016-10-26
 
 dependencies:
   - base

data/tracks/haskell/exercises/alphametics/test/Tests.hs

@@ -21,8 +21,6 @@ specs = describe "alphametics" $
         shouldMatchSolution = shouldBe `on` fmap sort
         assertion = solve puzzle `shouldMatchSolution` expected
 
--- Test cases adapted from `exercism/x-common/exercises/alphametics/canonical-data.json` on 2016-10-26.
-
 data Case = Case { description :: String
                  , puzzle      :: String
                  , expected    :: Maybe[(Char, Int)]

data/tracks/haskell/exercises/anagram/package.yaml

@@ -1,4 +1,5 @@
 name: anagram
+version: 0.9.0.1 # 2016-10-26
 
 dependencies:
   - base

data/tracks/haskell/exercises/anagram/test/Tests.hs

@@ -24,8 +24,6 @@ specs = describe "anagram" $
                    . map fromList
                    $ candidates
 
--- Test cases adapted from `exercism/x-common` on 2016-10-26.
-
 data Case = Case { description ::  String
                  , subject     ::  String
                  , candidates  :: [String]

data/tracks/haskell/exercises/atbash-cipher/package.yaml

@@ -1,4 +1,5 @@
 name: atbash-cipher
+version: 0.9.0.1 # 2017-02-01
 
 dependencies:
   - base

data/tracks/haskell/exercises/atbash-cipher/test/Tests.hs

@@ -16,8 +16,6 @@ specs = describe "atbash-cipher" $ do
   where
     test f Case{..} = it description $ f phrase `shouldBe` expected
 
--- Test cases adapted from `exercism/x-common/atbash-cipher.json` on 2017-02-01.
-
 data Case = Case { description :: String
                  , phrase      :: String
                  , expected    :: String

data/tracks/haskell/exercises/bank-account/package.yaml

@@ -1,4 +1,5 @@
 name: bank-account
+version: 0.1.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/bank-account/test/Tests.hs

@@ -17,9 +17,6 @@ main = hspecWith defaultConfig {configFastFail = True} specs
 specs :: Spec
 specs = describe "bank-account" $ do
 
-    -- As of 2016-08-01, there was no reference file
-    -- for the test cases in `exercism/x-common`.
-
     it "initial balance is 0" $ do
         account  <-  openAccount
         getBalance   account `shouldReturn` Just 0

data/tracks/haskell/exercises/beer-song/package.yaml

@@ -1,4 +1,5 @@
 name: beer-song
+version: 0.1.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/binary/package.yaml

@@ -1,4 +1,5 @@
 name: binary
+version: 0.9.0.1 # 2016-07-26
 
 dependencies:
   - base

data/tracks/haskell/exercises/binary/test/Tests.hs

@@ -19,7 +19,6 @@ specs = describe "binary" $
       where
         assertion = toDecimal binary `shouldBe` fromIntegral expected
 
--- Test cases adapted from `exercism/x-common/binary.json` on 2016-07-26.
 -- Some descriptions mentioning "errors" where changed to avoid confusion.
 
 data Case = Case { description :: String

data/tracks/haskell/exercises/binary-search-tree/package.yaml

@@ -1,4 +1,5 @@
 name: binary-search-tree
+version: 0.1.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/binary-search-tree/test/Tests.hs

@@ -18,9 +18,6 @@ main = hspecWith defaultConfig {configFastFail = True} specs
 specs :: Spec
 specs = describe "binary-seach-tree" $ do
 
-    -- As of 2016-08-03, there was no reference file
-    -- for the test cases in `exercism/x-common`.
-
     let int4   = 4  ::  Int
     let noInts = [] :: [Int]
 

data/tracks/haskell/exercises/bob/package.yaml

@@ -1,4 +1,5 @@
 name: bob
+version: 0.9.0.1 # 2016-11-29
 
 dependencies:
   - base

data/tracks/haskell/exercises/bob/test/Tests.hs

@@ -15,8 +15,6 @@ specs = describe "bob" $
   where
     test Case{..} = it description $ responseFor input `shouldBe` expected
 
--- Test cases adapted from `exercism/x-common/bob.json` on 2016-11-29.
-
 data Case = Case { description :: String
                  , input       :: String
                  , expected    :: String

data/tracks/haskell/exercises/bowling/package.yaml

@@ -1,4 +1,5 @@
 name: bowling
+version: 0.9.0.1 # 2016-11-20
 
 dependencies:
   - base

data/tracks/haskell/exercises/bowling/test/Tests.hs

@@ -19,8 +19,6 @@ specs = describe "bowling" $
         assertion = result `shouldBe` expected
         result = score rolls
 
--- Test cases adapted from `exercism/x-common/bowling` on 2016-11-20.
-
 data Case = Case { description :: String
                  , rolls       :: [Int]
                  , expected    :: Either BowlingError Int

data/tracks/haskell/exercises/bracket-push/package.yaml

@@ -1,4 +1,5 @@
 name: bracket-push
+version: 1.1.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/bracket-push/test/Tests.hs

@@ -11,15 +11,10 @@ main = hspecWith defaultConfig {configFastFail = True} specs
 
 specs :: Spec
 specs = describe "bracket-push" $
-          describe "isPaired" $ for_ cases test
+          describe "arePaired" $ for_ cases test
   where
     test Case{..} = it description $ arePaired input `shouldBe` expected
 
--- Adapted from
--- Source: exercism/x-common/exercises/bracket-push/canonical-data.json
--- Version: 1.1.0
--- Date: 2017-04-07.
-
 data Case = Case { description :: String
                  , input       :: String
                  , expected    :: Bool

data/tracks/haskell/exercises/change/package.yaml

@@ -1,4 +1,5 @@
 name: change
+version: 0.9.0.1 # 2016-09-17
 
 dependencies:
   - base

data/tracks/haskell/exercises/change/test/Tests.hs

@@ -20,8 +20,6 @@ specs = describe "Change" $
         assertion  = expression `shouldBe` expected
         expression = sort <$> findFewestCoins target coins
 
--- Test cases adapted from `exercism/x-common` on 2016-09-17.
-
 data Case = Case { description  ::        String
                  , coins        ::       [Integer]
                  , target       ::        Integer

data/tracks/haskell/exercises/clock/package.yaml

@@ -1,4 +1,5 @@
 name: clock
+version: 0.9.0.1 # 2016-03-29
 
 dependencies:
   - base

data/tracks/haskell/exercises/clock/test/Tests.hs

@@ -25,8 +25,6 @@ specs = describe "clock" $ do
       it "negate works" $
         negate (fromHourMin 23 55) `shouldBe` 5
 
-    -- Test cases extracted from x-common/clock.json from 2016-03-29
-
     describe "standard tests" $ do
 
       describe "create" $ for_ createCases createTest

data/tracks/haskell/exercises/connect/package.yaml

@@ -1,4 +1,5 @@
 name: connect
+version: 0.9.0.1 # 2016-09-16
 
 dependencies:
   - base

data/tracks/haskell/exercises/connect/test/Tests.hs

@@ -19,8 +19,6 @@ specs = describe "connect" $
         assertion  = winner testBoard `shouldBe` expected
         testBoard  = filter (/=' ') <$> board
 
--- Test cases adapted from `exercism/x-common` on 2016-09-16.
-
 data Case = Case { description :: String
                  , board       :: [String]
                  , expected    :: Maybe Mark

data/tracks/haskell/exercises/crypto-square/package.yaml

@@ -1,4 +1,5 @@
 name: crypto-square
+version: 0.1.0.1
 
 dependencies:
   - base

data/tracks/haskell/exercises/crypto-square/test/Tests.hs

@@ -26,8 +26,6 @@ specs = describe "crypto-square" $
       it "reorders the characters" $ encode input `shouldMatchString` expected
       it "groups the output"       $ encode input `shouldMatchWords`  expected
 
--- Test cases created from scratch on 2016-10-05, diverging from `x-common`.
-
 data Case = Case { description :: String
                  , input       :: String
                  , expected    :: String

data/tracks/haskell/exercises/custom-set/package.yaml

@@ -1,4 +1,5 @@
 name: custom-set
+version: 0.9.0.1 # 2016-09-03
 
 dependencies:
   - base

data/tracks/haskell/exercises/custom-set/test/Tests.hs

@@ -29,9 +29,6 @@ specs = describe "custom-set" $ do
 
     describe "standard tests" $ do
 
-      -- Test cases adapted from `exercism/x-common/custom-set.json`
-      -- on 2016-09-03.
-
       describe "null" $ do
 
         it "sets with no elements are empty" $

data/tracks/haskell/exercises/difference-of-squares/package.yaml

@@ -1,4 +1,5 @@
 name: difference-of-squares
+version: 0.9.0.1 # 2016-08-03
 
 dependencies:
   - base

data/tracks/haskell/exercises/difference-of-squares/test/Tests.hs

@@ -11,9 +11,6 @@ main = hspecWith defaultConfig {configFastFail = True} specs
 specs :: Spec
 specs = describe "differenceOfSquares" $ do
 
-    -- Test cases adapted from `exercism/x-common/difference-of-squares.json`
-    -- on 2016-08-03.
-
     describe "squareOfSums" $ do
       it "square of sum 5"   $ squareOfSums   5 `shouldBe`      225
       it "square of sum 10"  $ squareOfSums  10 `shouldBe`     3025