trackler 2.2.1.56 → 2.2.1.57

data/tracks/go/exercises/sublist/example.go

@@ -0,0 +1,49 @@
+package sublist
+
+import "reflect"
+
+// Relation is the comparison between lists
+type Relation string
+
+// Possible relations
+const (
+	RelationEqual     Relation = "equal"
+	RelationSublist   Relation = "sublist"
+	RelationSuperlist Relation = "superlist"
+	RelationUnequal   Relation = "unequal"
+)
+
+// Sublist checks difference of two lists and
+// returns equal, sublist, superlist or unequal according
+// to their relation to each other.
+func Sublist(l1, l2 []int) Relation {
+	if reflect.DeepEqual(l1, l2) {
+		return RelationEqual
+	} else if contains(l1, l2) {
+		return RelationSuperlist
+	} else if contains(l2, l1) {
+		return RelationSublist
+	}
+	return RelationUnequal
+}
+
+func contains(l1, l2 []int) bool {
+	if len(l2) == 0 {
+		return true
+	} else if len(l2) > len(l1) {
+		return false
+	}
+	for i := 0; i <= len(l1)-len(l2); i++ {
+		if l1[i] != l2[0] {
+			continue
+		}
+		rest := true
+		for j, e := range l2 {
+			rest = rest && l1[i+j] == e
+		}
+		if rest {
+			return true
+		}
+	}
+	return false
+}

data/tracks/go/exercises/sublist/sublist_test.go

@@ -0,0 +1,22 @@
+package sublist
+
+import (
+	"testing"
+)
+
+func TestSublist(t *testing.T) {
+	for _, tc := range testCases {
+		if actual := Sublist(tc.listOne, tc.listTwo); actual != tc.expected {
+			t.Fatalf("FAIL: %s\nExpected: %#v\nActual: %#v", tc.description, tc.expected, actual)
+		}
+		t.Logf("PASS: %s", tc.description)
+	}
+}
+
+func BenchmarkSublist(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range testCases {
+			Sublist(tc.listOne, tc.listTwo)
+		}
+	}
+}

data/tracks/go/exercises/sum-of-multiples/cases_test.go

@@ -1,8 +1,8 @@
 package summultiples
 
-// Source: exercism/x-common
-// Commit: 72b1496 sum-of-multiples: Fix canonical-data.json formatting
-// x-common version: 1.0.0
+// Source: exercism/problem-specifications
+// Commit: df076b2 sum-of-multiples: Add up to 7 test case (#896)
+// Problem Specifications Version: 1.1.0
 
 var varTests = []struct {
 	divisors []int
@@ -11,6 +11,7 @@ var varTests = []struct {
 }{
 	{[]int{3, 5}, 1, 0},             // multiples of 3 or 5 up to 1
 	{[]int{3, 5}, 4, 3},             // multiples of 3 or 5 up to 4
+	{[]int{3}, 7, 9},                // multiples of 3 up to 7
 	{[]int{3, 5}, 10, 23},           // multiples of 3 or 5 up to 10
 	{[]int{3, 5}, 100, 2318},        // multiples of 3 or 5 up to 100
 	{[]int{3, 5}, 1000, 233168},     // multiples of 3 or 5 up to 1000

data/tracks/go/exercises/sum-of-multiples/example.go

@@ -1,7 +1,5 @@
 package summultiples
 
-const testVersion = 2
-
 // SumMultiples returns the sum of the multiples of the given divisors
 // up to, but not including, the given limit.
 func SumMultiples(limit int, divisors ...int) (sum int) {

data/tracks/go/exercises/sum-of-multiples/sum_of_multiples_test.go

@@ -2,14 +2,6 @@ package summultiples
 
 import "testing"
 
-const targetTestVersion = 2
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestSumMultiples(t *testing.T) {
 	for _, test := range varTests {
 		s := SumMultiples(test.limit, test.divisors...)

data/tracks/go/exercises/tournament/example.go

@@ -7,8 +7,6 @@ import (
 	"sort"
 )
 
-const testVersion = 4
-
 type outcome int
 
 const (

data/tracks/go/exercises/tournament/tournament_test.go

@@ -11,11 +11,6 @@ import (
 //
 // Note that unlike other tracks the Go version of the tally function
 // should not ignore errors. It's not idiomatic Go to ignore errors.
-//
-// Also define a testVersion with a value that matches
-// the targetTestVersion here.
-
-const targetTestVersion = 4
 
 var _ func(io.Reader, io.Writer) error = Tally
 
@@ -110,12 +105,6 @@ var errorTestCases = []string{
 	"Devastating Donkeys;Allegoric Alaskians;dra",
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestTallyHappy(t *testing.T) {
 	for _, tt := range happyTestCases {
 		reader := strings.NewReader(tt.input)

data/tracks/go/exercises/transpose/cases_test.go

@@ -1,8 +1,8 @@
 package transpose
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 6dba022 transpose: 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/transpose/example.go

@@ -1,7 +1,5 @@
 package transpose
 
-const testVersion = 1
-
 func Transpose(m []string) []string {
 	max := maxLen(m)
 	t := make([]string, max)

data/tracks/go/exercises/transpose/transpose_test.go

@@ -5,14 +5,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestTranspose(t *testing.T) {
 	for _, test := range testCases {
 		actual := Transpose(test.input)

data/tracks/go/exercises/tree-building/example.go

@@ -5,8 +5,6 @@ import (
 	"sort"
 )
 
-const testVersion = 4
-
 type Record struct {
 	ID, Parent int
 }

data/tracks/go/exercises/tree-building/tree_building.go

@@ -5,8 +5,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 4
-
 type Record struct {
 	ID, Parent int
 }

data/tracks/go/exercises/tree-building/tree_test.go

@@ -10,11 +10,6 @@ import (
 // Define a function Build(records []Record) (*Node, error)
 // where Record is a struct containing int fields ID and Parent
 // and Node is a struct containing int field ID and []*Node field Children.
-//
-// Also define a testVersion with a value that matches
-// the targetTestVersion here.
-
-const targetTestVersion = 4
 
 var successTestCases = []struct {
 	name     string
@@ -210,12 +205,6 @@ func (n Node) String() string {
 	return fmt.Sprintf("%d:%s", n.ID, n.Children)
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestMakeTreeSuccess(t *testing.T) {
 	for _, tt := range successTestCases {
 		actual, err := Build(tt.input)

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

@@ -0,0 +1,10 @@
+## Constant Declarations
+
+In this exercise you are asked to declare a series of constants used to identify
+different types of triangles. Pick the data type you think works best for this
+and get the tests passing.
+
+Afterwards, it may be worth reading about Go's
+predeclared identifier [iota](https://golang.org/ref/spec#Iota). There's an
+excellent write up about it
+[here](https://splice.com/blog/iota-elegant-constants-golang/).

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

@@ -4,8 +4,6 @@ import "math"
 
 type Kind string
 
-const testVersion = 3
-
 const (
 	Equ Kind = "equilateral"
 	Iso      = "isosceles"

data/tracks/go/exercises/triangle/triangle.go

@@ -1,16 +1,28 @@
-package triangle
+// 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.
 
-const testVersion = 3
+// Package twofer should have a package comment that summarizes what it's about.
+// https://golang.org/doc/effective_go.html#commentary
+package triangle
 
-func KindFromSides(a, b, c float64) Kind
 
 // Notice KindFromSides() returns this type. Pick a suitable data type.
 type Kind
 
-// Pick values for the following identifiers used by the test program.
-NaT // not a triangle
-Equ // equilateral
-Iso // isosceles
-Sca // scalene
+const (
+    // Pick values for the following identifiers used by the test program.
+    NaT // not a triangle
+    Equ // equilateral
+    Iso // isosceles
+    Sca // scalene
+)
 
-// Organize your code for readability.
+// ShareWith should have a comment documenting it.
+func KindFromSides(a, b, c float64) Kind {
+	// 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!
+	var k Kind
+	return k
+}

data/tracks/go/exercises/triangle/triangle_test.go

@@ -5,8 +5,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 3
-
 type testCase struct {
 	want    Kind
 	a, b, c float64
@@ -53,12 +51,6 @@ func init() {
 	testData = append(testData, nf[1:]...)
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 // Test that the kinds are not equal to each other.
 // If they are equal, then TestKind will return false positives.
 func TestKindsNotEqual(t *testing.T) {

data/tracks/go/exercises/trinary/example.go

@@ -5,8 +5,6 @@ import (
 	"math"
 )
 
-const testVersion = 1
-
 func ParseTrinary(s string) (int64, error) {
 	const third = math.MaxInt64 / 3
 	overflow := false

data/tracks/go/exercises/trinary/trinary_test.go

@@ -2,8 +2,6 @@ package trinary
 
 import "testing"
 
-const targetTestVersion = 1
-
 var tests = []struct {
 	arg  string
 	want int64
@@ -20,12 +18,6 @@ var tests = []struct {
 	{"2021110011022210012102010021220101220222", 0, false},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestParseTrinary(t *testing.T) {
 	for _, test := range tests {
 		switch res, err := ParseTrinary(test.arg); {

data/tracks/go/exercises/twelve-days/example.go

@@ -4,8 +4,6 @@ import (
 	"fmt"
 )
 
-const testVersion = 1
-
 var verse = map[string]string{
 	"first":    "a Partridge in a Pear Tree.",
 	"twelfth":  "twelve Drummers Drumming",

data/tracks/go/exercises/twelve-days/twelve_days_test.go

@@ -6,8 +6,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 type testCase struct {
 	input    int
 	expected string
@@ -52,12 +50,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 TestSong(t *testing.T) {
 	var expected = ""
 	for _, test := range testCases {

data/tracks/go/exercises/two-fer/two_fer.go

@@ -5,11 +5,11 @@
 // https://golang.org/doc/effective_go.html#commentary
 package twofer
 
-// ShareWith needs a comment documenting it.
+// ShareWith should have a comment documenting it.
 func ShareWith(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 will protest!
+	// If you leave them in, reviewers may protest!
 	return ""
 }

data/tracks/go/exercises/variable-length-quantity/cases_test.go

@@ -1,8 +1,8 @@
 package variablelengthquantity
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: d6a62f7 variable-length-quantity: Fix canonical-data.json formatting
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 // Encode a series of integers, producing a series of bytes.
 var encodeTestCases = []struct {

data/tracks/go/exercises/variable-length-quantity/example.go

@@ -2,8 +2,6 @@ package variablelengthquantity
 
 import "errors"
 
-const testVersion = 4
-
 var ErrUnterminatedSequence = errors.New("unterminated sequence")
 
 // encodeInt returns the varint encoding of x.

data/tracks/go/exercises/variable-length-quantity/variable_length_quantity_test.go

@@ -6,14 +6,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 4
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestDecodeVarint(t *testing.T) {
 	for i, tc := range decodeTestCases {
 		o, err := DecodeVarint(tc.input)

data/tracks/go/exercises/word-count/cases_test.go

@@ -1,8 +1,8 @@
 package wordcount
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: cd26d49 word-count: Make exercise schema-compliant  (#634)
-// x-common version: 1.0.0
+// Problem Specifications Version: 1.0.0
 
 var testCases = []struct {
 	description string