trackler 2.2.1.106 → 2.2.1.107

data/tracks/elm/exercises/pascals-triangle/README.md

@@ -1,4 +1,4 @@
-# Pascals Triangle
+# Pascal's Triangle
 
 Compute Pascal's triangle up to a given number of rows.
 

data/tracks/elm/exercises/phone-number/README.md

@@ -6,14 +6,15 @@ The **North American Numbering Plan (NANP)** is a telephone numbering system use
 
 NANP numbers are ten-digit numbers consisting of a three-digit Numbering Plan Area code, commonly known as *area code*, followed by a seven-digit local number. The first three digits of the local number represent the *exchange code*, followed by the unique four-digit number which is the *subscriber number*.
 
-
 The format is usually represented as
-```
+
+```text
 (NXX)-NXX-XXXX
 ```
+
 where `N` is any digit from 2 through 9 and `X` is any digit from 0 through 9.
 
-Your task is to clean up differently formated telephone numbers by removing punctuation and the country code (1) if present.
+Your task is to clean up differently formatted telephone numbers by removing punctuation and the country code (1) if present.
 
 For example, the inputs
 - `+1 (613)-995-0253`

data/tracks/elm/exercises/rna-transcription/README.md

@@ -1,4 +1,4 @@
-# Rna Transcription
+# RNA Transcription
 
 Given a DNA strand, return its RNA complement (per RNA transcription).
 
@@ -49,7 +49,7 @@ calls from each test until you get them all passing!
 
 ## Source
 
-Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
+Hyperphysics [http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html](http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elm/exercises/roman-numerals/README.md

@@ -14,7 +14,7 @@ The Romans wrote numbers using letters - I, V, X, L, C, D, M. (notice
 these letters have lots of straight lines and are hence easy to hack
 into stone tablets).
 
-```
+```text
  1  => I
 10  => X
  7  => VII

data/tracks/elm/exercises/run-length-encoding/README.md

@@ -7,20 +7,20 @@ Run-length encoding (RLE) is a simple form of data compression, where runs
 
 For example we can represent the original 53 characters with only 13.
 
-```
+```text
 "WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB"  ->  "12WB12W3B24WB"
 ```
 
 RLE allows the original data to be perfectly reconstructed from
 the compressed data, which makes it a lossless data compression.
 
-```
+```text
 "AABCCCDEEEE"  ->  "2AB3CD4E"  ->  "AABCCCDEEEE"
 ```
 
 For simplicity, you can assume that the unencoded string will only contain
-the letters A through Z (either lower or upper case) and whitespace. This way 
-data to be encoded will never contain any numbers and numbers inside data to 
+the letters A through Z (either lower or upper case) and whitespace. This way
+data to be encoded will never contain any numbers and numbers inside data to
 be decoded always represent the count for the following character.
 
 ## Elm Installation

data/tracks/elm/exercises/scrabble-score/README.md

@@ -6,7 +6,7 @@ Given a word, compute the scrabble score for that word.
 
 You'll need these:
 
-```plain
+```text
 Letter                           Value
 A, E, I, O, U, L, N, R, S, T       1
 D, G                               2
@@ -18,6 +18,7 @@ Q, Z                               10
 ```
 
 ## Examples
+
 "cabbage" should be scored as worth 14 points:
 
 - 3 points for C
@@ -34,6 +35,7 @@ And to total:
 - = 14
 
 ## Extensions
+
 - You can play a double or a triple letter.
 - You can play a double or a triple word.
 

data/tracks/elm/exercises/space-age/README.md

@@ -12,7 +12,7 @@ Given an age in seconds, calculate how old someone would be on:
    - Neptune: orbital period 164.79132 Earth years
 
 So if you were told someone were 1,000,000,000 seconds old, you should
-be able to say that they're 31 Earth-years old.
+be able to say that they're 31.69 Earth-years old.
 
 If you're wondering why Pluto didn't make the cut, go watch [this
 youtube video](http://www.youtube.com/watch?v=Z_2gbGXzFbs).

data/tracks/elm/exercises/sublist/README.md

@@ -46,6 +46,5 @@ $ npm run watch
 As you work your way through the test suite, be sure to remove the `skip <|`
 calls from each test until you get them all passing!
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elm/exercises/sum-of-multiples/README.md

@@ -1,16 +1,13 @@
 # Sum Of Multiples
 
-Given a number, find the sum of all the multiples of particular numbers up to
+Given a number, find the sum of all the unique multiples of particular numbers up to
 but not including that number.
 
-If we list all the natural numbers up to but not including 20 that are
-multiples of either 3 or 5, we get 3, 5, 6 and 9, 10, 12, 15, and 18.
+If we list all the natural numbers below 20 that are multiples of 3 or 5,
+we get 3, 5, 6, 9, 10, 12, 15, and 18.
 
 The sum of these multiples is 78.
 
-Given a number, find the sum of the multiples of a given set of numbers,
-up to but not including that number.
-
 ## Elm Installation
 
 Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm

data/tracks/elm/exercises/triangle/README.md

@@ -2,23 +2,26 @@
 
 Determine if a triangle is equilateral, isosceles, or scalene.
 
-An _equilateral_ triangle has all three sides the same length.<br/>
+An _equilateral_ triangle has all three sides the same length.
+
 An _isosceles_ triangle has at least two sides the same length. (It is sometimes
 specified as having exactly two sides the same length, but for the purposes of
-this exercise we'll say at least two.)<br/>
+this exercise we'll say at least two.)
+
 A _scalene_ triangle has all sides of different lengths.
 
 ## Note
 
-For a shape to be a triangle at all, all sides have to be of length > 0, and 
-the sum of the lengths of any two sides must be greater than or equal to the 
+For a shape to be a triangle at all, all sides have to be of length > 0, and
+the sum of the lengths of any two sides must be greater than or equal to the
 length of the third side. See [Triangle Inequality](https://en.wikipedia.org/wiki/Triangle_inequality).
 
 ## Dig Deeper
 
-The case where the sum of the lengths of two sides _equals_ that of the 
-third is known as a _degenerate_ triangle - it has zero area and looks like 
+The case where the sum of the lengths of two sides _equals_ that of the
+third is known as a _degenerate_ triangle - it has zero area and looks like
 a single line. Feel free to add your own code/tests to check for degenerate triangles.
+
 ## Elm Installation
 
 Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm

data/tracks/elm/exercises/word-count/README.md

@@ -4,14 +4,13 @@ Given a phrase, count the occurrences of each word in that phrase.
 
 For example for the input `"olly olly in come free"`
 
-```plain
+```text
 olly: 2
 in: 1
 come: 1
 free: 1
 ```
 
-
 ## Elm Installation
 
 Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm

data/tracks/go/config.json

@@ -1177,6 +1177,18 @@
       "unlocked_by": "luhn",
       "uuid": "37821140-c0d0-4da8-8f50-47356705a615"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "proverb",
+      "topics": [
+        "arrays",
+        "loops",
+        "strings"
+      ],
+      "unlocked_by": "two-fer",
+      "uuid": "b6d05e8f-542b-4789-9cbc-7ba132a5f03d"
+    },
     {
       "difficulty": 2,
       "slug": "isbn-verifier",

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

@@ -32,8 +32,10 @@ type Group struct {
 // One test case.
 type OneCase struct {
 	Description string
-	Input       []string
-	Expected    []int
+	Input       struct {
+		Instructions []string
+	}
+	Expected []int
 }
 
 // template applied to above data structure generates the Go test cases
@@ -58,7 +60,7 @@ group: {{printf "%q"  .Name}},
 tests: []testCase{
 {{range .Cases}}{
 {{printf "%q"  .Description}},
-{{printf "%#v" .Input}},
+{{printf "%#v" .Input.Instructions}},
 {{printf "%#v" .Expected}},
 },
 {{end}}

data/tracks/go/exercises/forth/cases_test.go

@@ -1,8 +1,8 @@
 package forth
 
 // Source: exercism/problem-specifications
-// Commit: 9bf041b forth: Add tests for case-insensitivity (#979)
-// Problem Specifications Version: 1.4.0
+// Commit: 01257bd forth: Apply new "input" policy
+// Problem Specifications Version: 1.5.0
 
 type testGroup struct {
 	group string

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

@@ -28,29 +28,31 @@ type js struct {
 type testGroup struct {
 	Description string
 	Cases       []json.RawMessage `property:"RAW"`
-	SquareCases []SquareCase      `property:"square"`
+	SquareCases []squareCase      `property:"square"`
 	// Note: canonical-data.json has a element of "cases"
 	// which includes a test for property 'total', but it is ignored here,
 	// since "expected" is a single known value.
 }
 
-type SquareCase struct {
+type squareCase struct {
 	Description string
-	Input       int
-	Expected    interface{}
+	Input       struct {
+		Square int
+	}
+	Expected interface{}
 }
 
-func (c SquareCase) HasAnswer() bool {
+func (c squareCase) HasAnswer() bool {
 	hasAnswer, _ := determineExpected(c.Expected)
 	return hasAnswer
 }
 
-func (c SquareCase) Answer() uint64 {
+func (c squareCase) Answer() uint64 {
 	_, answer := determineExpected(c.Expected)
 	return answer
 }
 
-func (c SquareCase) EditedDescription() string {
+func (c squareCase) EditedDescription() string {
 	// Go doesn't raise exceptions, so replace the wording in .Description.
 	return strings.Replace(c.Description, "raises an exception", "returns an error", 1)
 }
@@ -85,7 +87,7 @@ var tmpl = `package grains
 			{{- range .SquareCases}}
 			{
 				description: "{{.EditedDescription}}",
-				input: {{.Input}},
+				input: {{.Input.Square}},
 				{{- if .HasAnswer}}
 					expectedVal: {{.Answer}},
 				{{- else}}

data/tracks/go/exercises/grains/cases_test.go

@@ -1,8 +1,8 @@
 package grains
 
 // Source: exercism/problem-specifications
-// Commit: d4554e6 grains: fix a typo in comments of canonical data
-// Problem Specifications Version: 1.0.0
+// Commit: f079c2d grains: Move input (square) to input object (#1191)
+// Problem Specifications Version: 1.1.0
 
 // returns the number of grains on the square
 var squareTests = []struct {

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

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

data/tracks/go/exercises/isogram/cases_test.go

@@ -1,8 +1,8 @@
 package isogram
 
 // Source: exercism/problem-specifications
-// Commit: f9e0ebb isogram: Update canonical-data.json as in #919 (#920)
-// Problem Specifications Version: 1.2.0
+// Commit: 79f1357 isogram: Apply new "input" policy (#1180)
+// Problem Specifications Version: 1.3.0
 
 var testCases = []struct {
 	description string

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

@@ -0,0 +1,51 @@
+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("proverb", &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
+		Input       struct {
+			Strings []string
+		}
+		Expected []string
+	}
+}
+
+// template applied to above data structure generates the Go test cases
+var tmpl = `package proverb
+
+{{.Header}}
+
+type proverbTest struct {
+	description string
+	input    []string
+	expected []string
+}
+
+var stringTestCases = []proverbTest {
+{{range .J.Cases}} {
+	description: {{printf "%q" .Description }},
+	input: {{printf "%#v" .Input.Strings }},
+	expected: {{printf "%#v" .Expected }},
+},
+{{end}}
+}
+`

data/tracks/go/exercises/proverb/README.md

@@ -0,0 +1,41 @@
+# Proverb
+
+For want of a horseshoe nail, a kingdom was lost, or so the saying goes.
+
+Given a list of inputs, generate the relevant proverb. For example, given the list `["nail", "shoe", "horse", "rider", "message", "battle", "kingdom"]`, you will output the full text of this proverbial rhyme:
+
+```text
+For want of a nail the shoe was lost.
+For want of a shoe the horse was lost.
+For want of a horse the rider was lost.
+For want of a rider the message was lost.
+For want of a message the battle was lost.
+For want of a battle the kingdom was lost.
+And all for the want of a nail.
+```
+
+Note that the list of inputs may vary; your solution should be able to handle lists of arbitrary length and content. No line of the output text should be a static, unchanging string; all should vary according to the input given.
+
+## Running the tests
+
+To run the tests run the command `go test` from within the exercise directory.
+
+If the test suite contains benchmarks, you can run these with the `-bench`
+flag:
+
+    go test -bench .
+
+Keep in mind that each reviewer will run benchmarks on a different machine, with
+different specs, so the results from these benchmark tests may vary.
+
+## Further information
+
+For more detailed information about the Go track, including how to get help if
+you're having trouble, please visit the exercism.io [Go language page](http://exercism.io/languages/go/about).
+
+## Source
+
+Wikipedia [http://en.wikipedia.org/wiki/For_Want_of_a_Nail](http://en.wikipedia.org/wiki/For_Want_of_a_Nail)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/go/exercises/proverb/cases_test.go

@@ -0,0 +1,44 @@
+package proverb
+
+// Source: exercism/problem-specifications
+// Commit: e86e97a proverb: apply "input" policy
+// Problem Specifications Version: 1.1.0
+
+type proverbTest struct {
+	description string
+	input       []string
+	expected    []string
+}
+
+var stringTestCases = []proverbTest{
+	{
+		description: "zero pieces",
+		input:       []string{},
+		expected:    []string{},
+	},
+	{
+		description: "one piece",
+		input:       []string{"nail"},
+		expected:    []string{"And all for the want of a nail."},
+	},
+	{
+		description: "two pieces",
+		input:       []string{"nail", "shoe"},
+		expected:    []string{"For want of a nail the shoe was lost.", "And all for the want of a nail."},
+	},
+	{
+		description: "three pieces",
+		input:       []string{"nail", "shoe", "horse"},
+		expected:    []string{"For want of a nail the shoe was lost.", "For want of a shoe the horse was lost.", "And all for the want of a nail."},
+	},
+	{
+		description: "full proverb",
+		input:       []string{"nail", "shoe", "horse", "rider", "message", "battle", "kingdom"},
+		expected:    []string{"For want of a nail the shoe was lost.", "For want of a shoe the horse was lost.", "For want of a horse the rider was lost.", "For want of a rider the message was lost.", "For want of a message the battle was lost.", "For want of a battle the kingdom was lost.", "And all for the want of a nail."},
+	},
+	{
+		description: "four pieces modernized",
+		input:       []string{"pin", "gun", "soldier", "battle"},
+		expected:    []string{"For want of a pin the gun was lost.", "For want of a gun the soldier was lost.", "For want of a soldier the battle was lost.", "And all for the want of a pin."},
+	},
+}