trackler 2.2.1.56 → 2.2.1.57

data/tracks/go/exercises/connect/connect_test.go

@@ -15,14 +15,6 @@ func prepare(lines []string) []string {
 	return newLines
 }
 
-const targetTestVersion = 3
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestResultOf(t *testing.T) {
 	for _, tt := range testCases {
 		actual, err := ResultOf(prepare(tt.board))

data/tracks/go/exercises/connect/example.go

@@ -6,8 +6,6 @@ import (
 	"strings"
 )
 
-const testVersion = 3
-
 const (
 	white = 1 << iota
 	black

data/tracks/go/exercises/crypto-square/crypto_square_test.go

@@ -2,8 +2,6 @@ package cryptosquare
 
 import "testing"
 
-const targetTestVersion = 2
-
 var tests = []struct {
 	pt string // plain text
 	ct string // cipher text
@@ -86,12 +84,6 @@ var tests = []struct {
 	},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestEncode(t *testing.T) {
 	for _, test := range tests {
 		if ct := Encode(test.pt); ct != test.ct {

data/tracks/go/exercises/crypto-square/example.go

@@ -5,8 +5,6 @@ import (
 	"strings"
 )
 
-const testVersion = 2
-
 func norm(r rune) rune {
 	switch {
 	case r >= 'a' && r <= 'z' || r >= '0' && r <= '9':

data/tracks/go/exercises/custom-set/cases_test.go

@@ -1,8 +1,8 @@
 package stringset
 
-// Source: exercism/x-common
+// Source: exercism/problem-specifications
 // Commit: 4527635 custom-set: Fix description to match property name
-// x-common version: 1.0.1
+// Problem Specifications Version: 1.0.1
 
 // Returns true if the set contains no elements
 var emptyCases = []unaryBoolCase{

data/tracks/go/exercises/custom-set/custom_set_test.go

@@ -28,14 +28,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 4
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 // A first set of tests uses Set.String() to judge correctness.
 
 func TestNew(t *testing.T) {

data/tracks/go/exercises/custom-set/example.go

@@ -4,8 +4,6 @@ package stringset
 
 import "fmt"
 
-const testVersion = 4
-
 // Set represents some properties of a mathematical set.
 // Sets are finite and all elements are unique string values.
 type Set map[string]bool

data/tracks/go/exercises/custom-set/example_slice.go

@@ -10,8 +10,6 @@ package stringset
 
 import "fmt"
 
-const testVersion = 4
-
 // Set represents some properties of a mathematical set.
 // Sets are finite and all elements are unique string values.
 type Set struct {

data/tracks/go/exercises/diamond/diamond_test.go

@@ -9,8 +9,6 @@ import (
 	"time"
 )
 
-const targetTestVersion = 1
-
 var config = &quick.Config{Rand: rand.New(rand.NewSource(time.Now().UnixNano()))}
 
 type correctChar byte
@@ -40,12 +38,6 @@ func checkCorrect(requirement func(byte, []string) bool, keepSeparator bool, t *
 	}
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}
-
 func TestFirstRowContainsOneA(t *testing.T) {
 	requirement := func(char byte, rows []string) bool {
 		return len(rows) > 0 && strings.Count(rows[0], "A") == 1

data/tracks/go/exercises/diamond/example.go

@@ -5,8 +5,6 @@ import (
 	"strings"
 )
 
-const testVersion = 1
-
 const startIndex = 'A'
 
 // Gen builds a diamond

data/tracks/go/exercises/difference-of-squares/difference_of_squares_test.go

@@ -2,20 +2,12 @@ package diffsquares
 
 import "testing"
 
-const targetTestVersion = 1
-
 var tests = []struct{ n, sqOfSums, sumOfSq int }{
 	{5, 225, 55},
 	{10, 3025, 385},
 	{100, 25502500, 338350},
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestSquareOfSums(t *testing.T) {
 	for _, test := range tests {
 		if s := SquareOfSums(test.n); s != test.sqOfSums {

data/tracks/go/exercises/difference-of-squares/example.go

@@ -1,7 +1,5 @@
 package diffsquares
 
-const testVersion = 1
-
 func SquareOfSums(n int) int {
 	s := 0
 	for i := 0; i <= n; i++ {

data/tracks/go/exercises/diffie-hellman/diffie_hellman_test.go

@@ -14,8 +14,6 @@ import (
 	"testing"
 )
 
-const targetTestVersion = 1
-
 type testCase struct {
 	g    int64    // prime, generator
 	p    *big.Int // prime, modulus
@@ -80,12 +78,6 @@ var tests = []testCase{
 
 var _one = big.NewInt(1)
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 // test that PrivateKey returns numbers in range, returns different numbers.
 func TestPrivateKey(t *testing.T) {
 	priv := func(p *big.Int) *big.Int {

data/tracks/go/exercises/diffie-hellman/example.go

@@ -6,8 +6,6 @@ import (
 	"time"
 )
 
-const testVersion = 1
-
 var r = rand.New(rand.NewSource(time.Now().Unix()))
 var two = big.NewInt(2)
 

data/tracks/go/exercises/error-handling/error_handling_test.go

@@ -6,7 +6,6 @@ import (
 )
 
 // Please review the README for this exercise carefully before implementation.
-const targetTestVersion = 2
 
 // Little helper to let us customize behaviour of the resource on a per-test
 // basis.
@@ -20,12 +19,6 @@ func (mr mockResource) Close() error      { return mr.close() }
 func (mr mockResource) Frob(input string) { mr.frob(input) }
 func (mr mockResource) Defrob(tag string) { mr.defrob(tag) }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 // Use should not return an error on the "happy" path.
 func TestNoErrors(t *testing.T) {
 	var frobInput string

data/tracks/go/exercises/error-handling/example.go

@@ -1,7 +1,5 @@
 package erratum
 
-const testVersion = 2
-
 func Use(opener ResourceOpener, input string) (err error) {
 	var r Resource
 	for {

data/tracks/go/exercises/etl/etl_test.go

@@ -2,8 +2,6 @@ package etl
 
 import "testing"
 
-const targetTestVersion = 1
-
 type given map[int][]string
 type expectation map[string]int
 
@@ -69,12 +67,6 @@ func equal(actual map[string]int, expectation map[string]int) bool {
 	return true
 }
 
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
-	}
-}
-
 func TestTransform(t *testing.T) {
 	for _, tt := range transformTests {
 		actual := Transform(map[int][]string(tt.input))

data/tracks/go/exercises/etl/example.go

@@ -2,8 +2,6 @@ package etl
 
 import "strings"
 
-const testVersion = 1
-
 type legacy map[int][]string
 
 func Transform(in legacy) (out map[string]int) {

data/tracks/go/exercises/flatten-array/.meta/gen.go

@@ -0,0 +1,52 @@
+package main
+
+import (
+	"log"
+	"text/template"
+
+	"../../../gen"
+)
+
+func main() {
+	t, err := template.New("").Parse(tmpl)
+	if err != nil {
+		log.Fatal(err)
+	}
+	var j js
+	if err := gen.Gen("flatten-array", &j, t); err != nil {
+		log.Fatal(err)
+	}
+}
+
+// The JSON structure we expect to be able to unmarshal into
+type js struct {
+	Exercise string
+	Version  string
+	Cases    []oneCase
+}
+
+// Test cases
+type oneCase struct {
+	Description string
+	Property    string
+	Input       interface{}
+	Expected    []interface{}
+}
+
+// Template to generate test cases.
+var tmpl = `package flatten
+
+{{.Header}}
+
+var testCases = []struct {
+	description	string
+	input		interface{}
+	expected	[]interface{}
+}{ {{range .J.Cases}}
+{
+	description:	{{printf "%q"  .Description}},
+	input:		{{printf "%#v"  .Input}},
+	expected:	{{printf "%#v"  .Expected}},
+},{{end}}
+}
+`

data/tracks/go/exercises/flatten-array/README.md

@@ -0,0 +1,35 @@
+# Flatten Array
+
+Take a nested list and return a single flattened list with all values except nil/null.
+
+The challenge is to write a function that accepts an arbitrarily-deep nested list-like structure and returns a flattened structure without any nil/null values.
+
+For Example
+
+input: [1,[2,3,null,4],[null],5]
+
+output: [1,2,3,4,5]
+
+## 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
+
+Interview Question [https://reference.wolfram.com/language/ref/Flatten.html](https://reference.wolfram.com/language/ref/Flatten.html)
+
+## 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/flatten-array/cases_test.go

@@ -0,0 +1,42 @@
+package flatten
+
+// Source: exercism/problem-specifications
+// Commit: d7a3c09 flatten-array: Add test case for no nesting (#744)
+// Problem Specifications Version: 1.1.0
+
+var testCases = []struct {
+	description string
+	input       interface{}
+	expected    []interface{}
+}{
+	{
+		description: "no nesting",
+		input:       []interface{}{0, 1, 2},
+		expected:    []interface{}{0, 1, 2},
+	},
+	{
+		description: "flattens array with just integers present",
+		input:       []interface{}{1, []interface{}{2, 3, 4, 5, 6, 7}, 8},
+		expected:    []interface{}{1, 2, 3, 4, 5, 6, 7, 8},
+	},
+	{
+		description: "5 level nesting",
+		input:       []interface{}{0, 2, []interface{}{[]interface{}{2, 3}, 8, 100, 4, []interface{}{[]interface{}{[]interface{}{50}}}}, -2},
+		expected:    []interface{}{0, 2, 2, 3, 8, 100, 4, 50, -2},
+	},
+	{
+		description: "6 level nesting",
+		input:       []interface{}{1, []interface{}{2, []interface{}{[]interface{}{3}}, []interface{}{4, []interface{}{[]interface{}{5}}}, 6, 7}, 8},
+		expected:    []interface{}{1, 2, 3, 4, 5, 6, 7, 8},
+	},
+	{
+		description: "6 level nest list with null values",
+		input:       []interface{}{0, 2, []interface{}{[]interface{}{2, 3}, 8, []interface{}{[]interface{}{100}}, interface{}(nil), []interface{}{[]interface{}{interface{}(nil)}}}, -2},
+		expected:    []interface{}{0, 2, 2, 3, 8, 100, -2},
+	},
+	{
+		description: "all values in nested list are null",
+		input:       []interface{}{interface{}(nil), []interface{}{[]interface{}{[]interface{}{interface{}(nil)}}}, interface{}(nil), interface{}(nil), []interface{}{[]interface{}{interface{}(nil), interface{}(nil)}, interface{}(nil)}, interface{}(nil)},
+		expected:    []interface{}{},
+	},
+}

data/tracks/go/exercises/flatten-array/example.go

@@ -0,0 +1,25 @@
+package flatten
+
+import "reflect"
+
+// Flatten recursively flattens slices and ignores nil values
+func Flatten(nested interface{}) []interface{} {
+	flattened := []interface{}{}
+	nestedSlice, ok := nested.([]interface{})
+	if !ok {
+		return flattened
+	}
+	for _, e := range nestedSlice {
+		t := reflect.TypeOf(e)
+		if t == nil {
+			continue
+		}
+		switch kind := t.Kind(); kind {
+		case reflect.Slice:
+			flattened = append(flattened, Flatten(e)...)
+		default:
+			flattened = append(flattened, e)
+		}
+	}
+	return flattened
+}

data/tracks/go/exercises/flatten-array/flatten_test.go

@@ -0,0 +1,23 @@
+package flatten
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestFlatten(t *testing.T) {
+	for _, tc := range testCases {
+		if actual := Flatten(tc.input); !reflect.DeepEqual(actual, tc.expected) {
+			t.Fatalf("FAIL: %s\nExpected: %v\nActual: %v", tc.description, tc.expected, actual)
+		}
+		t.Logf("PASS: %s", tc.description)
+	}
+}
+
+func BenchmarkFlatten(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range testCases {
+			Flatten(tc.input)
+		}
+	}
+}