trackler 2.2.1.9 → 2.2.1.10

data/tracks/elisp/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "yurrriq",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/elm/config/maintainers.json

@@ -0,0 +1,25 @@
+{
+  "maintainers": [
+    {
+      "github_username": "tgecho",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "bewatts",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/erlang/exercises/triangle/test/triangle_tests.erl

@@ -43,14 +43,14 @@ triangles_with_negative_sides_are_illegal_test() ->
     ?assertMatch({error, "all side lengths must be positive"},
                  ?TESTED_MODULE:kind(3, 4, -5)).
 
-triangles_violating_triangle_inequality_are_illegel_test() ->
+triangles_violating_triangle_inequality_are_illegal_test() ->
     ?assertMatch({error, "side lengths violate triangle inequality"},
                  ?TESTED_MODULE:kind(1, 1, 3)).
 
-triangles_violating_triangle_inequality_are_illegel_2_test() ->
+triangles_violating_triangle_inequality_are_illegal_2_test() ->
     ?assertMatch({error, "side lengths violate triangle inequality"},
                  ?TESTED_MODULE:kind(2, 4, 2)).
 
-triangles_violating_triangle_inequality_are_illegel_3_test() ->
+triangles_violating_triangle_inequality_are_illegal_3_test() ->
     ?assertMatch({error, "side lengths violate triangle inequality"},
                  ?TESTED_MODULE:kind(7, 3, 2)).

data/tracks/fortran/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "sentientmonkey",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/go/config.json

@@ -1,6 +1,7 @@
 {
   "language": "Go",
   "active": true,
+  "blurb": "Go is a compiled, open source programming language with a small, consistent syntax, a powerful standard library, and fantastic tooling. It's a great fit for web backends and command-line tools.",
   "ignore_pattern": "example(?!.*test)",
   "foregone": [
     "space-age",
@@ -328,6 +329,7 @@
       "unlocked_by": null,
       "difficulty": 3,
       "topics": [
+        "Cryptography",
         "Filtering",
         "Strings",
         "Text Formatting",
@@ -822,8 +824,8 @@
       "difficulty": 3,
       "topics": [
         "Algorithms",
+        "Cryptography",
         "Interfaces",
-        "Security",
         "Strings",
         "Transforming"
       ]

data/tracks/go/config/maintainers.json

@@ -12,7 +12,9 @@
     },
     {
       "github_username": "kytrinyx",
-      "alumnus": true
+      "alumnus": true,
+      "name": "Katrina Owen",
+      "bio": "I love Go for its simplicity and consistency. I also appreciate how hard the Go project is working to make the ecosystem welcoming to newcomers. I no longer maintain the Go track, but still maintain the Go tooling on Exercism."
     },
     {
       "github_username": "petertseng",

data/tracks/go/docs/ABOUT.md

@@ -1,7 +1,7 @@
-Go is an open source programming language started by engineers at Google. It's written using a C-style syntax, has statically typed variables, manages memory using garbage collection, and is compiled into stand-alone executables.
+Fans of Go (called *gophers*) describe Go as having the expressiveness of dynamic languages like Python or Ruby, with the performance of compiled languages like C or C++.
 
-Go is noted for the [concurrent programming features](https://golang.org/doc/effective_go.html#concurrency) built into the language core, the networking packages in the standard library ([such as a web server](https://golang.org/pkg/net/http/)), fast compilation and execution speed, and its simple, minimalistic language design.
+The language is open source, and was started by engineers at Google. It's written using a C-style syntax, has statically typed variables, manages memory using garbage collection, and is compiled into stand-alone executables.
 
-Fans of Go (called *gophers*) describe it as having the expressiveness of dynamic languages like Python or Ruby, with the performance of compiled languages like C or C++.
+Go is noted for the [concurrent programming features](https://golang.org/doc/effective_go.html#concurrency) built into the language core, the networking packages in the standard library ([such as a web server](https://golang.org/pkg/net/http/)), fast compilation and execution speed. Its simple, minimalistic and consistent language design make for a delightful experience, while the abundant and thoughtful tooling addresses traditional problems such as [consistent formatting](https://godoc.org/github.com/golang/go/src/cmd/gofmt) and [documentation](http://godoc.org/golang.org/x/tools/cmd/godoc).
 
 The home page for Go is [golang.org](https://golang.org/), and there is an excellent interactive tutorial at [tour.golang.org](https://tour.golang.org/).

data/tracks/groovy/config.json

@@ -1,10 +1,8 @@
 {
-  "slug": "groovy",
   "language": "Groovy",
-  "repository": "https://github.com/exercism/groovy",
   "checklist_issue": 9,
   "active": false,
-  "test_pattern": "(Test|Spec)[.]groovy",
+  "test_pattern": "(Spec)[.]groovy",
   "foregone": [
 
   ],

data/tracks/groovy/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "Dispader",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/groovy/exercises/grains/Grains.groovy

@@ -0,0 +1,9 @@
+class Grains {
+    def square(num) {
+        // YOUR CODE HERE
+    }
+
+    def total() {
+        // YOUR CODE HERE
+    }
+}

data/tracks/groovy/exercises/grains/GrainsSpec.groovy

@@ -0,0 +1,43 @@
+@Grab('org.spockframework:spock-core:1.0-groovy-2.4')
+import spock.lang.*
+
+class GrainsSpec extends Specification {
+
+    @Shared
+    def grains = new Grains()
+
+    def 'square of 1' () {
+        expect: 1 == grains.square(1)
+    }
+
+    def 'square of 2' () {
+        expect: 2 == grains.square(2)
+    }
+
+    def 'square of 3' () {
+        expect: 4 == grains.square(3)
+    }
+
+
+    def 'square of 4' () {
+        expect: 8 == grains.square(4)
+    }
+
+    def 'square of 16' () {
+        expect: 32768 == grains.square(16)
+    }
+
+    // GROOVY-7129
+    def 'square of 32' () {
+        expect: 2147483648 == grains.square(32)
+    }
+
+    def 'square of 64' () {
+        expect: 9223372036854775808 == grains.square(64)
+    }
+
+    def 'test total' () {
+        expect:
+        18446744073709551615 == grains.total()
+    }
+}

data/tracks/groovy/exercises/grains/README.md

@@ -33,7 +33,7 @@ For installation and learning resources, refer to the
 Run the tests by executing the test script.
 
 ```
-$ groovy ./HelloWorldSpec.groovy
+$ groovy ./GrainsSpec.groovy
 ```
 
 After the first test(s) pass, continue by commenting out or removing the `@Ignore` annotations prepending other tests.

data/tracks/groovy/exercises/word-count/Phrase.groovy

@@ -0,0 +1,10 @@
+class Phrase {
+
+    def Phrase(s) {
+        // YOUR CODE HERE
+    }
+
+    def wordCount() {
+        // YOUR CODE HERE
+    }
+}

data/tracks/groovy/exercises/word-count/PhraseSpec.groovy

@@ -0,0 +1,47 @@
+@Grab('org.spockframework:spock-core:1.0-groovy-2.4')
+import spock.lang.*
+
+class PhraseSpec extends Specification {
+
+    def 'count one word' () {
+        expect: ["word":1] == new Phrase("word").wordCount()
+    }
+
+    def 'count one of each' () {
+        expect: ["one":1,"of":1,"each":1] == new Phrase("one of each").wordCount()
+    }
+
+    def 'count multiple occurrences' () {
+        def phrase = new Phrase("one fish two fish red fish blue fish")
+        expect: ["one":1,"fish":4,"two":1,"red":1,"blue":1] == phrase.wordCount()
+    }
+
+    def 'count everything only once' () {
+        def phrase = new Phrase("all the kings horses and all the kings men")
+        // call wordCount 2x to verify
+        phrase.wordCount()
+        expect: ["all":2,"the":2,"kings":2,"horses":1,"and":1,"men":1] == phrase.wordCount()
+    }
+
+    def 'ignore punctuation' () {
+        def phrase = new Phrase('car : carpet as java : javascript!!&@$%^&')
+        expect: ["car":1,"carpet":1,"as":1,"java":1,"javascript":1] == phrase.wordCount()
+    }
+
+    def 'handle no spaces' () {
+        expect: ["one":1,"two":1,"three":1] == new Phrase("one,two,three").wordCount()
+    }
+
+    def 'include numbers' () {
+        expect: ["testing":2,"1":1,"2":1] == new Phrase("testing, 1, 2 testing").wordCount()
+    }
+
+    def 'normalize case' () {
+        expect: ["go":3] == new Phrase("go Go GO").wordCount()
+    }
+
+    def 'handle apostrophes' () {
+        def phrase = new Phrase("First: don't laugh. Then: don't cry.")
+        expect: ["first":1,"don't":2,"laugh":1,"then":1,"cry":1] == phrase.wordCount()
+    }
+}

data/tracks/groovy/exercises/word-count/README.md

@@ -18,7 +18,7 @@ For installation and learning resources, refer to the
 Run the tests by executing the test script.
 
 ```
-$ groovy ./HelloWorldSpec.groovy
+$ groovy ./PhraseSpec.groovy
 ```
 
 After the first test(s) pass, continue by commenting out or removing the `@Ignore` annotations prepending other tests.

data/tracks/haxe/config/maintainers.json

@@ -0,0 +1,6 @@
+{
+  "maintainers": [
+
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/idris/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "yurrriq",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/java/CONTRIBUTING.md

@@ -37,7 +37,7 @@ To submit a fix for an existing exercise or port an exercise to Java with the le
 
 1. **Ensure you have the basic Java tooling installed:**  JDK 1.8+, an editor and Gradle 2.x.
 
-   (see [exercism.io: Installing Java](http://exercism.io/languages/java/installing))
+   (see [exercism.io: Installing Java](http://exercism.io/languages/java/installation))
 -  **Setup a branch on a fork of [exercism/java](https://github.com/exercism/java) on your computer.**
 
    See [GitHub Help: Forking](https://help.github.com/articles/fork-a-repo/).  Use those instructions (in conjunction with the [Git Basics doc](https://github.com/exercism/docs/blob/master/contributing/git-basics.md)) to:

data/tracks/java/exercises/series/src/example/java/Series.java

@@ -4,21 +4,19 @@ import java.util.Arrays;
 import java.util.List;
 import java.util.stream.Collectors;
 
-public class Series {
+class Series {
 
     private final int digitsSize;
     private List<Integer> digits;
 
-    public Series(String string) {
-        this.digits = Arrays
-                .asList(string.split(("")))
-                .stream()
-                .map(digit -> Integer.parseInt(digit))
-                .collect(Collectors.toList());
+    Series(String string) {
+        this.digits = Arrays.stream(string.split(""))
+                        .map(Integer::parseInt)
+                        .collect(Collectors.toList());
         this.digitsSize = this.digits.size();
     }
 
-    public List<List<Integer>> slices(int num) {
+    List<List<Integer>> slices(int num) {
         if (num > this.digitsSize) {
             throw new IllegalArgumentException("Slice size is too big.");
         }
@@ -32,7 +30,7 @@ public class Series {
         return result;
     }
 
-    public List<Integer> getDigits() {
+    List<Integer> getDigits() {
         return digits;
     }
 

data/tracks/julia/config.json

@@ -218,6 +218,18 @@
         "sorting"
       ]
     },
+    {
+      "uuid": "43f1dc63-0412-9a80-49ba-b620f4bbfccac2731e4",
+      "slug": "collatz-conjecture",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
+      "topics": [
+        "mathematics",
+        "control-flow (exceptions)",
+        "control-flow (if-else statements)"
+      ]
+    },
     {
       "uuid": "9474a13b-09c1-4e4d-90e3-1a14fde5eb62",
       "slug": "bob",

data/tracks/julia/config/exercise_readme.go.tmpl

@@ -8,9 +8,11 @@
 {{ . }}
 {{ end }}
 {{- with .Spec.Credits -}}
+
 ## Source
 
 {{ . }}
 {{ end }}
+
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/anagram/README.md

@@ -9,5 +9,6 @@ Given `"listen"` and a list of candidates like `"enlists" "google"
 
 Inspired by the Extreme Startup game [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
 
+
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/atbash-cipher/README.md

@@ -30,5 +30,6 @@ things based on word boundaries.
 
 Wikipedia [http://en.wikipedia.org/wiki/Atbash](http://en.wikipedia.org/wiki/Atbash)
 
+
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/bob/README.md

@@ -14,5 +14,6 @@ He answers 'Whatever.' to anything else.
 
 Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=06](http://pine.fm/LearnToProgram/?Chapter=06)
 
+
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/collatz-conjecture/README.md

@@ -0,0 +1,34 @@
+# Collatz Conjecture
+
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+## Examples
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+
+## Source
+
+An unsolved problem in mathematics named after mathematician Lothar Collatz [https://en.wikipedia.org/wiki/3x_%2B_1_problem](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
+
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.