trackler 2.0.8.43 → 2.0.8.44

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a9834bb8d7cd54e4b2c8e1e26da6932cf1e95cc5
-  data.tar.gz: 21645918c226fde411b8ae99233e4fcd3abe2e97
+  metadata.gz: cad1dc38bea7e7ee4ddedd5f7215ef56be2adb9a
+  data.tar.gz: 3891605c70d09d4a9e44db48a7e702bcee6486cc
 SHA512:
-  metadata.gz: 929126636d31a8a2c0d54e607e5b64c2b131087594b836796e2a9f282dde25d522af1a0174bde3ee6939fc4679b0107dbad40e6982e517636124cd9743dff7f9
-  data.tar.gz: 484e966fda60ece17a4553d9b82e4a5974f2b763acd58369283b5a2f2f3197d931d6e34f4449e41e175c1bb34be8f63d17b574b7d0c65c60048d59e1e4b322c5
+  metadata.gz: 454da043eddd6054d7ceacb2ca7768db876af837347ca5c4dc9864638a7f159a6297b905f129bf3adc90d2af078c04b8af228d12be8b4386ba06bf88b5038640
+  data.tar.gz: 19be29744501524033e93ea0e793e305dade023157c35de1f5500ba0e81af04d4ebba679c7ec90b1e37dd3f3102e05086b9d53f19f428ebc6013be2d9cf51b50

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.8.43"
+  VERSION = "2.0.8.44"
 end

data/tracks/ceylon/exercises/anagram/source/anagram/AnagramTest.ceylon

@@ -1,5 +1,6 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.0.1
 {[String, {String*}, {String*}]*} cases => {
   // no matches
   ["diaper", {"hello", "world", "zombies", "pants"}, {}],
@@ -7,13 +8,13 @@ import ceylon.test { ... }
   ["ant", {"tan", "stand", "at"}, {"tan"}],
   // does not detect false positives
   ["galea", {"eagle"}, {}],
-  // detects multiple anagrams
+  // detects two anagrams
   ["master", {"stream", "pigeon", "maters"}, {"stream", "maters"}],
   // does not detect anagram subsets
   ["good", {"dog", "goody"}, {}],
   // detects anagram
   ["listen", {"enlists", "google", "inlets", "banana"}, {"inlets"}],
-  // detects multiple anagrams
+  // detects three anagrams
   [
     "allergy",
     {"gallery", "ballerina", "regally", "clergy", "largely", "leading"},

data/tracks/ceylon/exercises/bracket-push/source/bracketpush/BracketsTest.ceylon

@@ -1,5 +1,6 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.1.0
 {[String, Boolean]*} cases => {
   // paired square brackets
   ["[]", true],
@@ -9,6 +10,8 @@ import ceylon.test { ... }
   ["[[", false],
   // wrong ordered brackets
   ["}{", false],
+  // wrong closing bracket
+  ["{]", false],
   // paired with whitespace
   ["{ }", true],
   // simple nested brackets

data/tracks/ceylon/exercises/hamming/source/hamming/HammingTest.ceylon

@@ -1,20 +1,36 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.0.0
 {[String, String, Integer?]*} cases => {
+  // identical strands
   ["A", "A", 0],
+  // long identical strands
   ["GGACTGA", "GGACTGA", 0],
+  // complete distance in single nucleotide strands
   ["A", "G", 1],
+  // complete distance in small strands
   ["AG", "CT", 2],
+  // small distance in small strands
   ["AT", "CT", 1],
+  // small distance
   ["GGACG", "GGTCG", 1],
+  // small distance in long strands
   ["ACCAGGG", "ACTATGG", 2],
+  // non-unique character in first strand
   ["AGA", "AGG", 1],
+  // non-unique character in second strand
   ["AGG", "AGA", 1],
+  // same nucleotides in different positions
   ["TAG", "GAT", 2],
+  // large distance
   ["GATACA", "GCATAA", 4],
+  // large distance in off-by-one strand
   ["GGACGGATTCTG", "AGGACGGATTCT", 9],
+  // empty strands
   ["", "", 0],
+  // disallow first strand longer
   ["AATG", "AAA", null],
+  // disallow second strand longer
   ["ATA", "AGTG", null]
 };
 

data/tracks/ceylon/exercises/largest-series-product/source/largestseriesproduct/SeriesTest.ceylon

@@ -1,20 +1,36 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.0.0
 {[String, Integer, Integer?]*} cases => {
+  // finds the largest product if span equals length
   ["29", 2, 18],
+  // can find the largest product of 2 with numbers in order
   ["0123456789", 2, 72],
+  // can find the largest product of 2
   ["576802143", 2, 48],
+  // can find the largest product of 3 with numbers in order
   ["0123456789", 3, 504],
+  // can find the largest product of 3
   ["1027839564", 3, 270],
+  // can find the largest product of 5 with numbers in order
   ["0123456789", 5, 15120],
+  // can get the largest product of a big number
   ["73167176531330624919225119674426574742355349194934", 6, 23520],
+  // reports zero if the only digits are zero
   ["0000", 2, 0],
+  // reports zero if all spans include zero
   ["99099", 3, 0],
+  // rejects span longer than string length
   ["123", 4, null],
+  // reports 1 for empty string and empty product (0 span)
   ["", 0, 1],
+  // reports 1 for nonempty string and empty product (0 span)
   ["123", 0, 1],
+  // rejects empty string and nonzero span
   ["", 1, null],
+  // rejects invalid character in digits
   ["1234a5", 2, null],
+  // rejects negative span
   ["12345", -1, null]
 };
 

data/tracks/ceylon/exercises/leap/source/leap/LeapTest.ceylon

@@ -1,5 +1,6 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.0.0
 {[Integer, Boolean]*} cases =>
   {[2015, false], [2016, true], [2100, false], [2000, true]};
 

data/tracks/ceylon/exercises/react/source/react/ReactorTest.ceylon

@@ -1,5 +1,7 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.0.0
+
 test
 void inputCellsHaveValue() {
   value r = Reactor<Integer>();

data/tracks/ceylon/exercises/sieve/source/sieve/SieveTest.ceylon

@@ -1,5 +1,6 @@
 import ceylon.test { ... }
 
+// Tests adapted from x-common version 1.0.0
 {Integer*} cases => {1, 2, 10, 13, 1000};
 
 [Integer+] primes1000 = [

data/tracks/crystal/exercises/sieve/src/example.cr

@@ -4,9 +4,10 @@ module Primes
   def sieve(limit)
     sieve_ar = Array.new(limit + 1, true)
     sieve_ar[0] = sieve_ar[1] = false
-    2.step(Math.sqrt(limit)) do |i|
+
+    2.step(to: Math.sqrt(limit)) do |i|
       next unless sieve_ar[i]
-      (i*i).step(limit, i) { |ii| sieve_ar[ii] = false }
+      (i*i).step(to: limit, by: i) { |ii| sieve_ar[ii] = false }
     end
 
     sieve_ar.each_with_index.reduce([] of Int32) { |p, (s, i)| s ? p << i : p }

data/tracks/csharp/exercises/house/HINTS.md

@@ -0,0 +1,3 @@
+## Hints
+
+Try to capture the structure of the song in your code, where you build up the song by composing its parts.

data/tracks/csharp/exercises/saddle-points/HINTS.md

@@ -0,0 +1,4 @@
+## Hints
+
+For this exercise, you will need to create a set of factors using tuples.
+For more information on tuples, see [this link](https://msdn.microsoft.com/en-us/library/system.tuple(v=vs.110).aspx).

data/tracks/go/.github/stale.yml

@@ -0,0 +1,22 @@
+# Configuration for probot-stale - https://github.com/probot/stale
+
+# Number of days of inactivity before an Issue or Pull Request becomes stale
+daysUntilStale: 60
+# Number of days of inactivity before a stale Issue or Pull Request is closed
+daysUntilClose: 7
+# Issues or Pull Requests with these labels will never be considered stale
+exemptLabels:
+  - pinned
+  - security
+  - good first patch
+# Label to use when marking as stale
+staleLabel: wontfix
+# Comment to post when marking as stale. Set to `false` to disable
+markComment: >
+  This issue has been automatically marked as stale because it has not had
+  recent activity. It will be closed if no further activity occurs. Thank you
+  for your contributions.
+# Comment to post when closing a stale Issue or Pull Request. Set to `false` to disable
+closeComment: false
+# Limit to only `issues` or `pulls`
+# only: issues

data/tracks/go/README.md

@@ -44,15 +44,16 @@ number of files there.
 
 ```sh
 ~/exercism/go/leap
-$ tree
+$ tree -a
 .
 ├── cases_test.go
-├── example_gen.go
 ├── example.go
 ├── leap.go
-└── leap_test.go
+├── leap_test.go
+└── .meta
+    └── gen.go
 
-0 directories, 5 files
+1 directory, 5 files
 ```
 
 This list of files can vary across exercises so let's quickly run through
@@ -61,16 +62,22 @@ each file and briefly describe what it is.
 **cases_test.go** - This file contains [generated test cases](#generating-test-cases),
 and will only be present in some exercises.
 
-**example_gen.go** - This file generates the *cases_test.go* file, and will only
-be present in some exercises. See [generating test cases](#generating-test-cases)
-for more information.
-
-**example.go** - This is a reference solution for the exercise.
+**example.go** - This is a reference solution for the exercise. This file is
+ignored by the `exercism fetch` command, as are any files that include the
+word *example* in the filename, or anything within the *.meta* directory.
 
 **leap.go** - This is a *stub file*, and will only be present in some exercises.
 
 **leap_test.go** - This is the main test file for the exercise.
 
+**.meta/** - The *.meta* directory is used to contain files that are not
+meant to be included when a user fetches an exercise, for instance test case
+generators.
+
+**gen.go** - This file, within the *.meta* directory, generates the *cases_test.go*
+file, and will only be present in some exercises. See [generating test cases](#generating-test-cases)
+for more information.
+
 In some exercises there can be extra files, for instance the `series` exercise
 contains extra test files.
 
@@ -136,7 +143,7 @@ without a stub is [twelve-days](exercises/twelve-days/). At this point users wil
 have some experience in creating solutions for the exercises and can begin to
 create their own solutions from scratch. Some of the later exercises may have stub
 files if the author thinks there may be implementation confusion, a particularly
-difficult concept, or boilerplate code needed. 
+difficult concept, or boilerplate code needed.
 
 ### Problem Versioning
 
@@ -163,17 +170,21 @@ tracks don't.
 
 Some problems that are implemented in multiple tracks use the same inputs and
 outputs to define the test suites. Where the [x-common](https://github.com/exercism/x-common)
-repository contains json files with these inputs and outputs, we can generate
-the test cases programmatically.
+repository contains a *canonical-data.json* file with these inputs and outputs,
+we can generate the test cases programmatically.
 
-See the *example_gen.go* file in the `leap` exercise for an example of how this
+See the *gen.go* file in the `leap` exercise for an example of how this
 can be done.
 
+Test case generators are named *gen.go* and are kept in a special *.meta*
+directory within each exercise that makes use of a test cases generator. This
+*.meta* directory will be ignored when a user fetches an exercise.
+
 Whenever the shared JSON data changes, the test cases will need to be regenerated.
 To do this, make sure that the **x-common** repository has been cloned in the same
 parent-directory as the **xgo** repository. Then navigate into the **xgo**
-directory and run `go run exercises/<problem>/example_gen.go`. You should see
-that the `<problem>/test_cases.go` file has changed. Commit the change.
+directory and run `go run exercises/<exercise>/.meta/gen.go`. You should see
+that the `<exercise>/cases_test.go` file has changed. Commit the change.
 
 ## Pull requests
 

data/tracks/go/exercises/bob/{example_gen.go → .meta/gen.go}

@@ -6,7 +6,7 @@ import (
 	"log"
 	"text/template"
 
-	"../../gen"
+	"../../../gen"
 )
 
 func main() {

data/tracks/go/exercises/bowling/{example_gen.go → .meta/gen.go}

@@ -6,7 +6,7 @@ import (
 	"log"
 	"text/template"
 
-	"../../gen"
+	"../../../gen"
 )
 
 func main() {

data/tracks/go/exercises/change/{example_gen.go → .meta/gen.go}

@@ -6,7 +6,7 @@ import (
 	"log"
 	"text/template"
 
-	"../../gen"
+	"../../../gen"
 )
 
 func main() {

data/tracks/go/exercises/clock/{example_gen.go → .meta/gen.go}

@@ -6,7 +6,7 @@ import (
 	"log"
 	"text/template"
 
-	"../../gen"
+	"../../../gen"
 )
 
 func main() {

data/tracks/go/exercises/connect/{example_gen.go → .meta/gen.go}

@@ -6,7 +6,7 @@ import (
 	"log"
 	"text/template"
 
-	"../../gen"
+	"../../../gen"
 )
 
 func main() {

data/tracks/go/exercises/custom-set/{example_gen.go → .meta/gen.go}

@@ -7,7 +7,7 @@ import (
 	"strconv"
 	"text/template"
 
-	"../../gen"
+	"../../../gen"
 )
 
 func main() {

data/tracks/go/exercises/forth/.meta/gen.go

@@ -0,0 +1,71 @@
+// +build ignore
+
+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("forth", &j, t); err != nil {
+		log.Fatal(err)
+	}
+}
+
+// The JSON structure we expect to be able to unmarshal into
+type js struct {
+	Groups []Group `json:"cases"`
+}
+
+// A group of test cases.
+type Group struct {
+	Name  string `json:"description"`
+	Cases []OneCase
+}
+
+// One test case.
+type OneCase struct {
+	Description string
+	Input       []string
+	Expected    []int
+}
+
+// template applied to above data structure generates the Go test cases
+var tmpl = `package forth
+
+{{.Header}}
+
+type testGroup struct {
+	group	string
+	tests	[]testCase
+}
+
+type testCase struct {
+	description	string
+	input		[]string
+	expected	[]int // nil slice indicates error expected.
+}
+
+var testGroups = []testGroup{
+{{range .J.Groups}}{
+group: {{printf "%q"  .Name}},
+tests: []testCase{
+{{range .Cases}}{
+{{printf "%q"  .Description}},
+{{printf "%#v" .Input}},
+{{printf "%#v" .Expected}},
+},
+{{end}}
+},
+},
+{{end}}
+}
+`