trackler 2.2.1.56 → 2.2.1.57

data/tracks/go/exercises/anagram/example.go

@@ -5,8 +5,6 @@ import (
 	"strings"
 )
 
-const testVersion = 2
-
 func Detect(subject string, candidates []string) []string {
 	subject = strings.ToLower(subject)
 	var matches []string

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

@@ -2,14 +2,6 @@ package atbash
 
 import "testing"
 
-const targetTestVersion = 2
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestAtbash(t *testing.T) {
 	for _, test := range tests {
 		actual := Atbash(test.s)

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

@@ -1,8 +1,8 @@
 package atbash
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: bb4f220 atbash-cipher: Fix canonical-data.json formatting
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 type atbashTest struct {
 	s        string

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

@@ -5,8 +5,6 @@ import (
 	"strings"
 )
 
-const testVersion = 2
-
 var alphabet = "abcdefghijklmnopqrstuvwxyz"
 
 func Atbash(s string) string {

data/tracks/go/exercises/bank-account/bank_account_test.go

@@ -34,14 +34,6 @@ import (
 	"time"
 )
 
-const targetTestVersion = 1
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestSeqOpenBalanceClose(t *testing.T) {
 	// open account
 	const amt = 10

data/tracks/go/exercises/bank-account/example.go

@@ -2,8 +2,6 @@ package account
 
 import "sync"
 
-const testVersion = 1
-
 type Account struct {
 	sync.RWMutex
 	open    bool

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

@@ -4,8 +4,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 const verse8 = "8 bottles of beer on the wall, 8 bottles of beer.\nTake one down and pass it around, 7 bottles of beer on the wall.\n"
 const verse3 = "3 bottles of beer on the wall, 3 bottles of beer.\nTake one down and pass it around, 2 bottles of beer on the wall.\n"
 const verse2 = "2 bottles of beer on the wall, 2 bottles of beer.\nTake one down and pass it around, 1 bottle of beer on the wall.\n"
@@ -48,12 +46,6 @@ var verseTestCases = []struct {
 	{"invalid verse", 104, "", true},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestBottlesVerse(t *testing.T) {
 	for _, tt := range verseTestCases {
 		actualVerse, err := Verse(tt.verse)

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

@@ -5,8 +5,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 1
-
 // Song returns the full lyrics for 99 bottles of beer
 func Song() (result string) {
 	result, _ = Verses(99, 0)

data/tracks/go/exercises/binary-search-tree/binary_search_tree_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 TestDataIsRetained(t *testing.T) {
 	actual := Bst(4).data
 	expected := 4

data/tracks/go/exercises/binary-search-tree/example.go

@@ -1,7 +1,5 @@
 package binarysearchtree
 
-const testVersion = 1
-
 type SearchTreeData struct {
 	left  *SearchTreeData
 	data  int

data/tracks/go/exercises/binary-search/binary_search_test.go

@@ -25,8 +25,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 var testData = []struct {
 	ref   string
 	slice []int
@@ -86,12 +84,6 @@ var testData = []struct {
 		nil, 0, 0},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestSearchInts(t *testing.T) {
 	for _, test := range testData {
 		if !sort.IntsAreSorted(test.slice) {

data/tracks/go/exercises/binary-search/example.go

@@ -2,8 +2,6 @@ package binarysearch
 
 import "fmt"
 
-const testVersion = 1
-
 func SearchInts(s []int, k int) (i int) {
 	for j := len(s); i < j; {
 		if h := (i + j) / 2; s[h] < k {

data/tracks/go/exercises/binary/binary_test.go

@@ -13,11 +13,6 @@ import (
 // For invalid inputs, return an error that signals to the user why the error happened.
 // The test cases can only check that you return *some* error,
 // but it's still good practice to return useful errors.
-//
-// Also define a testVersion with a value that matches
-// the targetTestVersion here.
-
-const targetTestVersion = 2
 
 var testCases = []struct {
 	binary   string
@@ -38,12 +33,6 @@ var testCases = []struct {
 	{"22", 0, false},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestParseBinary(t *testing.T) {
 	for _, tt := range testCases {
 		actual, err := ParseBinary(tt.binary)

data/tracks/go/exercises/binary/example.go

@@ -4,8 +4,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 2
-
 // ParseBinary converts a binary string to an integer value
 func ParseBinary(bin string) (int, error) {
 	val := 0

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

@@ -1,3 +1,17 @@
+// 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 bob should have a package comment that summarizes what it's about.
+// https://golang.org/doc/effective_go.html#commentary
 package bob
 
 const testVersion = 3
+
+// Hey should have a comment documenting it.
+func Hey(remark string) string {
+	// 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 ""
+}

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

@@ -2,15 +2,7 @@ package bob
 
 import "testing"
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
-func TestHeyBob(t *testing.T) {
+func TestHey(t *testing.T) {
 	for _, tt := range testCases {
 		actual := Hey(tt.input)
 		if actual != tt.expected {
@@ -24,7 +16,7 @@ func TestHeyBob(t *testing.T) {
 	}
 }
 
-func BenchmarkBob(b *testing.B) {
+func BenchmarkHey(b *testing.B) {
 	for _, tt := range testCases {
 		for i := 0; i < b.N; i++ {
 			Hey(tt.input)

data/tracks/go/exercises/bob/cases_test.go

@@ -1,8 +1,8 @@
 package bob
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 65756b1 bob: Fix canonical-data.json formatting
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 var testCases = []struct {
 	description string

data/tracks/go/exercises/bob/example.go

@@ -2,29 +2,28 @@ package bob
 
 import "strings"
 
-const testVersion = 3
-
-func Hey(drivel string) string {
-	switch drivel = strings.TrimSpace(drivel); {
-	case silent(drivel):
+// Hey returns Bob's responses to a given remark.
+func Hey(remark string) string {
+	switch remark = strings.TrimSpace(remark); {
+	case silent(remark):
 		return "Fine. Be that way!"
-	case yelling(drivel):
+	case yelling(remark):
 		return "Whoa, chill out!"
-	case asking(drivel):
+	case asking(remark):
 		return "Sure."
 	default:
 		return "Whatever."
 	}
 }
 
-func yelling(drivel string) bool {
-	return strings.ToUpper(drivel) == drivel && strings.ToLower(drivel) != strings.ToUpper(drivel)
+func yelling(remark string) bool {
+	return strings.ToUpper(remark) == remark && strings.ToLower(remark) != strings.ToUpper(remark)
 }
 
-func asking(drivel string) bool {
-	return strings.HasSuffix(drivel, "?")
+func asking(remark string) bool {
+	return strings.HasSuffix(remark, "?")
 }
 
-func silent(drivel string) bool {
-	return drivel == ""
+func silent(remark string) bool {
+	return remark == ""
 }

data/tracks/go/exercises/book-store/README.md

@@ -0,0 +1,92 @@
+# Book Store
+
+To try and encourage more sales of different books from a popular 5 book
+series, a bookshop has decided to offer discounts on multiple book purchases.
+
+One copy of any of the five books costs $8.
+
+If, however, you buy two different books, you get a 5%
+discount on those two books.
+
+If you buy 3 different books, you get a 10% discount.
+
+If you buy 4 different books, you get a 20% discount.
+
+If you buy all 5, you get a 25% discount.
+
+Note: that if you buy four books, of which 3 are
+different titles, you get a 10% discount on the 3 that
+form part of a set, but the fourth book still costs $8.
+
+Your mission is to write a piece of code to calculate the
+price of any conceivable shopping basket (containing only
+books of the same series), giving as big a discount as
+possible.
+
+For example, how much does this basket of books cost?
+
+- 2 copies of the first book
+- 2 copies of the second book
+- 2 copies of the third book
+- 1 copy of the fourth book
+- 1 copy of the fifth book
+
+One way of grouping these 8 books is:
+
+- 1 group of 5 --> 25% discount (1st,2nd,3rd,4th,5th)
+- +1 group of 3 --> 10% discount (1st,2nd,3rd)
+
+This would give a total of:
+
+- 5 books at a 25% discount
+- +3 books at a 10% discount
+
+Resulting in:
+
+- 5 x (8 - 2.00) == 5 x 6.00 == $30.00
+- +3 x (8 - 0.80) == 3 x 7.20 == $21.60
+
+For a total of $51.60
+
+However, a different way to group these 8 books is:
+
+- 1 group of 4 books --> 20% discount  (1st,2nd,3rd,4th)
+- +1 group of 4 books --> 20% discount  (1st,2nd,3rd,5th)
+
+This would give a total of:
+
+- 4 books at a 20% discount
+- +4 books at a 20% discount
+
+Resulting in:
+
+- 4 x (8 - 1.60) == 4 x 6.40 == $25.60
+- +4 x (8 - 1.60) == 4 x 6.40 == $25.60
+
+For a total of $51.20
+
+And $51.20 is the price with the biggest discount.
+
+## 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
+
+[Inspired by the harry potter kata from Cyber-Dojo](http://cyber-dojo.org).
+
+## 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/book-store/book_store_test.go

@@ -0,0 +1,91 @@
+package bookstore
+
+import (
+	"testing"
+)
+
+var testCases = []struct {
+	description string
+	basket      []int
+	expected    float64
+}{
+	{
+		description: "only a single book",
+		basket:      []int{1},
+		expected:    8.00,
+	},
+	{
+		description: "two of the same book",
+		basket:      []int{2, 2},
+		expected:    16.00,
+	},
+	{
+		description: "empty basket",
+		basket:      []int{},
+		expected:    0.00,
+	},
+	{
+		description: "two different books",
+		basket:      []int{1, 2},
+		expected:    15.20,
+	},
+	{
+		description: "four different books",
+		basket:      []int{1, 2, 3, 4},
+		expected:    25.60,
+	},
+	{
+		description: "five different books",
+		basket:      []int{1, 2, 3, 4, 5},
+		expected:    30.00,
+	},
+	{
+		description: "two groups of four is cheaper than group of five plus group of three",
+		basket:      []int{1, 1, 2, 2, 3, 3, 4, 5},
+		expected:    51.20,
+	},
+	{
+		description: "groups of four plus group of two is is cheaper than two groups of three",
+		basket:      []int{1, 1, 2, 2, 3, 4},
+		expected:    40.80,
+	},
+	{
+		description: "two each of first 4 books and 1 copy of each of rest",
+		basket:      []int{1, 1, 2, 2, 3, 3, 4, 4, 5},
+		expected:    55.60,
+	},
+	{
+		description: "two copies of each book",
+		basket:      []int{1, 1, 2, 2, 3, 3, 4, 4, 5, 5},
+		expected:    60.00,
+	},
+	{
+		description: "three copies of first book and 2 each fo remaining",
+		basket:      []int{1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 1},
+		expected:    68.00,
+	},
+	{
+		description: "three each of first 2 books and 2 each of remaining books",
+		basket:      []int{1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 1, 2},
+		expected:    75.20,
+	},
+}
+
+func TestCost(t *testing.T) {
+	for _, testCase := range testCases {
+		cost := Cost(testCase.basket)
+		if testCase.expected != cost {
+			t.Fatalf("FAIL: %s\n\tCost(%v) expected %v, got %v",
+				testCase.description, testCase.basket, testCase.expected, cost)
+		}
+		t.Logf("PASS: %s", testCase.description)
+	}
+}
+
+func BenchmarkCost(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, testCase := range testCases {
+			Cost(testCase.basket)
+		}
+	}
+}