trackler 2.2.1.56 → 2.2.1.57

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

@@ -1,7 +1,5 @@
 package prime
 
-const testVersion = 1
-
 func Nth(n int) (p int, ok bool) {
 	switch {
 	case n < 1:

data/tracks/go/exercises/nth-prime/nth_prime_test.go

@@ -2,8 +2,6 @@ package prime
 
 import "testing"
 
-const targetTestVersion = 1
-
 var tests = []struct {
 	n  int
 	p  int
@@ -19,12 +17,6 @@ var tests = []struct {
 	{0, 0, false},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestNth(t *testing.T) {
 	for _, test := range tests {
 		switch p, ok := Nth(test.n); {

data/tracks/go/exercises/nucleotide-count/example.go

@@ -5,8 +5,6 @@ import (
 	"strings"
 )
 
-const testVersion = 2
-
 // Histogram is a mapping from nucleotide to its count in given DNA
 type Histogram map[byte]int
 

data/tracks/go/exercises/nucleotide-count/nucleotide_count.go

@@ -0,0 +1,26 @@
+package dna
+
+const testVersion = 2
+
+// Histogram is a mapping from nucleotide to its count in given DNA.
+// Choose a suitable data type.
+type Histogram
+
+// DNA is a list of nucleotides. Choose a suitable data type.
+type DNA
+
+// Count counts number of occurrences of given nucleotide in given DNA.
+//
+// This is a method on the DNA type. A method is a function with a special receiver argument.
+// The receiver appears in its own argument list between the func keyword and the method name.
+// Here, the Count method has a receiver of type DNA named d.
+func (d DNA) Count(nucleotide byte) (int, error) {
+	return 0, nil
+}
+
+// Counts generates a histogram of valid nucleotides in the given DNA.
+// Returns an error if d contains an invalid nucleotide.
+func (d DNA) Counts() (Histogram, error) {
+	var h Histogram
+	return h, nil
+}

data/tracks/go/exercises/nucleotide-count/nucleotide_count_test.go

@@ -5,8 +5,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 2
-
 var tallyTests = []struct {
 	strand     DNA
 	nucleotide byte
@@ -18,12 +16,6 @@ var tallyTests = []struct {
 	{"GGGGGTAACCCGG", 'T', 1},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestNucleotideCounts(t *testing.T) {
 	for _, tt := range tallyTests {
 		if count, err := tt.strand.Count(tt.nucleotide); err != nil {

data/tracks/go/exercises/ocr-numbers/example.go

@@ -2,8 +2,6 @@ package ocr
 
 import "strings"
 
-const testVersion = 1
-
 var digit = map[string]byte{
 	" _ | ||_|   ": '0',
 	"     |  |   ": '1',

data/tracks/go/exercises/ocr-numbers/ocr_numbers_test.go

@@ -25,8 +25,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var tests = []struct {
 	in  string
 	out []string
@@ -123,12 +121,6 @@ var tests = []struct {
 
 var _ = recognizeDigit // step 1.
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestRecognize(t *testing.T) {
 	for _, test := range tests {
 		if res := Recognize(test.in); !reflect.DeepEqual(res, test.out) {

data/tracks/go/exercises/octal/example.go

@@ -4,8 +4,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 1
-
 func ParseOctal(octal string) (int64, error) {
 	num := int64(0)
 	for _, digit := range octal {

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

@@ -4,8 +4,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var testCases = []struct {
 	input       string
 	expectedNum int64
@@ -18,12 +16,6 @@ var testCases = []struct {
 	{"35682", 0, true},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestParseOctal(t *testing.T) {
 	for _, test := range testCases {
 		actualNum, actualErr := ParseOctal(test.input)

data/tracks/go/exercises/paasio/example.go

@@ -5,8 +5,6 @@ import (
 	"sync"
 )
 
-const testVersion = 3
-
 // NewWriteCounter returns an implementation of WriteCounter.  Calls to
 // w.Write() are not guaranteed to be synchronized.
 func NewWriteCounter(w io.Writer) WriteCounter {

data/tracks/go/exercises/paasio/paasio_test.go

@@ -11,14 +11,6 @@ import (
 	"time"
 )
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestMultiThreaded(t *testing.T) {
 	mincpu := 2
 	minproc := 2

data/tracks/go/exercises/palindrome-products/example.go

@@ -5,8 +5,6 @@ import (
 	"strconv"
 )
 
-const testVersion = 1
-
 func isPal(x int) bool {
 	s := strconv.Itoa(x)
 	for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {

data/tracks/go/exercises/palindrome-products/palindrome_products_test.go

@@ -7,8 +7,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 /* API to implement:
 
 type Product struct {
@@ -75,12 +73,6 @@ var bonusData = []struct {
 		""},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestPalindromeProducts(t *testing.T) {
 	// Uncomment the following line to add the bonus test to the default tests
 	// testData = append(testData, bonusData...)

data/tracks/go/exercises/pangram/example.go

@@ -4,8 +4,6 @@ import (
 	"strings"
 )
 
-const testVersion = 2
-
 func IsPangram(s string) bool {
 	lowerString := strings.ToLower(s)
 	var check [26]bool

data/tracks/go/exercises/pangram/pangram_test.go

@@ -4,8 +4,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 2
-
 type testCase struct {
 	input         string
 	expected      bool
@@ -20,12 +18,8 @@ var testCases = []testCase{
 	{"the 1 quick brown fox jumps over the 2 lazy dogs", true, ""},
 	{"7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog", false, "missing letters replaced by numbers"},
 	{"\"Five quacking Zephyrs jolt my wax bed.\"", true, ""},
-}
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
+	{"abcdefghijklmnopqrstuvwxy", false, "missing character 'z'"},
+	{"bcdefghijklmnopqrstuvwxyz", false, "missing character 'a'"},
 }
 
 func TestPangram(t *testing.T) {

data/tracks/go/exercises/parallel-letter-frequency/example.go

@@ -1,7 +1,5 @@
 package letter
 
-const testVersion = 1
-
 func ConcurrentFrequency(l []string) FreqMap {
 	switch len(l) {
 	case 0:

data/tracks/go/exercises/parallel-letter-frequency/parallel_letter_frequency_test.go

@@ -40,14 +40,6 @@ O say does that star-spangled banner yet wave,
 O'er the land of the free and the home of the brave?`
 )
 
-const targetTestVersion = 1
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestConcurrentFrequency(t *testing.T) {
 	seq := Frequency(euro + dutch + us)
 	con := ConcurrentFrequency([]string{euro, dutch, us})

data/tracks/go/exercises/pascals-triangle/example.go

@@ -1,7 +1,5 @@
 package pascal
 
-const testVersion = 1
-
 func Triangle(n int) (t [][]int) {
 	if n < 1 {
 		return

data/tracks/go/exercises/pascals-triangle/pascals_triangle_test.go

@@ -6,8 +6,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var triangleTestCases = [][]int{
 	{1},
 	{1, 1},
@@ -33,12 +31,6 @@ var triangleTestCases = [][]int{
 
 var testSize = len(triangleTestCases)
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestTriangle(t *testing.T) {
 	for n := 1; n <= testSize; n++ {
 		res := Triangle(n)

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

@@ -2,8 +2,6 @@ package perfect
 
 import "errors"
 
-const testVersion = 1
-
 // Classification is the category devised by Greek Mathematician Nicomachus
 type Classification string
 

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

@@ -17,14 +17,6 @@ var classificationTestCases = []struct {
 	{8128, ClassificationPerfect},
 }
 
-const targetTestVersion = 1
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestGivesPositiveRequiredError(t *testing.T) {
 	if _, err := Classify(0); err != ErrOnlyPositive {
 		t.Errorf("Expected error %q but got %q", ErrOnlyPositive, err)

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

@@ -1,8 +1,8 @@
 package phonenumber
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 39cba0d phone-number: Remove test using malformed input. (#772)
-// x-common version: 1.2.0
+// Problem Specifications Version: 1.2.0
 
 // Cleanup user-entered phone numbers
 var numberTests = []struct {

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

@@ -5,8 +5,6 @@ import (
 	"unicode"
 )
 
-const testVersion = 3
-
 // Number takes in a potential phone number string and returns the number
 // without any formatting if it's valid.
 //

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

@@ -4,14 +4,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestNumber(t *testing.T) {
 	for _, test := range numberTests {
 		actual, actualErr := Number(test.input)

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

@@ -5,8 +5,6 @@ import (
 	"strings"
 )
 
-const testVersion = 1
-
 var vowel = regexp.MustCompile(`^([aeiou]|y[^aeiou]|xr)[a-z]*`)
 var cons = regexp.MustCompile(`^([^aeiou]?qu|[^aeiou]+)([a-z]*)`)
 

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

@@ -2,8 +2,6 @@ package igpay
 
 import "testing"
 
-const targetTestVersion = 1
-
 var tests = []struct{ pl, in string }{
 	{"appleay", "apple"},
 	{"earay", "ear"},
@@ -22,12 +20,6 @@ var tests = []struct{ pl, in string }{
 	{"xrayay", "xray"},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestPigLatin(t *testing.T) {
 	for _, test := range tests {
 		if pl := PigLatin(test.in); pl != test.pl {

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

@@ -0,0 +1,7 @@
+Your function will receive an array of strings. Each string represents
+a hand composed of 5 cards separated by spaces. A card is represented
+by a number and its suit.
+
+You are to return an array containing either the best hand or, in case
+of a tie, the best hands. Each hand should be a string in the same
+format as given to you initially as input.

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

@@ -5,6 +5,15 @@ Pick the best hand(s) from a list of poker hands.
 See [wikipedia](https://en.wikipedia.org/wiki/List_of_poker_hands) for an
 overview of poker hands.
 
+Your function will receive an array of strings. Each string represents
+a hand composed of 5 cards separated by spaces. A card is represented
+by a number and its suit.
+
+You are to return an array containing either the best hand or, in case
+of a tie, the best hands. Each hand should be a string in the same
+format as given to you initially as input.
+
+
 ## Running the tests
 
 To run the tests run the command `go test` from within the exercise directory.

data/tracks/go/exercises/poker/cases_test.go

@@ -1,8 +1,8 @@
 package poker
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: d078ba8 poker: Add canonical-data (#793)
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 type validTestCase struct {
 	name  string