trackler 2.2.1.56 → 2.2.1.57

data/tracks/go/exercises/poker/example.go

@@ -7,8 +7,6 @@ import (
 	"unicode/utf8"
 )
 
-const testVersion = 5
-
 const (
 	Jack  = 11
 	Queen = 12

data/tracks/go/exercises/poker/poker_test.go

@@ -6,11 +6,6 @@ import (
 )
 
 // Define a function BestHand([]string) ([]string, error).
-//
-// Also define a testVersion with a value that matches
-// the targetTestVersion here.
-
-const targetTestVersion = 5
 
 var invalidTestCases = []struct {
 	name string
@@ -58,12 +53,6 @@ var invalidTestCases = []struct {
 	},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestBestHandValid(t *testing.T) {
 	for _, tt := range validTestCases {
 		actual, err := BestHand(tt.hands)

data/tracks/go/exercises/pov/example.go

@@ -5,8 +5,6 @@ import (
 	"log"
 )
 
-const testVersion = 2
-
 type Graph struct {
 	arcs   [][]int
 	labels []string

data/tracks/go/exercises/pov/pov_test.go

@@ -6,8 +6,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 2
-
 // POV / reparent / change root of a tree
 //
 // API:
@@ -24,7 +22,7 @@ const targetTestVersion = 2
 //
 // The test program will create a graph with New, then use AddNode to add
 // leaf nodes.  After that it will use AddArc to construct the rest of the tree
-// from the bottom up.  That is, the `to` argument will aways specify a node
+// from the bottom up.  That is, the `to` argument will always specify a node
 // that has already been added.
 //
 // ArcList is a dump method to let the test program see your graph.  It must
@@ -259,12 +257,6 @@ func (tc testCase) testResult(got, want []string, msg string, t *testing.T) {
 	t.FailNow()
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestConstruction(t *testing.T) {
 	for _, tc := range testCases {
 		got := tc.graph().ArcList()

data/tracks/go/exercises/prime-factors/example.go

@@ -1,7 +1,5 @@
 package prime
 
-const testVersion = 2
-
 func Factors(n int64) []int64 {
 	factors := []int64{}
 	possibleFactor := int64(2)

data/tracks/go/exercises/prime-factors/prime_factors_test.go

@@ -7,8 +7,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 2
-
 var tests = []struct {
 	input    int64
 	expected []int64
@@ -26,17 +24,11 @@ var tests = []struct {
 	{93819012551, []int64{11, 9539, 894119}},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestPrimeFactors(t *testing.T) {
 	for _, test := range tests {
 		actual := Factors(test.input)
 		if !reflect.DeepEqual(actual, test.expected) {
-			t.Errorf("prime.Factors(%d) = %v; expected %v",
+			t.Errorf("prime.Factors(%d) = %#v; expected %#v",
 				test.input, actual, test.expected)
 		}
 	}

data/tracks/go/exercises/protein-translation/example.go

@@ -1,7 +1,5 @@
 package protein
 
-const testVersion = 1
-
 func FromCodon(codon string) string {
 	switch codon {
 	case

data/tracks/go/exercises/protein-translation/protein_translation_test.go

@@ -5,8 +5,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 type codonCase struct {
 	input    string
 	expected string
@@ -44,12 +42,6 @@ var proteinTestCases = []rnaCase{
 	{"UGGUGUUAUUAAUGGUUU", []string{"Tryptophan", "Cysteine", "Tyrosine"}},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestCodon(t *testing.T) {
 	for _, test := range codonTestCases {
 		actual := FromCodon(test.input)

data/tracks/go/exercises/pythagorean-triplet/example.go

@@ -1,7 +1,5 @@
 package pythagorean
 
-const testVersion = 1
-
 type Triplet [3]int
 
 func pyth(a, b, c int) bool {

data/tracks/go/exercises/pythagorean-triplet/pythagorean_triplet_test.go

@@ -24,14 +24,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 var rangeTests = []struct {
 	min, max int
 	ts       []Triplet

data/tracks/go/exercises/queen-attack/example.go

@@ -2,8 +2,6 @@ package queenattack
 
 import "fmt"
 
-const testVersion = 2
-
 func CanQueenAttack(w, b string) (attack bool, err error) {
 	if err = valSq(w); err != nil {
 		return false, err

data/tracks/go/exercises/queen-attack/queen_attack_test.go

@@ -5,8 +5,6 @@ import "testing"
 // Arguments to CanQueenAttack are in algebraic notation.
 // See http://en.wikipedia.org/wiki/Algebraic_notation_(chess)
 
-const targetTestVersion = 2
-
 var tests = []struct {
 	w, b   string
 	attack bool
@@ -31,12 +29,6 @@ var tests = []struct {
 	{"a8", "h1", true, true},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestCanQueenAttack(t *testing.T) {
 	for _, test := range tests {
 		switch attack, err := CanQueenAttack(test.w, test.b); {

data/tracks/go/exercises/raindrops/.meta/hints.md

@@ -0,0 +1,7 @@
+## No Stub
+
+This is the first exercise in the Go track that doesn't have a stub file; a pre-existing
+`raindrops.go` file to get you started on your solution.
+
+You won't see any stub files in the future and should start getting comfortable
+creating your own Go files for your solutions.

data/tracks/go/exercises/raindrops/cases_test.go

@@ -1,8 +1,8 @@
 package raindrops
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 9db5371 raindrops: Fix canonical-data.json formatting
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 var tests = []struct {
 	input    int

data/tracks/go/exercises/raindrops/example.go

@@ -2,8 +2,6 @@ package raindrops
 
 import "strconv"
 
-const testVersion = 3
-
 func Convert(number int) string {
 	s := ""
 	if number%3 == 0 {

data/tracks/go/exercises/raindrops/raindrops_test.go

@@ -2,14 +2,6 @@ package raindrops
 
 import "testing"
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestConvert(t *testing.T) {
 	for _, test := range tests {
 		if actual := Convert(test.input); actual != test.expected {

data/tracks/go/exercises/react/example.go

@@ -1,7 +1,5 @@
 package react
 
-const testVersion = 5
-
 type reactor struct {
 	cells []*cell
 }

data/tracks/go/exercises/react/react_test.go

@@ -7,11 +7,6 @@ import (
 
 // Define a function New() Reactor and the stuff that follows from
 // implementing Reactor.
-//
-// Also define a testVersion with a value that matches
-// the targetTestVersion here.
-
-const targetTestVersion = 5
 
 // This is a compile time check to see if you've properly implemented New().
 var _ Reactor = New()
@@ -24,12 +19,6 @@ func assertCellValue(t *testing.T, c Cell, expected int, explanation string) {
 	}
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 // Setting the value of an input cell changes the observable Value()
 func TestSetInput(t *testing.T) {
 	r := New()

data/tracks/go/exercises/rna-transcription/cases_test.go

@@ -1,8 +1,8 @@
 package strand
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: cb1fd3a rna-transcription: rephrase negative test descriptions
-// x-common version: 1.0.1
+// Problem Specifications Version: 1.0.1
 
 var rnaTests = []struct {
 	input    string

data/tracks/go/exercises/rna-transcription/example.go

@@ -2,8 +2,6 @@ package strand
 
 import "strings"
 
-const testVersion = 3
-
 func ToRNA(dna string) string {
 	dna = strings.Replace(dna, "A", "u", -1)
 	dna = strings.Replace(dna, "T", "a", -1)

data/tracks/go/exercises/rna-transcription/rna_transcription.go

@@ -0,0 +1,6 @@
+package strand
+
+const testVersion = 3
+
+func ToRNA(dna string) string {
+}

data/tracks/go/exercises/rna-transcription/rna_transcription_test.go

@@ -2,14 +2,6 @@ package strand
 
 import "testing"
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestRNATranscription(t *testing.T) {
 	for _, test := range rnaTests {
 		if actual := ToRNA(test.input); actual != test.expected {

data/tracks/go/exercises/robot-name/example.go

@@ -7,8 +7,6 @@ import (
 	"math/rand"
 )
 
-const testVersion = 1
-
 type Robot struct {
 	name string
 }

data/tracks/go/exercises/robot-name/robot_name_test.go

@@ -5,18 +5,10 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var namePat = regexp.MustCompile(`^[A-Z]{2}\d{3}$`)
 
 func New() *Robot { return new(Robot) }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestNameValid(t *testing.T) {
 	n := New().Name()
 	if !namePat.MatchString(n) {

data/tracks/go/exercises/robot-simulator/example.go

@@ -3,7 +3,6 @@ package robot
 import "fmt"
 
 // ======= Step 1
-const testVersion = 3
 const (
 	N Dir = iota
 	E

data/tracks/go/exercises/robot-simulator/robot_simulator_test.go

@@ -25,14 +25,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestStep1(t *testing.T) {
 
 	want := func(x, y int, dir Dir) {

data/tracks/go/exercises/roman-numerals/cases_test.go

@@ -1,8 +1,8 @@
 package romannumerals
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 070e8d5 roman-numerals: Fix canonical-data.json formatting
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 type romanNumeralTest struct {
 	arabic   int

data/tracks/go/exercises/roman-numerals/example.go

@@ -5,8 +5,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 4
-
 type arabicToRoman struct {
 	arabic int
 	roman  string

data/tracks/go/exercises/roman-numerals/roman_numerals_test.go

@@ -2,14 +2,6 @@ package romannumerals
 
 import "testing"
 
-const targetTestVersion = 4
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestRomanNumerals(t *testing.T) {
 	tc := append(romanNumeralTests, []romanNumeralTest{
 		{0, "", true},

data/tracks/go/exercises/rotational-cipher/README.md

@@ -0,0 +1,56 @@
+# Rotational Cipher
+
+Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
+
+The Caesar cipher is a simple shift cipher that relies on
+transposing all the letters in the alphabet using an integer key
+between `0` and `26`. Using a key of `0` or `26` will always yield
+the same output due to modular arithmetic. The letter is shifted
+for as many values as the value of the key.
+
+The general notation for rotational ciphers is `ROT + <key>`.
+The most commonly used rotational cipher is `ROT13`.
+
+A `ROT13` on the Latin alphabet would be as follows:
+
+```text
+Plain:  abcdefghijklmnopqrstuvwxyz
+Cipher: nopqrstuvwxyzabcdefghijklm
+```
+
+It is stronger than the Atbash cipher because it has 27 possible keys, and 25 usable keys.
+
+Ciphertext is written out in the same formatting as the input including spaces and punctuation.
+
+## Examples
+
+- ROT5  `omg` gives `trl`
+- ROT0  `c` gives `c`
+- ROT26 `Cool` gives `Cool`
+- ROT13 `The quick brown fox jumps over the lazy dog.` gives `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.`
+- ROT13 `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.` gives `The quick brown fox jumps over the lazy dog.`
+
+## 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 [https://en.wikipedia.org/wiki/Caesar_cipher](https://en.wikipedia.org/wiki/Caesar_cipher)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+