trackler 2.2.1.67 → 2.2.1.68

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 956bc9de5fbd416f23d6f7cfeabbc4c28edcd559
-  data.tar.gz: 9c7a904426ed89d05476a3066a5110c41f694584
+  metadata.gz: 93727b2027f0b9bb82b47a47508ca7ffcc6ff35d
+  data.tar.gz: 5b5ad9daef87088409e3e8b2c22ad16803cddd8d
 SHA512:
-  metadata.gz: bbc5d5a656753aea898eebf5caee55446ad0793cd462e43356369400c83bcfbaf0e9fbc4d990a79569b1b981b9db846a786eebde7ea77e2add4704d8c046f162
-  data.tar.gz: 4648f51dbfef1b5446d9761608a0f03a195f2026e24a507028d46ca4b2261b959c21f498faf1c8a48419392a60239f1acf924eccac42d070a453bd19fb9433a6
+  metadata.gz: 76aff154bb6cfb996c616f4f77cfd2de03d6029fbf1cab3255bb162310a6b41767576a818b001abeec9f3e875b27bc9118833ba83ae8e65a5ed35df9427be62e
+  data.tar.gz: 361c13c1a88ce84f99c1bfea50d5af3590fc9ee21a85a22e10c3333089f29cba08211a6e703c6eb1d23c5185636170fd7c93603f4ef6b889e28261121e249f6c

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.67"
+  VERSION = "2.2.1.68"
 end

data/problem-specifications/README.md

@@ -30,13 +30,13 @@ There are three metadata files:
 
 * `description.md` - the basic problem description
 * `metadata.yml` - additional information about the problem, such as where it came from
-* `canonical-data.json` (optional) - standardized test inputs and outputs that can be used to implement the problem
+* `canonical-data.json` - standardized test inputs and outputs that can be used to implement the problem
 
 ## Test Data Format (canonical-data.json)
 
 This data can be incorporated into test programs manually or extracted by a
 program.  The file format is described in `canonical-schema.json`, but it
-is easier to understand with a example:
+is easier to understand with an example:
 
 ```json
 { "exercise": "foobar"
@@ -103,11 +103,11 @@ Keep in mind that the description should not simply explain **what** each case
 is (that is redundant information) but also **why** each case is there. For
 example, what kinds of implementation mistakes might this case help us find?
 
-There are also some convention about `expected` that you must follow:
+There are also some conventions that must be followed:
 
   - All keys should follow the [lowerCamelCase](http://wiki.c2.com/?LowerCamelCase) convention.
-  - if the input is valid but there is no result for the input, the value at `"expected"` should be `null`.
-  - if an error is expected (because the input is invalid, or any other reason), the value at `"expected"` should be an object containing exactly one property, `"error"`, whose value is a string.
+  - If the input is valid but there is no result for the input, the value at `"expected"` should be `null`.
+  - If an error is expected (because the input is invalid, or any other reason), the value at `"expected"` should be an object containing exactly one property, `"error"`, whose value is a string.
     - The string should explain why the error would occur.
     - A particular track's implementation of the exercise **need not** necessarily check that the error includes that exact string as the cause, depending on what is idiomatic in the language (it may not be idiomatic to check strings for error messages).
 
@@ -165,7 +165,7 @@ PATCH changes would never break well-designed test generators, because the test
 
 ## Automated Tests
 
-`canonical-data.json` for each exercise is checked for compliancy against the [canonical-schema.json](canonical-schema.json).
+`canonical-data.json` for each exercise is checked for compliance against the [canonical-schema.json](canonical-schema.json).
 In order to run these tests, you will need to have `node` and `npm` installed on your system.
 Install them from [here](https://nodejs.org/en/). (`npm` comes bundled with most installations of `node`).
 

data/tracks/csharp/exercises/all-your-base/AllYourBaseTest.cs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 1.1.0 of the canonical data.
+// This file was auto-generated based on version 2.0.0 of the canonical data.
 
 using Xunit;
 using System;
@@ -91,7 +91,8 @@ public class AllYourBaseTest
         var inputBase = 2;
         var inputDigits = new int[0];
         var outputBase = 10;
-        Assert.Throws<ArgumentException>(() => AllYourBase.Rebase(inputBase, inputDigits, outputBase));
+        var expected = new[] { 0 };
+        Assert.Equal(expected, AllYourBase.Rebase(inputBase, inputDigits, outputBase));
     }
 
     [Fact(Skip = "Remove to run test")]
@@ -100,7 +101,8 @@ public class AllYourBaseTest
         var inputBase = 10;
         var inputDigits = new[] { 0 };
         var outputBase = 2;
-        Assert.Throws<ArgumentException>(() => AllYourBase.Rebase(inputBase, inputDigits, outputBase));
+        var expected = new[] { 0 };
+        Assert.Equal(expected, AllYourBase.Rebase(inputBase, inputDigits, outputBase));
     }
 
     [Fact(Skip = "Remove to run test")]
@@ -109,7 +111,8 @@ public class AllYourBaseTest
         var inputBase = 10;
         var inputDigits = new[] { 0, 0, 0 };
         var outputBase = 2;
-        Assert.Throws<ArgumentException>(() => AllYourBase.Rebase(inputBase, inputDigits, outputBase));
+        var expected = new[] { 0 };
+        Assert.Equal(expected, AllYourBase.Rebase(inputBase, inputDigits, outputBase));
     }
 
     [Fact(Skip = "Remove to run test")]
@@ -118,7 +121,8 @@ public class AllYourBaseTest
         var inputBase = 7;
         var inputDigits = new[] { 0, 6, 0 };
         var outputBase = 10;
-        Assert.Throws<ArgumentException>(() => AllYourBase.Rebase(inputBase, inputDigits, outputBase));
+        var expected = new[] { 4, 2 };
+        Assert.Equal(expected, AllYourBase.Rebase(inputBase, inputDigits, outputBase));
     }
 
     [Fact(Skip = "Remove to run test")]

data/tracks/csharp/exercises/all-your-base/Example.cs

@@ -8,16 +8,20 @@ public static class AllYourBase
     {
         if (inputBase < 2) throw new ArgumentException("Invalid input base.");
         if (outputBase < 2) throw new ArgumentException("Invalid output base.");
-        if (inputDigits.Length == 0) throw new ArgumentException("Empty input digits.");
 
-        return ToDigits(outputBase, FromDigits(inputBase, inputDigits));
+        var inputDigitsWithoutLeadingZeros = inputDigits.SkipWhile(digit => digit == 0).ToArray();
+
+        if (inputDigitsWithoutLeadingZeros.Length == 0) 
+            return new[] { 0 };
+
+        return ToDigits(outputBase, FromDigits(inputBase, inputDigitsWithoutLeadingZeros));
     }
 
     private static int FromDigits(int fromBase, int[] fromDigits)
     {
         return fromDigits.Aggregate(0, (acc, x) =>
         {
-            if (x < 0 || x >= fromBase || (x == 0 & acc == 0)) throw new ArgumentException("Invalid input digit");
+            if (x < 0 || x >= fromBase) throw new ArgumentException("Invalid input digit");
 
             return acc*fromBase + x;
         });

data/tracks/csharp/exercises/nth-prime/NthPrimeTest.cs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 1.0.0 of the canonical data.
+// This file was auto-generated based on version 2.0.0 of the canonical data.
 
 using Xunit;
 using System;

data/tracks/csharp/generators/Exercises/AllYourBase.cs

@@ -1,4 +1,5 @@
 using System;
+using System.Collections.Generic;
 using Generators.Input;
 
 namespace Generators.Exercises
@@ -9,7 +10,7 @@ namespace Generators.Exercises
         {
             foreach (var canonicalDataCase in canonicalData.Cases)
             {
-                canonicalDataCase.ExceptionThrown = canonicalDataCase.Expected is null ? typeof(ArgumentException) : null;
+                canonicalDataCase.ExceptionThrown = canonicalDataCase.Expected is Dictionary<string, object> ? typeof(ArgumentException) : null;
                 canonicalDataCase.UseVariablesForInput = true;
                 canonicalDataCase.UseVariableForExpected = true;
             }

data/tracks/csharp/generators/Exercises/NthPrime.cs

@@ -1,4 +1,5 @@
 using System;
+using System.Collections.Generic;
 using Generators.Input;
 
 namespace Generators.Exercises
@@ -8,7 +9,7 @@ namespace Generators.Exercises
         protected override void UpdateCanonicalData(CanonicalData canonicalData)
         {
             foreach (var canonicalDataCase in canonicalData.Cases)
-                canonicalDataCase.ExceptionThrown = canonicalDataCase.Expected is bool ? typeof(ArgumentOutOfRangeException) : null;
+                canonicalDataCase.ExceptionThrown = canonicalDataCase.Expected is Dictionary<string, object> ? typeof(ArgumentOutOfRangeException) : null;
         }
     }
 }

data/tracks/fsharp/config.json

@@ -642,6 +642,17 @@
       "unlocked_by": "robot-simulator",
       "uuid": "18652e46-6dd2-4030-84af-be0965c92991"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "isbn-verifier",
+      "topics": [
+        "loops",
+        "strings"
+      ],
+      "unlocked_by": "bob",
+      "uuid": "c339c32c-3310-4b8c-b4e6-0f9f651064b7"
+    },
     {
       "core": false,
       "difficulty": 5,

data/tracks/fsharp/exercises/Exercises.sln

@@ -218,6 +218,8 @@ Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "ReverseString", "reverse-st
 EndProject
 Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "RotationalCipher", "rotational-cipher\RotationalCipher.fsproj", "{91D0A5E0-E39C-472B-87FB-6DD17336AA22}"
 EndProject
+Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "IsbnVerifier", "isbn-verifier\IsbnVerifier.fsproj", "{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}"
+EndProject
 Global
 	GlobalSection(SolutionConfigurationPlatforms) = preSolution
 		Debug|Any CPU = Debug|Any CPU
@@ -656,6 +658,10 @@ Global
 		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Debug|Any CPU.Build.0 = Debug|Any CPU
 		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Release|Any CPU.ActiveCfg = Release|Any CPU
 		{91D0A5E0-E39C-472B-87FB-6DD17336AA22}.Release|Any CPU.Build.0 = Release|Any CPU
+		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Release|Any CPU.Build.0 = Release|Any CPU
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
 		HideSolutionNode = FALSE

data/tracks/fsharp/exercises/isbn-verifier/Example.fs

@@ -0,0 +1,19 @@
+module IsbnVerifier
+
+open System.Text.RegularExpressions
+
+let private digitToInt digit = if digit = 'X' then 10 else int digit - int '0'
+
+let private checkSum isbn = 
+    isbn
+    |> Seq.mapi (fun i digit -> (10 - i) * digitToInt digit)
+    |> Seq.sum
+
+let private cleanup (isbn: string) = isbn.Replace("-", "")
+
+let isValid (isbn: string) = 
+    let cleanedUpIsbn = cleanup isbn
+
+    match Regex.IsMatch(cleanedUpIsbn, "^[0-9]{9}[0-9X]$") with
+    | false -> false
+    | true  -> checkSum cleanedUpIsbn % 11 = 0

data/tracks/fsharp/exercises/isbn-verifier/IsbnVerifier.fs

@@ -0,0 +1,3 @@
+module IsbnVerifier
+
+let isValid isbn = failwith "You need to implement this function."

data/tracks/fsharp/exercises/isbn-verifier/IsbnVerifier.fsproj

@@ -0,0 +1,23 @@
+<Project Sdk="Microsoft.NET.Sdk">
+
+  <PropertyGroup>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
+
+    <IsPackable>false</IsPackable>
+  </PropertyGroup>
+
+  <ItemGroup>
+    <Compile Include="IsbnVerifier.fs" />
+    <Compile Include="IsbnVerifierTest.fs" />
+    <Compile Include="Program.fs" />
+  </ItemGroup>
+
+  <ItemGroup>
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.5.0" />
+    <PackageReference Include="xunit" Version="2.3.1" />
+    <PackageReference Include="xunit.runner.visualstudio" Version="2.3.1" />
+    <PackageReference Include="FsUnit.xUnit" Version="3.0.0" />
+    <DotNetCliToolReference Include="dotnet-xunit" Version="2.3.1" />
+  </ItemGroup>
+
+</Project>

data/tracks/fsharp/exercises/isbn-verifier/IsbnVerifierTest.fs

@@ -0,0 +1,61 @@
+// This file was auto-generated based on version 2.0.0 of the canonical data.
+
+module IsbnVerifierTest
+
+open FsUnit.Xunit
+open Xunit
+
+open IsbnVerifier
+
+[<Fact>]
+let ``Valid isbn number`` () =
+    isValid "3-598-21508-8" |> should equal true
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Invalid isbn check digit`` () =
+    isValid "3-598-21508-9" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Valid isbn number with a check digit of 10`` () =
+    isValid "3-598-21507-X" |> should equal true
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Check digit is a character other than X`` () =
+    isValid "3-598-21507-A" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Invalid character in isbn`` () =
+    isValid "3-598-2K507-0" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``X is only valid as a check digit`` () =
+    isValid "3-598-2X507-9" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Valid isbn without separating dashes`` () =
+    isValid "3598215088" |> should equal true
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Isbn without separating dashes and X as check digit`` () =
+    isValid "359821507X" |> should equal true
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Isbn without check digit and dashes`` () =
+    isValid "359821507" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Too long isbn and no dashes`` () =
+    isValid "3598215078X" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Isbn without check digit`` () =
+    isValid "3-598-21507" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Too long isbn`` () =
+    isValid "3-598-21507-XX" |> should equal false
+
+[<Fact(Skip = "Remove to run test")>]
+let ``Check digit of X should not be used for 0`` () =
+    isValid "3-598-21515-X" |> should equal false
+

data/tracks/fsharp/exercises/isbn-verifier/Program.fs

@@ -0,0 +1 @@
+module Program = let [<EntryPoint>] main _ = 0

data/tracks/fsharp/exercises/isbn-verifier/README.md

@@ -0,0 +1,32 @@
+Check if a given ISBN-10 is valid.
+
+## Functionality
+
+Given an unknown string the program should check if the provided string is a valid ISBN-10.
+Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
+
+The program should allow for ISBN-10 without the separating dashes to be verified as well.
+
+## ISBN
+
+Let's take a random ISBN-10 number, say `3-598-21508-8` for this.
+The first digit block indicates the group where the ISBN belongs. Groups can consist of shared languages, geographic regions or countries. The leading '3' signals this ISBN is from a german speaking country.
+The following number block is to identify the publisher. Since this is a three digit publisher number there is a 5 digit title number for this book.
+The last digit in the ISBN is the check digit which is used to detect read errors.
+
+The first 9 digits in the ISBN have to be between 0 and 9.
+The check digit can additionally be an 'X' to allow 10 to be a valid check digit as well.
+
+A valid ISBN-10 is calculated with this formula `(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0`
+So for our example ISBN this means:
+(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 = 0
+
+Which proves that the ISBN is valid.
+
+## Caveats
+
+Converting from string to number can be tricky in certain languages.
+It's getting even trickier since the check-digit of an ISBN-10 can be 'X'.
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/fsharp/generators/Generators.fs

@@ -318,6 +318,9 @@ type House() =
         |> Seq.map formatValue
         |> formatMultiLineList
 
+type IsbnVerifier() =
+    inherit Exercise()
+
 type Isogram() =
     inherit Exercise()
 

data/tracks/go/exercises/sieve/.meta/gen.go

@@ -0,0 +1,46 @@
+package main
+
+import (
+	"log"
+	"text/template"
+
+	"../../../gen"
+)
+
+func main() {
+	t, err := template.New("").Parse(tmpl)
+	if err != nil {
+		log.Fatal(err)
+	}
+	var j js
+	if err := gen.Gen("sieve", &j, t); err != nil {
+		log.Fatal(err)
+	}
+}
+
+// The JSON structure we expect to be able to unmarshal into
+type js struct {
+	Cases []struct {
+		Description string
+		Limit       int
+		Expected    []int
+	}
+}
+
+// template applied to above data structure generates the Go test cases
+var tmpl = `package sieve
+
+{{.Header}}
+
+var testCases = []struct {
+	description string
+	limit int
+	expected []int
+}{
+{{range .J.Cases}}{
+	"{{.Description}}",
+	{{.Limit}},
+	{{printf "%#v" .Expected}},
+},
+{{end}}}
+`

data/tracks/go/exercises/sieve/cases_test.go

@@ -0,0 +1,37 @@
+package sieve
+
+// Source: exercism/problem-specifications
+// Commit: f2b2693 sieve: Fix canonical-data.json formatting
+// Problem Specifications Version: 1.0.0
+
+var testCases = []struct {
+	description string
+	limit       int
+	expected    []int
+}{
+	{
+		"no primes under two",
+		1,
+		[]int{},
+	},
+	{
+		"find first prime",
+		2,
+		[]int{2},
+	},
+	{
+		"find primes up to 10",
+		10,
+		[]int{2, 3, 5, 7},
+	},
+	{
+		"limit is prime",
+		13,
+		[]int{2, 3, 5, 7, 11, 13},
+	},
+	{
+		"find primes up to 1000",
+		1000,
+		[]int{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997},
+	},
+}

data/tracks/go/exercises/sieve/example.go

@@ -1,15 +1,15 @@
 package sieve
 
 func Sieve(limit int) (primes []int) {
-	c := make([]bool, limit)
-	for p := 2; p < limit; {
-		for i := p + p; i < limit; i += p {
+	c := make([]bool, limit+1)
+	for p := 2; p <= limit; {
+		for i := p + p; i <= limit; i += p {
 			c[i] = true
 		}
-		for p++; p < limit && c[p]; p++ {
+		for p++; p <= limit && c[p]; p++ {
 		}
 	}
-	for i := 2; i < limit; i++ {
+	for i := 2; i <= limit; i++ {
 		if !c[i] {
 			primes = append(primes, i)
 		}

data/tracks/go/exercises/sieve/sieve_test.go

@@ -5,32 +5,23 @@ import (
 	"testing"
 )
 
-var p10 = []int{2, 3, 5, 7}
-var p1000 = []int{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,
-	59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137,
-	139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223,
-	227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,
-	311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397,
-	401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487,
-	491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593,
-	599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677,
-	683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787,
-	797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883,
-	887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997}
-
 func TestSieve(t *testing.T) {
-	p := Sieve(10)
-	if !reflect.DeepEqual(p, p10) {
-		t.Fatalf("Sieve(10) = %v, want %v", p, p10)
-	}
-	p = Sieve(1000)
-	if !reflect.DeepEqual(p, p1000) {
-		t.Fatalf("Sieve(1000) = %v, want %v", p, p1000)
+	for _, tc := range testCases {
+		p := Sieve(tc.limit)
+		if len(p) != 0 || len(tc.expected) != 0 {
+			if !reflect.DeepEqual(p, tc.expected) {
+				t.Fatalf("FAIL: %s\nSieve(%d)\nExpected %v\nActual  %v",
+					tc.description, tc.limit, tc.expected, p)
+			}
+		}
+		t.Logf("PASS: %s", tc.description)
 	}
 }
 
 func BenchmarkSieve(b *testing.B) {
 	for i := 0; i < b.N; i++ {
-		Sieve(1000)
+		for _, tc := range testCases {
+			Sieve(tc.limit)
+		}
 	}
 }

data/tracks/java/exercises/anagram/src/test/java/AnagramTest.java

@@ -2,6 +2,7 @@ import org.junit.Ignore;
 import org.junit.Test;
 
 import java.util.Arrays;
+import java.util.Collections;
 import java.util.List;
 
 import static org.hamcrest.CoreMatchers.*;
@@ -53,7 +54,7 @@ public class AnagramTest {
     @Test
     public void testDoesNotConfuseDifferentDuplicates() {
         Anagram detector = new Anagram("galea");
-        assertTrue(detector.match(Arrays.asList("eagle")).isEmpty());
+        assertTrue(detector.match(Collections.singletonList("eagle")).isEmpty());
     }
 
     @Ignore("Remove to run test")
@@ -69,21 +70,21 @@ public class AnagramTest {
     @Test
     public void testIdenticalWordRepeatedIsNotAnagram() {
         Anagram detector = new Anagram("go");
-        assertTrue(detector.match(Arrays.asList("go Go GO")).isEmpty());
+        assertTrue(detector.match(Collections.singletonList("go Go GO")).isEmpty());
     }
 
     @Ignore("Remove to run test")
     @Test
     public void testCapitalWordIsNotOwnAnagram() {
         Anagram detector = new Anagram("BANANA");
-        assertTrue(detector.match(Arrays.asList("Banana")).isEmpty());
+        assertTrue(detector.match(Collections.singletonList("Banana")).isEmpty());
     }
 
     @Ignore("Remove to run test")
     @Test
     public void testEliminateAnagramsWithSameChecksum() {
         Anagram detector = new Anagram("mass");
-        assertTrue(detector.match(Arrays.asList("last")).isEmpty());
+        assertTrue(detector.match(Collections.singletonList("last")).isEmpty());
     }
 
     @Ignore("Remove to run test")
@@ -121,13 +122,13 @@ public class AnagramTest {
     @Test
     public void testWordIsNotItsOwnAnagram() {
         Anagram detector = new Anagram("banana");
-        assertTrue(detector.match(Arrays.asList("Banana")).isEmpty());
+        assertTrue(detector.match(Collections.singletonList("Banana")).isEmpty());
     }
 
     @Ignore("Remove to run test")
     @Test
     public void testAnagramMustUseAllLettersExactlyOnce() {
         Anagram detector = new Anagram("tapper");
-        assertTrue(detector.match(Arrays.asList("patter")).isEmpty());
+        assertTrue(detector.match(Collections.singletonList("patter")).isEmpty());
     }
 }

data/tracks/objective-c/config.json

@@ -413,6 +413,19 @@
       "unlocked_by": null,
       "uuid": "f00fe4b4-7caf-4fe0-b8e6-c1684f71c5f6"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "say",
+      "topics": [
+        "loops",
+        "parsing",
+        "transforming",
+        "text_formatting"
+      ],
+      "unlocked_by": null,
+      "uuid": "9292d37e-2b5f-45a2-b995-ebcce9d90376"
+    },
     {
       "core": false,
       "difficulty": 5,

data/tracks/objective-c/exercises/say/SayExample.h

@@ -0,0 +1,7 @@
+#import <Foundation/Foundation.h>
+
+@interface Say : NSObject
+
++ (NSString *)say:(long)number;
+
+@end

data/tracks/objective-c/exercises/say/SayExample.m

@@ -0,0 +1,55 @@
+#import "SayExample.h"
+
+@implementation Say
+
++ (NSString *)say:(long)number {
+    NSArray<NSString *> *smallNumbers = @[
+                                          @"zero", @"one", @"two", @"three", @"four", @"five",
+                                          @"six", @"seven", @"eight", @"nine", @"ten",
+                                          @"eleven", @"twelve", @"thirteen", @"fourteen", @"fifteen",
+                                          @"sixteen", @"seventeen", @"eighteen", @"nineteen"
+                                          ];
+    
+    NSArray<NSString *> *decades = @[
+                                     @"twenty", @"thirty", @"forty", @"fifty",
+                                     @"sixty", @"seventy", @"eighty", @"ninety"
+                                     ];
+    
+    NSArray<NSString *> *largeGroupNames = @[@"billion", @"million", @"thousand", @"hundred"];
+    
+    NSArray<NSNumber *> *largeGroupAmounts = @[@1000000000, @1000000, @1000, @100];
+    
+    if (number < 0 || number >= 1000000000000) {
+        return NULL;
+    }
+
+    if (number < 20) {
+        return smallNumbers[number];
+    }
+    
+    for (int i = 0; i < largeGroupAmounts.count; i++) {
+        int amount = largeGroupAmounts[i].intValue;
+        
+        if (number >= amount) {
+            NSString *groupName = largeGroupNames[i];
+            NSString *result = [[Say say:(number / amount)] stringByAppendingString:[NSString stringWithFormat:@" %@", groupName]];
+            long remainder = number % amount;
+            
+            if (remainder == 0) {
+                return result;
+            }
+            return [result stringByAppendingString:[NSString stringWithFormat:@" %@", [Say say:remainder]]];
+        }
+    }
+    
+    long decade = number / 10;
+    int remainder = number % 10;
+    NSString *decadeName = decades[decade - 2];
+    
+    if (remainder == 0) {
+        return decadeName;
+    }
+    return [decadeName stringByAppendingString:[NSString stringWithFormat:@"-%@", [Say say:remainder]]];
+}
+
+@end

data/tracks/objective-c/exercises/say/SayTest.m

@@ -0,0 +1,75 @@
+#import <XCTest/XCTest.h>
+
+#if __has_include("SayExample.h")
+# import "SayExample.h"
+#else
+# import "Say.h"
+#endif
+
+@interface SayTest : XCTestCase
+
+@end
+
+@implementation SayTest
+
+- (void)testZero {
+    XCTAssertEqualObjects(@"zero", [Say say:0]);
+}
+
+- (void)testOne {
+    XCTAssertEqualObjects(@"one", [Say say:1]);
+}
+
+- (void)testFourteen {
+    XCTAssertEqualObjects(@"fourteen", [Say say:14]);
+}
+
+- (void)testTwenty {
+    XCTAssertEqualObjects(@"twenty", [Say say:20]);
+}
+
+- (void)testTwentyTwo {
+    XCTAssertEqualObjects(@"twenty-two", [Say say:22]);
+}
+
+- (void)testOneHundred {
+    XCTAssertEqualObjects(@"one hundred", [Say say:100]);
+}
+
+- (void)testOneHundredTwentyThree {
+    XCTAssertEqualObjects(@"one hundred twenty-three", [Say say:123]);
+}
+
+- (void)testOneThousand {
+    XCTAssertEqualObjects(@"one thousand", [Say say:1000]);
+}
+
+- (void)testOneThousandTwoHundredThirtyFour {
+    XCTAssertEqualObjects(@"one thousand two hundred thirty-four", [Say say:1234]);
+}
+
+- (void)testOneMillion {
+    XCTAssertEqualObjects(@"one million", [Say say:1000000]);
+}
+
+- (void)testOneMillionTwoThousandThreeHundredFortyFive {
+    XCTAssertEqualObjects(@"one million two thousand three hundred forty-five", [Say say:1002345]);
+}
+
+- (void)testOneBillion {
+    XCTAssertEqualObjects(@"one billion", [Say say:1000000000]);
+}
+
+- (void)testABigNumber {
+    XCTAssertEqualObjects(@"nine hundred eighty-seven billion six hundred fifty-four million three hundred twenty-one thousand one hundred twenty-three", [Say say:987654321123]);
+}
+
+- (void)testNumbersBelowZeroAreOutOfRange {
+    XCTAssertNil([Say say:-1]);
+}
+
+- (void)testNumbersAbove999999999999AreOutOfRange {
+    XCTAssertNil([Say say:1000000000000]);
+}
+
+@end

data/tracks/objective-c/xcodeProject/ObjectiveC.xcodeproj/project.pbxproj

@@ -79,6 +79,8 @@
 		E951B6B91D429550009EB5B6 /* AllergiesTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E951B6B81D429550009EB5B6 /* AllergiesTest.m */; };
 		E95C52551E81C82A0095D321 /* BinarySearchExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E95C52531E81C82A0095D321 /* BinarySearchExample.m */; };
 		E95C52561E81C82A0095D321 /* BinarySearchTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E95C52541E81C82A0095D321 /* BinarySearchTest.m */; };
+		E964F68F1FBF9CA6000114D9 /* SayExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E964F68E1FBF9CA6000114D9 /* SayExample.m */; };
+		E964F6911FBF9CC6000114D9 /* SayTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E964F6901FBF9CC6000114D9 /* SayTest.m */; };
 		E96993981DF60E1E009EA223 /* TransposeExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E96993971DF60E1E009EA223 /* TransposeExample.m */; };
 		E969939A1DF60E5F009EA223 /* TransposeTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E96993991DF60E5F009EA223 /* TransposeTest.m */; };
 		E973200C1E9DA0A900ABEE5C /* SieveExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E973200B1E9DA0A900ABEE5C /* SieveExample.m */; };
@@ -197,6 +199,9 @@
 		E95C52521E81C82A0095D321 /* BinarySearchExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BinarySearchExample.h; path = "../../exercises/binary-search/BinarySearchExample.h"; sourceTree = "<group>"; };
 		E95C52531E81C82A0095D321 /* BinarySearchExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BinarySearchExample.m; path = "../../exercises/binary-search/BinarySearchExample.m"; sourceTree = "<group>"; };
 		E95C52541E81C82A0095D321 /* BinarySearchTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BinarySearchTest.m; path = "../../exercises/binary-search/BinarySearchTest.m"; sourceTree = "<group>"; };
+		E964F68D1FBF9CA6000114D9 /* SayExample.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; name = SayExample.h; path = ../../exercises/say/SayExample.h; sourceTree = "<group>"; };
+		E964F68E1FBF9CA6000114D9 /* SayExample.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; name = SayExample.m; path = ../../exercises/say/SayExample.m; sourceTree = "<group>"; };
+		E964F6901FBF9CC6000114D9 /* SayTest.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; name = SayTest.m; path = ../../exercises/say/SayTest.m; sourceTree = "<group>"; };
 		E96993961DF60E1E009EA223 /* TransposeExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = TransposeExample.h; path = ../../exercises/transpose/TransposeExample.h; sourceTree = "<group>"; };
 		E96993971DF60E1E009EA223 /* TransposeExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = TransposeExample.m; path = ../../exercises/transpose/TransposeExample.m; sourceTree = "<group>"; };
 		E96993991DF60E5F009EA223 /* TransposeTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = TransposeTest.m; path = ../../exercises/transpose/TransposeTest.m; sourceTree = "<group>"; };
@@ -285,6 +290,7 @@
 				E9E8B6F51D519E2E0012F12C /* RobotName */,
 				E9FDCA161D540793004EE8DB /* RomanNumerals */,
 				E9C1C02C1D9EC0E50015E86E /* RunLengthEncoding */,
+				E964F68C1FBF9B6B000114D9 /* Say */,
 				E907FE8F1D87545300B93DA9 /* ScrabbleScore */,
 				E9C1C0201D9D98B80015E86E /* SecretHandshake */,
 				E97320091E9DA06500ABEE5C /* Sieve */,
@@ -456,6 +462,16 @@
 			name = BinarySearch;
 			sourceTree = "<group>";
 		};
+		E964F68C1FBF9B6B000114D9 /* Say */ = {
+			isa = PBXGroup;
+			children = (
+				E964F68D1FBF9CA6000114D9 /* SayExample.h */,
+				E964F68E1FBF9CA6000114D9 /* SayExample.m */,
+				E964F6901FBF9CC6000114D9 /* SayTest.m */,
+			);
+			name = Say;
+			sourceTree = "<group>";
+		};
 		E96993951DF60DF1009EA223 /* Transpose */ = {
 			isa = PBXGroup;
 			children = (
@@ -873,6 +889,7 @@
 				1EFACABA1CCCAF3D006F2E69 /* SpaceAgeTest.m in Sources */,
 				1EFACAB91CCCAF3D006F2E69 /* SpaceAgeExample.m in Sources */,
 				E9F390091DFCA350005C5F46 /* IsogramTest.m in Sources */,
+				E964F6911FBF9CC6000114D9 /* SayTest.m in Sources */,
 				E951B6B71D4294E6009EB5B6 /* AllergiesExample.m in Sources */,
 				E9FDCA1B1D540801004EE8DB /* RomanNumeralsTest.m in Sources */,
 				E9C1C0231D9D993E0015E86E /* SecretHandshakeExample.m in Sources */,
@@ -895,6 +912,7 @@
 				E9386EEE1E0B692D0009A414 /* AtbashCipherExample.m in Sources */,
 				1EFACAA61CCCAF3D006F2E69 /* BobTest.m in Sources */,
 				E9B345FA1DB93839006EFBE2 /* PangramTest.m in Sources */,
+				E964F68F1FBF9CA6000114D9 /* SayExample.m in Sources */,
 				E9895B701E8DA914006AD25D /* CryptoSquareTest.m in Sources */,
 				E9B9F2D41E9EB39C00214076 /* LuhnExample.m in Sources */,
 				E9A7B2F91DA5AC55009056B6 /* LargestSeriesProductTest.m in Sources */,

data/tracks/ocaml/exercises/grade-school/README.md

@@ -5,6 +5,7 @@ for the school.
 
 In the end, you should be able to:
 
+- Start with an empty school.
 - Add a student's name to the roster for a grade
   - "Add Jim to grade 2."
   - "OK."
@@ -22,20 +23,6 @@ Note that all our students only have one name.  (It's a small town, what
 do you want?)
 
 
-## For bonus points
-
-Did you get the tests passing and the code clean? If you want to, these
-are some additional things you could try:
-
-- If you're working in a language with mutable data structures and your
-  implementation allows outside code to mutate the school's internal DB
-  directly, see if you can prevent this. Feel free to introduce additional
-  tests.
-
-Then please share your thoughts in a comment on the submission. Did this
-experiment make the code better? Worse? Did you learn anything from it?
-
-
 ## Getting Started
 For installation and learning resources, refer to the
 [exercism help page](http://exercism.io/languages/ocaml).

data/tracks/ocaml/exercises/grade-school/example.ml

@@ -2,7 +2,7 @@ open Core
 
 type school = string list Int.Map.t
 
-let create _ = Int.Map.empty
+let empty_school = Int.Map.empty
 
 let add s g school = Map.add_multi ~key:g ~data:s school
 

data/tracks/ocaml/exercises/grade-school/grade_school.mli

@@ -3,8 +3,7 @@ open Core
 
 type school
 
-(** Create a new empty school *)
-val create : unit -> school
+val empty_school :  school
 
 (** Add a student to a school *)
 val add : string -> int -> school -> school

data/tracks/ocaml/exercises/grade-school/test.ml

@@ -3,14 +3,12 @@ open OUnit2
 
 module IMap = Int.Map
 
-(* Assert list equals *)
-let ale exp got = 
+let assert_list_equals exp got = 
   let printer l = List.sexp_of_t String.sexp_of_t l
                   |> Sexp.to_string_hum ~indent:1 in
   assert_equal exp got ~printer
 
-(* Assert map equals *)
-let ame exp got =
+let assert_map_equals exp got =
   let printer m = 
       Map.to_alist m
       |> List.sort ~cmp:compare
@@ -18,52 +16,44 @@ let ame exp got =
       |> Sexp.to_string_hum ~indent:1 in
   assert_equal exp got ~cmp:(Map.equal (=)) ~printer
 
-(* The tests never reuse a school value, so if you like you can use destructive
- * modification (i.e. mutable data structures). For the same reason
- * Grade_school.create takes a unit argument.
- *
- * For those who wonder why the test doesn't use objects, it's to not force
- * the use of objects. You can still use them internally though. 
- *)
-
 let tests =
   ["add student">:: (fun _ ->
-       let got = Grade_school.create ()
+       let got = Grade_school.empty_school
                  |> Grade_school.add "Aimee" 2 in
-       ame (IMap.of_alist_exn [(2, ["Aimee"])])
+       assert_map_equals (IMap.of_alist_exn [(2, ["Aimee"])])
            (Grade_school.to_map got));
-   "add more students in same class">:: (fun _ ->
-       let got = Grade_school.create ()
-                 |> Grade_school.add "James" 2
+   "add more students in sassert_map_equals class">:: (fun _ ->
+       let got = Grade_school.empty_school
+                 |> Grade_school.add "Jassert_map_equalss" 2
                  |> Grade_school.add "Blair" 2
                  |> Grade_school.add "Paul" 2 in
-       ame (IMap.of_alist_exn [(2, ["Blair"; "James"; "Paul"])])
+       assert_map_equals (IMap.of_alist_exn [(2, ["Blair"; "Jassert_map_equalss"; "Paul"])])
            (Grade_school.to_map got |> Map.map ~f:(List.sort ~cmp:compare)));
    "add students to different grades">:: (fun _ ->
-       let got = Grade_school.create ()
+       let got = Grade_school.empty_school
                  |> Grade_school.add "Chelsea" 3
                  |> Grade_school.add "Logan" 7 in
-       ame (IMap.of_alist_exn [(3, ["Chelsea"]); (7, ["Logan"])])
+       assert_map_equals (IMap.of_alist_exn [(3, ["Chelsea"]); (7, ["Logan"])])
            (Grade_school.to_map got |> Map.map ~f:(List.sort ~cmp:compare)));
    "get students in a grade">:: (fun _ ->
-       let got = Grade_school.create ()
+       let got = Grade_school.empty_school
                  |> Grade_school.add "Franklin" 5
                  |> Grade_school.add "Bradley" 5
                  |> Grade_school.add "Jeff" 1
                  |> Grade_school.grade 5 in
-       ale ["Bradley"; "Franklin"]
+       assert_list_equals ["Bradley"; "Franklin"]
            (List.sort ~cmp:compare got));
    "get students in a non existant grade">:: (fun _ ->
-       ale [] (List.sort ~cmp:compare (Grade_school.create () |> Grade_school.grade 2)));
+       assert_list_equals [] (List.sort ~cmp:compare (Grade_school.empty_school |> Grade_school.grade 2)));
    "sort school">:: (fun _ ->
-       let got = Grade_school.create ()
+       let got = Grade_school.empty_school
                  |> Grade_school.add "Christopher" 4
                  |> Grade_school.add "Jennifer" 4
                  |> Grade_school.add "Aaron" 4
                  |> Grade_school.add "Kareem" 6
                  |> Grade_school.add "Kyle" 3
                  |> Grade_school.sort in
-       ame (IMap.of_alist_exn [(3, ["Kyle"]);
+       assert_map_equals (IMap.of_alist_exn [(3, ["Kyle"]);
                                (4, ["Aaron"; "Christopher"; "Jennifer"]);
                                (6, ["Kareem"])])
            (Grade_school.to_map got));

data/tracks/swift/config.json

@@ -572,6 +572,19 @@
       "unlocked_by": null,
       "uuid": "f6b157cb-ddb0-4c40-baa3-9fc6b58de7ff"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "say",
+      "topics": [
+        "loops",
+        "parsing",
+        "transforming",
+        "text_formatting"
+      ],
+      "unlocked_by": null,
+      "uuid": "0f840c37-a8c0-42da-93f9-d215cb044d53"
+    },
     {
       "core": false,
       "difficulty": 5,

data/tracks/swift/exercises/say/Package.swift

@@ -0,0 +1,5 @@
+import PackageDescription
+
+let package = Package(
+    name: "Say"
+)

data/tracks/swift/exercises/say/README.md

@@ -0,0 +1,77 @@
+# Say
+
+Given a number from 0 to 999,999,999,999, spell out that number in English.
+
+## Step 1
+
+Handle the basic case of 0 through 99.
+
+If the input to the program is `22`, then the output should be
+`'twenty-two'`.
+
+Your program should complain loudly if given a number outside the
+blessed range.
+
+Some good test cases for this program are:
+
+- 0
+- 14
+- 50
+- 98
+- -1
+- 100
+
+### Extension
+
+If you're on a Mac, shell out to Mac OS X's `say` program to talk out
+loud.
+
+## Step 2
+
+Implement breaking a number up into chunks of thousands.
+
+So `1234567890` should yield a list like 1, 234, 567, and 890, while the
+far simpler `1000` should yield just 1 and 0.
+
+The program must also report any values that are out of range.
+
+## Step 3
+
+Now handle inserting the appropriate scale word between those chunks.
+
+So `1234567890` should yield `'1 billion 234 million 567 thousand 890'`
+
+The program must also report any values that are out of range.  It's
+fine to stop at "trillion".
+
+## Step 4
+
+Put it all together to get nothing but plain English.
+
+`12345` should give `twelve thousand three hundred forty-five`.
+
+The program must also report any values that are out of range.
+
+### Extensions
+
+Use _and_ (correctly) when spelling out the number in English:
+
+- 14 becomes "fourteen".
+- 100 becomes "one hundred".
+- 120 becomes "one hundred and twenty".
+- 1002 becomes "one thousand and two".
+- 1323 becomes "one thousand three hundred and twenty-three".
+
+## Setup
+
+Go through the project setup instructions for Xcode using Swift:
+
+http://exercism.io/languages/swift
+
+## Source
+
+A variation on JavaRanch CattleDrive, exercise 4a [http://www.javaranch.com/say.jsp](http://www.javaranch.com/say.jsp)
+
+## Submitting Incomplete Solutions
+
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/swift/exercises/say/Sources/Say.swift

@@ -0,0 +1 @@
+//Solution goes in Sources

data/tracks/swift/exercises/say/Sources/SayExample.swift

@@ -0,0 +1,48 @@
+struct Say {
+
+    private static let smallNumbers = [
+        "zero", "one", "two", "three", "four", "five",
+        "six", "seven", "eight", "nine", "ten",
+        "eleven", "twelve", "thirteen", "fourteen", "fifteen",
+        "sixteen", "seventeen", "eighteen", "nineteen"
+    ]
+
+    private static let decades = [
+        "twenty", "thirty", "forty", "fifty",
+        "sixty", "seventy", "eighty", "ninety"
+    ]
+
+    private static let largeGroups: [(name: String, amount: Int)] = [
+        ("billion", 1_000_000_000), ("million", 1_000_000), ("thousand", 1_000), ("hundred", 100)
+    ]
+
+    static func say(_ number: Int) -> String? {
+        guard number >= 0 && number < 1_000_000_000_000 else {
+            return nil
+        }
+
+        if number < 20 {
+            return smallNumbers[number]
+        }
+
+        for group in largeGroups where number >= group.amount {
+            let result = "\(say(number / group.amount)!) " + group.name
+            let remainder = number % group.amount
+
+            if remainder == 0 {
+                return result
+            } else {
+                return result + " \(say(remainder)!)"
+            }
+        }
+
+        let decade = number / 10
+        let decadeName = decades[decade - 2]
+
+        if number % 10 == 0 {
+            return decadeName
+        } else {
+            return decadeName + "-" + say(number % 10)!
+        }
+    }
+}

data/tracks/swift/exercises/say/Tests/LinuxMain.swift

@@ -0,0 +1,6 @@
+import XCTest
+@testable import SayTests
+
+XCTMain([
+    testCase(SayTests.allTests),
+])

data/tracks/swift/exercises/say/Tests/SayTests/SayTests.swift

@@ -0,0 +1,85 @@
+import XCTest
+@testable import Say
+
+class SayTests: XCTestCase {
+
+    func testZero() {
+        XCTAssertEqual("zero", Say.say(0))
+    }
+
+    func testOne() {
+        XCTAssertEqual("one", Say.say(1))
+    }
+
+    func testFourteen() {
+        XCTAssertEqual("fourteen", Say.say(14))
+    }
+
+    func testTwenty() {
+        XCTAssertEqual("twenty", Say.say(20))
+    }
+
+    func testTwentyTwo() {
+        XCTAssertEqual("twenty-two", Say.say(22))
+    }
+
+    func testOneHundred() {
+        XCTAssertEqual("one hundred", Say.say(100))
+    }
+
+    func testOneHundredTwentyThree() {
+        XCTAssertEqual("one hundred twenty-three", Say.say(123))
+    }
+
+    func testOneThousand() {
+        XCTAssertEqual("one thousand", Say.say(1_000))
+    }
+
+    func testOneThousandTwoHundredThirtyFour() {
+        XCTAssertEqual("one thousand two hundred thirty-four", Say.say(1_234))
+    }
+
+    func testOneMillion() {
+        XCTAssertEqual("one million", Say.say(1_000_000))
+    }
+
+    func testOneMillionTwoThousandThreeHundredFortyFive() {
+        XCTAssertEqual("one million two thousand three hundred forty-five", Say.say(1_002_345))
+    }
+
+    func testOneBillion() {
+        XCTAssertEqual("one billion", Say.say(1_000_000_000))
+    }
+
+    func testABigNumber() {
+        XCTAssertEqual("nine hundred eighty-seven billion six hundred fifty-four million three hundred twenty-one thousand one hundred twenty-three", Say.say(987_654_321_123))
+    }
+
+    func testNumbersBelowZeroAreOutOfRange() {
+        XCTAssertNil(Say.say(-1))
+    }
+
+    func testNumbersAbove999999999999AreOutOfRange() {
+        XCTAssertNil(Say.say(1_000_000_000_000))
+    }
+
+    static var allTests: [(String, (SayTests) -> () throws -> Void)] {
+        return [
+            ("testZero", testZero),
+            ("testOne", testOne),
+            ("testFourteen", testFourteen),
+            ("testTwenty", testTwenty),
+            ("testTwentyTwo", testTwentyTwo),
+            ("testOneHundred", testOneHundred),
+            ("testOneHundredTwentyThree", testOneHundredTwentyThree),
+            ("testOneThousand", testOneThousand),
+            ("testOneThousandTwoHundredThirtyFour", testOneThousandTwoHundredThirtyFour),
+            ("testOneMillion", testOneMillion),
+            ("testOneMillionTwoThousandThreeHundredFortyFive", testOneMillionTwoThousandThreeHundredFortyFive),
+            ("testOneBillion", testOneBillion),
+            ("testABigNumber", testABigNumber),
+            ("testNumbersBelowZeroAreOutOfRange", testNumbersBelowZeroAreOutOfRange),
+            ("testNumbersAbove999999999999AreOutOfRange", testNumbersAbove999999999999AreOutOfRange),
+        ]
+    }
+}

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.67
+  version: 2.2.1.68
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-11-17 00:00:00.000000000 Z
+date: 2017-11-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -5145,6 +5145,12 @@ files:
 - tracks/fsharp/exercises/house/HouseTest.fs
 - tracks/fsharp/exercises/house/Program.fs
 - tracks/fsharp/exercises/house/README.md
+- tracks/fsharp/exercises/isbn-verifier/Example.fs
+- tracks/fsharp/exercises/isbn-verifier/IsbnVerifier.fs
+- tracks/fsharp/exercises/isbn-verifier/IsbnVerifier.fsproj
+- tracks/fsharp/exercises/isbn-verifier/IsbnVerifierTest.fs
+- tracks/fsharp/exercises/isbn-verifier/Program.fs
+- tracks/fsharp/exercises/isbn-verifier/README.md
 - tracks/fsharp/exercises/isogram/Example.fs
 - tracks/fsharp/exercises/isogram/Isogram.fs
 - tracks/fsharp/exercises/isogram/Isogram.fsproj
@@ -5995,7 +6001,9 @@ files:
 - tracks/go/exercises/series/first_example.go
 - tracks/go/exercises/series/first_test.go
 - tracks/go/exercises/series/series_test.go
+- tracks/go/exercises/sieve/.meta/gen.go
 - tracks/go/exercises/sieve/README.md
+- tracks/go/exercises/sieve/cases_test.go
 - tracks/go/exercises/sieve/example.go
 - tracks/go/exercises/sieve/sieve_test.go
 - tracks/go/exercises/simple-cipher/.meta/description.md
@@ -9178,6 +9186,9 @@ files:
 - tracks/objective-c/exercises/run-length-encoding/RunLengthEncodingExample.h
 - tracks/objective-c/exercises/run-length-encoding/RunLengthEncodingExample.m
 - tracks/objective-c/exercises/run-length-encoding/RunLengthEncodingTest.m
+- tracks/objective-c/exercises/say/SayExample.h
+- tracks/objective-c/exercises/say/SayExample.m
+- tracks/objective-c/exercises/say/SayTest.m
 - tracks/objective-c/exercises/scrabble-score/README.md
 - tracks/objective-c/exercises/scrabble-score/ScrabbleScoreExample.h
 - tracks/objective-c/exercises/scrabble-score/ScrabbleScoreExample.m
@@ -13511,6 +13522,12 @@ files:
 - tracks/swift/exercises/saddle-points/Sources/SaddlePointsExample.swift
 - tracks/swift/exercises/saddle-points/Tests/LinuxMain.swift
 - tracks/swift/exercises/saddle-points/Tests/SaddlePointsTests/SaddlePointsTests.swift
+- tracks/swift/exercises/say/Package.swift
+- tracks/swift/exercises/say/README.md
+- tracks/swift/exercises/say/Sources/Say.swift
+- tracks/swift/exercises/say/Sources/SayExample.swift
+- tracks/swift/exercises/say/Tests/LinuxMain.swift
+- tracks/swift/exercises/say/Tests/SayTests/SayTests.swift
 - tracks/swift/exercises/scrabble-score/.gitignore
 - tracks/swift/exercises/scrabble-score/Package.swift
 - tracks/swift/exercises/scrabble-score/README.md