trackler 2.2.1.97 → 2.2.1.98

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a879165bbaf3374166c71dc34a41c6aec1bb4810
-  data.tar.gz: c2523fd9d3a926cc23467b989899bdf68f0fa565
+  metadata.gz: 61557d8c8f53297686afbfb79d34fd4bb855673b
+  data.tar.gz: 0e787d40634a430d4019195d58f4fdff356f82ae
 SHA512:
-  metadata.gz: 1cc0663e27885b9b49fe12f96d9157edd8e461124f5dec5d6e6cd80e479086938f1064cd8bc14eaba7e81b52d491f1e2332c3d754f8c81b31063939d2a541d3d
-  data.tar.gz: a0dac94954516db51e090848ee10285b9303d1e5b6f0fb3ad23a1a4e465c50cadab72b7d98503922a9c8e1c5a2cf768ed6411e69513a1c34fb0b16f52621d5b8
+  metadata.gz: bfd3d1d4c263d6dc3bc615d67eb273808855a2c2bfee91201963dcc168350f1b30c8fe8efe04a145d20900976a824d52a6e6540f686c42c1a81cdbf5c3108a54
+  data.tar.gz: a203c0f9128acfb983935569b854b134213a3da2aa254fc3a6e94565c2b3b22df296fc3027783cce311c64c22eb9415cb926c8c1e402db33f6cdcef96c52263f

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.97"
+  VERSION = "2.2.1.98"
 end

data/problem-specifications/exercises/custom-set/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "custom-set",
-  "version": "1.1.0",
+  "version": "1.2.0",
   "comments": [
     "These tests cover the core components of a set data structure: checking",
     "presence, adding, comparing and basic set operations. Other features",
@@ -18,13 +18,17 @@
         {
           "description": "sets with no elements are empty",
           "property": "empty",
-          "set": [],
+          "input": {
+            "set": []
+          },
           "expected": true
         },
         {
           "description": "sets with elements are not empty",
           "property": "empty",
-          "set": [1],
+          "input": {
+            "set": [1]
+          },
           "expected": false
         }
       ]
@@ -35,22 +39,28 @@
         {
           "description": "nothing is contained in an empty set",
           "property": "contains",
-          "set": [],
-          "element": 1,
+          "input": {
+            "set": [],
+            "element": 1
+          },
           "expected": false
         },
         {
           "description": "when the element is in the set",
           "property": "contains",
-          "set": [1, 2, 3],
-          "element": 1,
+          "input": {
+            "set": [1, 2, 3],
+            "element": 1
+          },
           "expected": true
         },
         {
           "description": "when the element is not in the set",
           "property": "contains",
-          "set": [1, 2, 3],
-          "element": 4,
+          "input": {
+            "set": [1, 2, 3],
+            "element": 4
+          },
           "expected": false
         }
       ]
@@ -61,43 +71,55 @@
         {
           "description": "empty set is a subset of another empty set",
           "property": "subset",
-          "set1": [],
-          "set2": [],
+          "input": {
+            "set1": [],
+            "set2": []
+          },
           "expected": true
         },
         {
           "description": "empty set is a subset of non-empty set",
           "property": "subset",
-          "set1": [],
-          "set2": [1],
+          "input": {
+            "set1": [],
+            "set2": [1]
+          },
           "expected": true
         },
         {
           "description": "non-empty set is not a subset of empty set",
           "property": "subset",
-          "set1": [1],
-          "set2": [],
+          "input": {
+            "set1": [1],
+            "set2": []
+          },
           "expected": false
         },
         {
           "description": "set is a subset of set with exact same elements",
           "property": "subset",
-          "set1": [1, 2, 3],
-          "set2": [1, 2, 3],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": [1, 2, 3]
+          },
           "expected": true
         },
         {
           "description": "set is a subset of larger set with same elements",
           "property": "subset",
-          "set1": [1, 2, 3],
-          "set2": [4, 1, 2, 3],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": [4, 1, 2, 3]
+          },
           "expected": true
         },
         {
           "description": "set is not a subset of set that does not contain its elements",
           "property": "subset",
-          "set1": [1, 2, 3],
-          "set2": [4, 1, 3],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": [4, 1, 3]
+          },
           "expected": false
         }
       ]
@@ -108,36 +130,46 @@
         {
           "description": "the empty set is disjoint with itself",
           "property": "disjoint",
-          "set1": [],
-          "set2": [],
+          "input": {
+            "set1": [],
+            "set2": []
+          },
           "expected": true
         },
         {
           "description": "empty set is disjoint with non-empty set",
           "property": "disjoint",
-          "set1": [],
-          "set2": [1],
+          "input": {
+            "set1": [],
+            "set2": [1]
+          },
           "expected": true
         },
         {
           "description": "non-empty set is disjoint with empty set",
           "property": "disjoint",
-          "set1": [1],
-          "set2": [],
+          "input": {
+            "set1": [1],
+            "set2": []
+          },
           "expected": true
         },
         {
           "description": "sets are not disjoint if they share an element",
           "property": "disjoint",
-          "set1": [1, 2],
-          "set2": [2, 3],
+          "input": {
+            "set1": [1, 2],
+            "set2": [2, 3]
+          },
           "expected": false
         },
         {
           "description": "sets are disjoint if they share no elements",
           "property": "disjoint",
-          "set1": [1, 2],
-          "set2": [3, 4],
+          "input": {
+            "set1": [1, 2],
+            "set2": [3, 4]
+          },
           "expected": true
         }
       ]
@@ -148,43 +180,55 @@
         {
           "description": "empty sets are equal",
           "property": "equal",
-          "set1": [],
-          "set2": [],
+          "input": {
+            "set1": [],
+            "set2": []
+          },
           "expected": true
         },
         {
           "description": "empty set is not equal to non-empty set",
           "property": "equal",
-          "set1": [],
-          "set2": [1, 2, 3],
+          "input": {
+            "set1": [],
+            "set2": [1, 2, 3]
+          },
           "expected": false
         },
         {
           "description": "non-empty set is not equal to empty set",
           "property": "equal",
-          "set1": [1, 2, 3],
-          "set2": [],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": []
+          },
           "expected": false
         },
         {
           "description": "sets with the same elements are equal",
           "property": "equal",
-          "set1": [1, 2],
-          "set2": [2, 1],
+          "input": {
+            "set1": [1, 2],
+            "set2": [2, 1]
+          },
           "expected": true
         },
         {
           "description": "sets with different elements are not equal",
           "property": "equal",
-          "set1": [1, 2, 3],
-          "set2": [1, 2, 4],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": [1, 2, 4]
+          },
           "expected": false
         },
         {
           "description": "set is not equal to larger set with same elements",
           "property": "equal",
-          "set1": [1, 2, 3],
-          "set2": [1, 2, 3, 4],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": [1, 2, 3, 4]
+          },
           "expected": false
         }
       ]
@@ -221,36 +265,46 @@
         {
           "description": "intersection of two empty sets is an empty set",
           "property": "intersection",
-          "set1": [],
-          "set2": [],
+          "input": {
+            "set1": [],
+            "set2": []
+          },
           "expected": []
         },
         {
           "description": "intersection of an empty set and non-empty set is an empty set",
           "property": "intersection",
-          "set1": [],
-          "set2": [3, 2, 5],
+          "input": {
+            "set1": [],
+            "set2": [3, 2, 5]
+          },
           "expected": []
         },
         {
           "description": "intersection of a non-empty set and an empty set is an empty set",
           "property": "intersection",
-          "set1": [1, 2, 3, 4],
-          "set2": [],
+          "input": {
+            "set1": [1, 2, 3, 4],
+            "set2": []
+          },
           "expected": []
         },
         {
           "description": "intersection of two sets with no shared elements is an empty set",
           "property": "intersection",
-          "set1": [1, 2, 3],
-          "set2": [4, 5, 6],
+          "input": {
+            "set1": [1, 2, 3],
+            "set2": [4, 5, 6]
+          },
           "expected": []
         },
         {
           "description": "intersection of two sets with shared elements is a set of the shared elements",
           "property": "intersection",
-          "set1": [1, 2, 3, 4],
-          "set2": [3, 2, 5],
+          "input": {
+            "set1": [1, 2, 3, 4],
+            "set2": [3, 2, 5]
+          },
           "expected": [2, 3]
         }
       ]
@@ -261,29 +315,37 @@
         {
           "description": "difference of two empty sets is an empty set",
           "property": "difference",
-          "set1": [],
-          "set2": [],
+          "input": {
+            "set1": [],
+            "set2": []
+          },
           "expected": []
         },
         {
           "description": "difference of empty set and non-empty set is an empty set",
           "property": "difference",
-          "set1": [],
-          "set2": [3, 2, 5],
+          "input": {
+            "set1": [],
+            "set2": [3, 2, 5]
+          },
           "expected": []
         },
         {
           "description": "difference of a non-empty set and an empty set is the non-empty set",
           "property": "difference",
-          "set1": [1, 2, 3, 4],
-          "set2": [],
+          "input": {
+            "set1": [1, 2, 3, 4],
+            "set2": []
+          },
           "expected": [1, 2, 3, 4]
         },
         {
           "description": "difference of two non-empty sets is a set of elements that are only in the first set",
           "property": "difference",
-          "set1": [3, 2, 1],
-          "set2": [2, 4],
+          "input": {
+            "set1": [3, 2, 1],
+            "set2": [2, 4]
+          },
           "expected": [1, 3]
         }
       ]
@@ -294,29 +356,37 @@
         {
           "description": "union of empty sets is an empty set",
           "property": "union",
-          "set1": [],
-          "set2": [],
+          "input": {
+            "set1": [],
+            "set2": []
+          },
           "expected": []
         },
         {
           "description": "union of an empty set and non-empty set is the non-empty set",
           "property": "union",
-          "set1": [],
-          "set2": [2],
+          "input": {
+            "set1": [],
+            "set2": [2]
+          },
           "expected": [2]
         },
         {
           "description": "union of a non-empty set and empty set is the non-empty set",
           "property": "union",
-          "set1": [1, 3],
-          "set2": [],
+          "input": {
+            "set1": [1, 3],
+            "set2": []
+          },
           "expected": [1, 3]
         },
         {
           "description": "union of non-empty sets contains all unique elements",
           "property": "union",
-          "set1": [1, 3],
-          "set2": [2, 3],
+          "input": {
+            "set1": [1, 3],
+            "set2": [2, 3]
+          },
           "expected": [3, 2, 1]
         }
       ]

data/tracks/go/README.md

@@ -221,7 +221,12 @@ directory within each exercise that makes use of a test cases generator. This
 Whenever the shared JSON data changes, the test cases will need to be regenerated.
 The generator will first look for a local copy of the **problem-specifications** repository.
 If there isn't one it will attempt to get the relevant json data for the
-exercise from the **problem-specifications** repository on GitHub.
+exercise from the **problem-specifications** repository on GitHub. The generator
+uses the GitHub API to find some information about exercises when it cannot
+find a local copy of **problem-specifications**. This can cause throttling
+issues if working with a large number of exercise. *We therefore recommend
+using a local copy of the repository when possible* (remember to keep it
+current :smile:).
 
 To use a local copy of the **problem-specifications** repository, make sure that it has been
 cloned into the same parent-directory as the **go** repository.

data/tracks/go/exercises/accumulate/accumulate_test.go

@@ -36,14 +36,11 @@ func TestAccumulate(t *testing.T) {
 }
 
 func BenchmarkAccumulate(b *testing.B) {
-	b.StopTimer()
-	for _, test := range tests {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, test := range tests {
 			Accumulate(test.given, test.converter)
 		}
 
-		b.StopTimer()
 	}
 }

data/tracks/go/exercises/allergies/allergies_test.go

@@ -16,14 +16,11 @@ func TestAllergies(t *testing.T) {
 }
 
 func BenchmarkAllergies(b *testing.B) {
-	b.StopTimer()
-	for _, test := range allergicToTests {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, test := range allergicToTests {
 			Allergies(test.score)
 		}
-		b.StopTimer()
 	}
 }
 
@@ -41,15 +38,12 @@ func TestAllergicTo(t *testing.T) {
 }
 
 func BenchmarkAllergicTo(b *testing.B) {
-	b.StopTimer()
-	for _, test := range allergicToTests {
-		for _, response := range test.expected {
-			b.StartTimer()
+	for i := 0; i < b.N; i++ {
+		for _, test := range allergicToTests {
 
-			for i := 0; i < b.N; i++ {
+			for _, response := range test.expected {
 				AllergicTo(test.score, response.substance)
 			}
-			b.StopTimer()
 		}
 	}
 }

data/tracks/go/exercises/anagram/anagram_test.go

@@ -35,16 +35,12 @@ func TestDetectAnagrams(t *testing.T) {
 
 func BenchmarkDetectAnagrams(b *testing.B) {
 
-	b.StopTimer()
+	for i := 0; i < b.N; i++ {
 
-	for _, tt := range testCases {
-		b.StartTimer()
-
-		for i := 0; i < b.N; i++ {
+		for _, tt := range testCases {
 			Detect(tt.subject, tt.candidates)
 		}
 
-		b.StopTimer()
 	}
 
 }

data/tracks/go/exercises/atbash-cipher/atbash_cipher_test.go

@@ -12,14 +12,11 @@ func TestAtbash(t *testing.T) {
 }
 
 func BenchmarkAtbash(b *testing.B) {
-	b.StopTimer()
-	for _, test := range tests {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, test := range tests {
 			Atbash(test.s)
 		}
 
-		b.StopTimer()
 	}
 }

data/tracks/go/exercises/beer-song/beer_test.go

@@ -110,15 +110,12 @@ func TestSeveralVerses(t *testing.T) {
 }
 
 func BenchmarkSeveralVerses(b *testing.B) {
-	b.StopTimer()
-	for _, tt := range versesTestCases {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, tt := range versesTestCases {
 			Verses(tt.upperBound, tt.lowerBound)
 		}
 
-		b.StopTimer()
 	}
 }
 

data/tracks/go/exercises/bob/bob_test.go

@@ -17,8 +17,8 @@ func TestHey(t *testing.T) {
 }
 
 func BenchmarkHey(b *testing.B) {
-	for _, tt := range testCases {
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, tt := range testCases {
 			Hey(tt.input)
 		}
 	}

data/tracks/go/exercises/bracket-push/bracket_push_test.go

@@ -20,12 +20,9 @@ func TestBracket(t *testing.T) {
 }
 
 func BenchmarkBracket(b *testing.B) {
-	b.StopTimer()
-	for _, tt := range testCases {
-		b.StartTimer()
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, tt := range testCases {
 			Bracket(tt.input)
 		}
-		b.StopTimer()
 	}
 }

data/tracks/go/exercises/change/change_test.go

@@ -32,8 +32,8 @@ func TestChange(t *testing.T) {
 }
 
 func BenchmarkChange(b *testing.B) {
-	for _, tc := range testCases {
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range testCases {
 			Change(tc.coins, tc.target)
 		}
 	}

data/tracks/go/exercises/etl/etl_test.go

@@ -77,14 +77,11 @@ func TestTransform(t *testing.T) {
 }
 
 func BenchmarkTransform(b *testing.B) {
-	b.StopTimer()
-	for _, tt := range transformTests {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, tt := range transformTests {
 			Transform(map[int][]string(tt.input))
 		}
 
-		b.StopTimer()
 	}
 }

data/tracks/go/exercises/grains/grains_test.go

@@ -34,16 +34,13 @@ func TestTotal(t *testing.T) {
 }
 
 func BenchmarkSquare(b *testing.B) {
-	b.StopTimer()
 
-	for _, test := range squareTests {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, test := range squareTests {
 			Square(test.input)
 		}
 
-		b.StopTimer()
 	}
 }
 

data/tracks/go/exercises/isogram/isogram_test.go

@@ -13,14 +13,11 @@ func TestIsIsogram(t *testing.T) {
 }
 
 func BenchmarkIsIsogram(b *testing.B) {
-	b.StopTimer()
-	for _, c := range testCases {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, c := range testCases {
 			IsIsogram(c.input)
 		}
 
-		b.StopTimer()
 	}
 }

data/tracks/go/exercises/octal/octal_test.go

@@ -37,15 +37,12 @@ func TestParseOctal(t *testing.T) {
 }
 
 func BenchmarkParseOctal(b *testing.B) {
-	b.StopTimer()
 
-	for _, test := range testCases {
-		b.StartTimer()
+	for i := 0; i < b.N; i++ {
 
-		for i := 0; i < b.N; i++ {
+		for _, test := range testCases {
 			ParseOctal(test.input)
 		}
 
-		b.StopTimer()
 	}
 }

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

@@ -31,8 +31,10 @@ type js struct {
 type oneCase struct {
 	Description string
 	Property    string
-	Input       string
-	Expected    bool
+	Input       struct {
+		Sentence string
+	}
+	Expected bool
 }
 
 // Template to generate test cases.
@@ -47,7 +49,7 @@ var testCases = []struct {
 }{ {{range .J.Cases}}{{range .Cases}}
 {
 	description:	{{printf "%q"  .Description}},
-	input:		{{printf "%q"  .Input}},
+	input:		{{printf "%q"  .Input.Sentence}},
 	expected:	{{printf "%t"  .Expected}},
 },{{end}}{{end}}
 }

data/tracks/go/exercises/pangram/cases_test.go

@@ -1,8 +1,8 @@
 package pangram
 
 // Source: exercism/problem-specifications
-// Commit: d79e13e pangram: fix duplicative case for a missing 'x' (#958)
-// Problem Specifications Version: 1.3.0
+// Commit: c319f15 pangram: Apply new "input" policy
+// Problem Specifications Version: 1.4.0
 
 var testCases = []struct {
 	description string

data/tracks/go/exercises/perfect-numbers/.meta/gen.go

@@ -32,8 +32,10 @@ type js struct {
 type oneCase struct {
 	Description string
 	Property    string
-	Input       int64
-	Expected    interface{}
+	Input       struct {
+		Number int64
+	}
+	Expected interface{}
 }
 
 func (c oneCase) Valid() bool {
@@ -78,7 +80,7 @@ var classificationTestCases = []struct {
 }{ {{range .J.Cases}} {{range .Cases}}
 {
 	description:	"{{.Description}}",
-	input:		{{.Input}},
+	input:		{{.Input.Number}},
 {{if .Valid}} ok: true,
 	expected: {{.ExpectedClassification}},
 {{- else}} ok: false,

data/tracks/go/exercises/perfect-numbers/cases_test.go

@@ -1,8 +1,8 @@
 package perfect
 
 // Source: exercism/problem-specifications
-// Commit: 924bb7a perfect-numbers: fix misleading test description
-// Problem Specifications Version: 1.0.1
+// Commit: d7c0227 perfect-numbers: Apply new "input" policy
+// Problem Specifications Version: 1.1.0
 
 var classificationTestCases = []struct {
 	description string

data/tracks/go/exercises/phone-number/.meta/gen.go

@@ -47,8 +47,10 @@ type js struct {
 		Description string
 		Cases       []struct {
 			Description string
-			Phrase      string
-			Expected    string
+			Input       struct {
+				Phrase string
+			}
+			Expected string
 		}
 	}
 }
@@ -69,7 +71,7 @@ var numberTests = []struct {
 }{
 	{{range .Cases}}{
 		description: {{printf "%q" .Description}},
-		input: {{printf "%q" .Phrase}},
+		input: {{printf "%q" .Input.Phrase}},
 		{{if expectErr .Expected}} expectErr: {{expectErr .Expected | printf "%v" }},
 		{{else}} number: {{printf "%q" .Expected}},
 		areaCode: {{areacode .Expected  | printf "%q" }},

data/tracks/go/exercises/phone-number/cases_test.go

@@ -1,8 +1,8 @@
 package phonenumber
 
 // Source: exercism/problem-specifications
-// Commit: 8380763 phone-number: add missing edge cases (#1090)
-// Problem Specifications Version: 1.3.0
+// Commit: 0783171 phone-number: Apply new "input" policy
+// Problem Specifications Version: 1.4.0
 
 // Cleanup user-entered phone numbers
 var numberTests = []struct {

data/tracks/go/exercises/phone-number/phone_number_test.go

@@ -24,13 +24,10 @@ func TestNumber(t *testing.T) {
 }
 
 func BenchmarkNumber(b *testing.B) {
-	b.StopTimer()
-	for _, test := range numberTests {
-		b.StartTimer()
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, test := range numberTests {
 			Number(test.input)
 		}
-		b.StopTimer()
 	}
 }
 
@@ -54,13 +51,10 @@ func TestAreaCode(t *testing.T) {
 }
 
 func BenchmarkAreaCode(b *testing.B) {
-	b.StopTimer()
-	for _, test := range numberTests {
-		b.StartTimer()
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, test := range numberTests {
 			AreaCode(test.input)
 		}
-		b.StopTimer()
 	}
 }
 
@@ -84,12 +78,9 @@ func TestFormat(t *testing.T) {
 }
 
 func BenchmarkFormat(b *testing.B) {
-	b.StopTimer()
-	for _, test := range numberTests {
-		b.StartTimer()
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, test := range numberTests {
 			Format(test.input)
 		}
-		b.StopTimer()
 	}
 }

data/tracks/go/exercises/pig-latin/.meta/gen.go

@@ -35,8 +35,10 @@ type oneLevel struct {
 type oneCase struct {
 	Description string
 	Property    string
-	Input       string
-	Expected    string
+	Input       struct {
+		Phrase string
+	}
+	Expected string
 }
 
 // Template to generate test cases.
@@ -51,7 +53,7 @@ var testCases = []struct {
 }{ {{range .J.Cases}} {{range .Cases}}
 {
 	description:	{{printf "%q"  .Description}},
-	input:		{{printf "%#v"  .Input}},
+	input:		{{printf "%#v"  .Input.Phrase}},
 	expected:	{{printf "%#v"  .Expected}},
 },{{end}}{{end}}
 }

data/tracks/go/exercises/pig-latin/cases_test.go

@@ -1,8 +1,8 @@
 package piglatin
 
 // Source: exercism/problem-specifications
-// Commit: b5ddd0a pig-latin: tests for Y as a vowel (#904)
-// Problem Specifications Version: 1.1.0
+// Commit: d77de78 pig-latin: Apply new "input" policy
+// Problem Specifications Version: 1.2.0
 
 var testCases = []struct {
 	description string

data/tracks/go/exercises/transpose/transpose_test.go

@@ -36,8 +36,8 @@ func min(a, b int) int {
 }
 
 func BenchmarkTranspose(b *testing.B) {
-	for _, test := range testCases {
-		for i := 0; i < b.N; i++ {
+	for i := 0; i < b.N; i++ {
+		for _, test := range testCases {
 			Transpose(test.input)
 		}
 	}

data/tracks/ocaml/docs/INSTALLATION.md

@@ -1,5 +1,36 @@
-Follow the [installation instructions](https://github.com/realworldocaml/book/wiki/Installation-Instructions) of the excellent [Real World OCaml](https://realworldocaml.org/) book. Afterwards be sure to install [OUnit](http://ounit.forge.ocamlcore.org/) using
+1. Install the OCaml compiler (`ocaml`) and package manager (`opam`).
+
+   The excellent [Real World OCaml](https://realworldocaml.org/) book has
+   [installation
+   instructions](https://github.com/realworldocaml/book/wiki/Installation-Instructions)
+   for a variety of operating systems.
+
+2. If you followed the instructions from Real World OCaml, it is likely that
+   your system's OCaml compiler is not the latest version.
+
+   To see a list of available versions and the one you have currently installed,
+   run:
+
+   ```bash
+   opam switch
+   ```
+
+   Note which version is the latest and install it by running:
+
+   ```bash
+   opam switch <version-number>
+   ```
+
+   For example, if the latest version is 4.06.0, you will run:
+
+   ```bash
+   opam switch 4.06.0
+   ```
+
+3. Install the Core and [OUnit](http://ounit.forge.ocamlcore.org/) packages,
+   which are necessary in order to run the exercise tests:
+
+   ```bash
+   opam install core ounit
+   ```
 
-```bash
-opam install ounit
-```

data/tracks/ocaml/exercises/prime-factors/example.ml

@@ -1,9 +1,8 @@
 open Core
 
 let square_root_trunc n =
-    (* Square root is not defined on int64 but it is on big_int *)
-    let open Big_int in
-    big_int_of_int64 n |> sqrt_big_int |> int64_of_big_int
+    (* Square root is not defined on int64 *)
+    Int64.to_float n |> sqrt |> Int64.of_float
 
 let rec factors_of' = function
     | 1L -> []

data/tracks/perl6/.travis.yml

@@ -16,4 +16,5 @@ script:
     exercism-rakudo-star prove /exercism
     --exec perl6
     --recurse
+    --directives
     --jobs 2

data/tracks/perl6/bin/exercise-gen.pl6

@@ -1,25 +1,33 @@
 #!/usr/bin/env perl6
 use v6;
-use Template::Mustache;
 use YAML::Parser::LibYAML;
+use lib (my $base-dir = $?FILE.IO.resolve.parent.parent).add('lib');
+use Exercism::Generator;
 
-my $base-dir = $?FILE.IO.resolve.parent.parent;
-my @exercises;
+my %*SUB-MAIN-OPTS = :named-anywhere;
 
-if $base-dir.child('problem-specifications') !~~ :d {
-  warn 'problem-specifications directory not found; some exercises may generate incorrectly.';
+proto sub MAIN (|) {
+  if $base-dir.add('problem-specifications') !~~ :d {
+    note 'problem-specifications directory not found; some exercises may generate incorrectly.';
+  }
+  if $base-dir.add('bin/configlet') !~~ :f {
+    note 'configlet not found; README.md file(s) will not be generated.';
+  }
+  {*}
 }
 
-if @*ARGS {
-  if @*ARGS[0] eq '--all' {
-    push @exercises, .basename for $base-dir.child('exercises').dir;
-  } else {
-    @exercises = @*ARGS;
-  }
-} else {
+multi sub MAIN (Bool:D :$all where *.so) {
+  generate .basename for $base-dir.add('exercises').dir;
+}
+
+multi sub MAIN (*@exercises) {
+  @exercises».&generate;
+}
+
+multi sub MAIN {
   say 'No args given; working in current directory.';
   if 'example.yaml'.IO ~~ :f {
-    push @exercises, $*CWD.IO.basename;
+    generate $*CWD.IO.basename;
   } else {
     say 'example.yaml not found in current directory; exiting.';
     exit;
@@ -28,37 +36,34 @@ if @*ARGS {
 
 my @dir-not-found;
 my @yaml-not-found;
-for @exercises -> $exercise {
-  if (my $exercise-dir = $base-dir.child("exercises/$exercise")) !~~ :d {
+
+sub generate ($exercise) {
+  if (my $exercise-dir = $base-dir.add("exercises/$exercise")) !~~ :d {
     push @dir-not-found, $exercise;
     next;
   }
-  if (my $yaml-file = $exercise-dir.child('example.yaml')) !~~ :f {
+  if (my $yaml-file = $exercise-dir.add('example.yaml')) !~~ :f {
     push @yaml-not-found, $exercise;
     next;
   };
   print "Generating $exercise... ";
 
-  my %data = yaml-parse $yaml-file.absolute;
-
-  my $cdata = $base-dir.child("problem-specifications/exercises/$exercise/canonical-data.json");
-  if $cdata ~~ :f {%data<cdata><json> = $cdata.slurp}
-
-  create-file "$exercise.t", 'test';
-
-  %data<module_file> = %data<example>;
-  create-file |<Example.pm6 module>;
+  given Exercism::Generator.new: :$exercise, data => yaml-parse $yaml-file.absolute {
+    given $exercise-dir.add("$exercise.t") -> $testfile {
+      $testfile.spurt: .test;
+      $testfile.chmod: 0o755;
+    }
+    $exercise-dir.add('Example.pm6').spurt: .example;
+    $exercise-dir.add("{.data<exercise>}.pm6").spurt: .stub;
+  }
 
-  %data<module_file> = %data<stub>;
-  create-file "{%data<exercise>}.pm6", 'module';
+  given $base-dir.add('bin/configlet') {
+    if $_ ~~ :f {
+      run .absolute, 'generate', $base-dir, '--only', $exercise;
+    }
+  }
 
   say 'Generated.';
-
-  sub create-file ($filename, $template) {
-    spurt (my $file = $exercise-dir.child($filename)),
-      Template::Mustache.render($base-dir.child("templates/$template.mustache").slurp, %data);
-    $file.chmod(0o755) if $template ~~ 'test';
-  }
 }
 
 if @dir-not-found  {warn 'exercise directory does not exist for: ' ~ join ' ', @dir-not-found}

data/tracks/perl6/lib/Exercism/Generator.pm6

@@ -0,0 +1,37 @@
+unit class Exercism::Generator;
+use Template::Mustache;
+
+my $base-dir = $?FILE.IO.parent.add("../..");
+
+has %.data;
+has Str $.exercise;
+
+submethod TWEAK {
+  if $!exercise && (my $cdata =
+    $base-dir.add: "problem-specifications/exercises/$!exercise/canonical-data.json") ~~ :f
+  {
+    %!data<cdata><json> = $cdata.slurp;
+  }
+}
+
+method cdata {
+  %!data<cdata><json> ?? %!data<cdata><json> !! '';
+}
+
+method test {
+  self!render(template => 'test');
+}
+
+method stub {
+  self!render(template => 'module', file => 'stub');
+}
+
+method example {
+  self!render(template => 'module', file => 'example');
+}
+
+method !render (:$template!, :$file) {
+  my $data = %!data;
+  if $file { $data<module_file> = $data{$file} };
+  Template::Mustache.render($base-dir.add("templates/$template.mustache").slurp, $data);
+}

data/tracks/perl6/t/generated-tests.t

@@ -0,0 +1,18 @@
+#!/usr/bin/env perl6
+use v6;
+use Test;
+use YAML::Parser::LibYAML;
+use lib (my $base-dir = $?FILE.IO.resolve.parent.parent).add('lib');
+use Exercism::Generator;
+
+bail-out if $base-dir.add('problem-specifications') !~~ :d;
+for $base-dir.add('exercises').dir {
+  if .add('example.yaml') ~~ :f {
+    todo '';
+    is .add("{.basename}.t").slurp,
+      Exercism::Generator.new(data => yaml-parse(~.add: 'example.yaml'), exercise => .basename).test,
+      "{.basename}: test suite matches generated";
+  }
+}
+
+done-testing;

data/tracks/ruby/exercises/accumulate/README.md

@@ -25,9 +25,6 @@ Keep your hands off that collect/map/fmap/whatchamacallit functionality
 provided by your standard library!
 Solve this one yourself using other basic tools instead.
 
-Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
-as this is idiomatic Lisp, not a library function.
-
 ## Advanced
 
 It is typical to call [#to_enum](http://ruby-doc.org/core-2.3.1/Object.html#method-i-to_enum) when defining methods for a generic Enumerable, in case no block is passed.

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.97
+  version: 2.2.1.98
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-01-20 00:00:00.000000000 Z
+date: 2018-01-21 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -9647,7 +9647,7 @@ files:
 - tracks/ocaml/exercises/anagram/example.ml
 - tracks/ocaml/exercises/anagram/test.ml
 - tracks/ocaml/exercises/atbash-cipher/.merlin
-- tracks/ocaml/exercises/atbash-cipher/HINTS.md
+- tracks/ocaml/exercises/atbash-cipher/.meta/hints.md
 - tracks/ocaml/exercises/atbash-cipher/Makefile
 - tracks/ocaml/exercises/atbash-cipher/README.md
 - tracks/ocaml/exercises/atbash-cipher/atbash_cipher.mli
@@ -9666,7 +9666,7 @@ files:
 - tracks/ocaml/exercises/binary-search/example.ml
 - tracks/ocaml/exercises/binary-search/test.ml
 - tracks/ocaml/exercises/bob/.merlin
-- tracks/ocaml/exercises/bob/HINTS.md
+- tracks/ocaml/exercises/bob/.meta/hints.md
 - tracks/ocaml/exercises/bob/Makefile
 - tracks/ocaml/exercises/bob/README.md
 - tracks/ocaml/exercises/bob/bob.mli
@@ -10379,6 +10379,8 @@ files:
 - tracks/perl6/exercises/wordy/example.yaml
 - tracks/perl6/exercises/wordy/wordy.t
 - tracks/perl6/img/icon.png
+- tracks/perl6/lib/Exercism/Generator.pm6
+- tracks/perl6/t/generated-tests.t
 - tracks/perl6/templates/module.mustache
 - tracks/perl6/templates/test.mustache
 - tracks/php/.editorconfig