trackler 2.2.1.56 → 2.2.1.57

data/tracks/go/exercises/food-chain/example.go

@@ -1,7 +1,5 @@
 package foodchain
 
-const testVersion = 3
-
 var verse = []struct{ eaten, comment string }{
 	{"", ""},
 	{"fly", "I don't know why she swallowed the fly. Perhaps she'll die."},

data/tracks/go/exercises/food-chain/food_chain_test.go

@@ -6,8 +6,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 3
-
 var ref = []string{``,
 
 	`I know an old lady who swallowed a fly.
@@ -86,12 +84,6 @@ func diff(got, want string) string {
 	}
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestVerse(t *testing.T) {
 	for v := 1; v <= 8; v++ {
 		if ret := Verse(v); ret != ref[v] {

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

@@ -1,8 +1,8 @@
 package forth
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 1b4165d Add test for Forth that an operator can be overridden.
-// x-common version: 1.2.0
+// Problem Specifications Version: 1.2.0
 
 type testGroup struct {
 	group string

data/tracks/go/exercises/forth/example.go

@@ -233,5 +233,3 @@ var errNotEnoughOperands = errors.New("not enough operands")
 var errDivideByZero = errors.New("attempt to divide by zero")
 var errEmptyUserDef = errors.New("empty user definition")
 var errInvalidUserDef = errors.New("invalid user def word")
-
-const testVersion = 2

data/tracks/go/exercises/forth/forth_test.go

@@ -9,14 +9,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 2
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestForth(t *testing.T) {
 	for _, tg := range testGroups {
 		for _, tc := range tg.tests {

data/tracks/go/exercises/gigasecond/cases_test.go

@@ -1,8 +1,8 @@
 package gigasecond
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 61e7d70 Fix "Gigasecond: Schema Compliance"
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 // Add one gigasecond to the input.
 var addCases = []struct {

data/tracks/go/exercises/gigasecond/example.go

@@ -2,8 +2,6 @@ package gigasecond
 
 import "time"
 
-const testVersion = 4
-
 // AddGigasecond returns time t plus one gigasecond.
 func AddGigasecond(t time.Time) time.Time {
 	return t.Add(1e9 * time.Second)

data/tracks/go/exercises/gigasecond/gigasecond.go

@@ -1,8 +1,18 @@
+// This is a "stub" file.  It's a little start on your solution.
+// It's not a complete solution though; you have to write some code.
+
+// Package gigasecond should have a package comment that summarizes what it's about.
+// https://golang.org/doc/effective_go.html#commentary
 package gigasecond
 
 // import path for the time package from the standard library
 import "time"
 
-const testVersion = 4
-
-func AddGigasecond(time.Time) time.Time
+// AddGigasecond should have a comment documenting it.
+func AddGigasecond(t time.Time) time.Time {
+	// Write some code here to pass the test suite.
+	// Then remove all the stock comments.
+	// They're here to help you get started but they only clutter a finished solution.
+	// If you leave them in, reviewers may protest!
+	return t
+}

data/tracks/go/exercises/gigasecond/gigasecond_test.go

@@ -8,20 +8,12 @@ import (
 	"time"
 )
 
-const targetTestVersion = 4
-
 // date formats used in test data
 const (
 	fmtD  = "2006-01-02"
 	fmtDT = "2006-01-02T15:04:05"
 )
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestAddGigasecond(t *testing.T) {
 	for _, tc := range addCases {
 		in := parse(tc.in, t)

data/tracks/go/exercises/grade-school/example.go

@@ -2,8 +2,6 @@ package school
 
 import "sort"
 
-const testVersion = 1
-
 type School map[int][]string
 
 func New() *School {

data/tracks/go/exercises/grade-school/grade_school_test.go

@@ -19,14 +19,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestNewSchoolIsEmpty(t *testing.T) {
 	if len(New().Enrollment()) != 0 {
 		t.Error("New school not empty")

data/tracks/go/exercises/grains/example.go

@@ -4,8 +4,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 1
-
 // Square returns the number of grains on a square on a chess board where the
 // first square has 1 and every subsequent square doubles the number.
 func Square(num int) (uint64, error) {

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

@@ -4,8 +4,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var squareTests = []struct {
 	input       int
 	expectedVal uint64
@@ -23,12 +21,6 @@ var squareTests = []struct {
 	{-1, 0, true},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestSquare(t *testing.T) {
 	for _, test := range squareTests {
 		actualVal, actualErr := Square(test.input)

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

@@ -0,0 +1,4 @@
+You may be wondering about the `cases_test.go` file. We explain it in the
+[leap exercise][leap-exercise-readme].
+
+[leap-exercise-readme]: https://github.com/exercism/go/blob/master/exercises/leap/README.md 

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

@@ -35,6 +35,12 @@ The Hamming distance is only defined for sequences of equal length. This means
 that based on the definition, each language could deal with getting sequences
 of equal length differently.
 
+You may be wondering about the `cases_test.go` file. We explain it in the
+[leap exercise][leap-exercise-readme].
+
+[leap-exercise-readme]: https://github.com/exercism/go/blob/master/exercises/leap/README.md 
+
+
 ## Running the tests
 
 To run the tests run the command `go test` from within the exercise directory.

data/tracks/go/exercises/hamming/example.go

@@ -2,8 +2,6 @@ package hamming
 
 import "errors"
 
-const testVersion = 6
-
 func Distance(a, b string) (d int, err error) {
 	if len(b) != len(a) {
 		return 0, errors.New("strings of unequal length")

data/tracks/go/exercises/hamming/hamming.go

@@ -1,6 +1,4 @@
 package hamming
 
-const testVersion = 6
-
 func Distance(a, b string) (int, error) {
 }

data/tracks/go/exercises/hamming/hamming_test.go

@@ -2,14 +2,6 @@ package hamming
 
 import "testing"
 
-const targetTestVersion = 6
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestHamming(t *testing.T) {
 	for _, tc := range testCases {
 		got, err := Distance(tc.s1, tc.s2)

data/tracks/go/exercises/hello-world/hello_world.go

@@ -1,7 +1,15 @@
+// This is a "stub" file.  It's a little start on your solution.
+// It's not a complete solution though; you have to write some code.
+
+// Package greeting should have a package comment that summarizes what it's about.
+// https://golang.org/doc/effective_go.html#commentary
 package greeting
 
+// HelloWorld should have a comment documenting it.
 func HelloWorld() string {
 	// Write some code here to pass the test suite.
-	// Then delete this comment stub.
+	// Then remove all the stock comments.
+	// They're here to help you get started but they only clutter a finished solution.
+	// If you leave them in, reviewers may protest!
 	return ""
 }

data/tracks/go/exercises/hexadecimal/example.go

@@ -8,8 +8,6 @@ import (
 	"math"
 )
 
-const testVersion = 1
-
 // ErrRange indicates that a value is out of range for the target type.
 var ErrRange = errors.New("value out of range")
 

data/tracks/go/exercises/hexadecimal/hexadecimal_test.go

@@ -15,8 +15,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var testCases = []struct {
 	in      string
 	out     int64
@@ -35,12 +33,6 @@ var testCases = []struct {
 	{"9223372036854775809", 0, "range"},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestParseHex(t *testing.T) {
 	for _, test := range testCases {
 		out, err := ParseHex(test.in)

data/tracks/go/exercises/house/example.go

@@ -1,7 +1,5 @@
 package house
 
-const testVersion = 1
-
 var songLines = []string{
 	"the horse and the hound and the horn\nthat belonged to",
 	"the farmer sowing his corn\nthat kept",

data/tracks/go/exercises/house/house_test.go

@@ -15,8 +15,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var (
 	// song copied from README
 	expectedSong = `This is the house that Jack built.
@@ -112,12 +110,6 @@ that lay in the house that Jack built.`
 	expectedVerses = strings.Split(expectedSong, "\n\n")
 )
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestVerse(t *testing.T) {
 	for v := 0; v < len(expectedVerses); v++ {
 		if ret := Verse(v + 1); ret != expectedVerses[v] {

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

@@ -0,0 +1,60 @@
+# Isbn Verifier
+
+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'.
+
+## Bonus tasks
+
+* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier)
+
+* Generate valid ISBN, maybe even from a given starting ISBN
+## 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
+
+Converting a string into a number and some basic processing utilizing a relatable real world example. [https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation](https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation)
+
+## 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/isbn-verifier/example.go

@@ -0,0 +1,57 @@
+package isbn
+
+import (
+	"errors"
+	"math"
+	"strconv"
+	"unicode"
+)
+
+func IsValidISBN(isbn string) bool {
+
+	isbn = dropHyphen(isbn)
+
+	ary, err := strToSlice(isbn)
+	if len(ary) != 10 || err != nil {
+		return false
+	}
+
+	return calcCheckDigit(ary)
+}
+
+func dropHyphen(isbn string) string {
+	var result string
+	for _, char := range isbn {
+		if char == '-' {
+			continue
+		}
+		result += string(char)
+	}
+	return result
+}
+
+func strToSlice(isbn string) (result []int, err error) {
+
+	for _, char := range isbn {
+		if unicode.IsLetter(char) && char != 'X' {
+			err = errors.New("invalid character")
+			return
+		} else if char == 'X' {
+			result = append(result, 10)
+		} else {
+			i, _ := strconv.Atoi(string(char))
+			result = append(result, i)
+		}
+	}
+	return
+}
+
+func calcCheckDigit(isbn []int) bool {
+	var pool int
+	for idx, value := range isbn {
+		pool += int(math.Abs(float64(idx)-10)) * value
+	}
+	result := pool % 11
+
+	return result == 0
+}