trackler 2.2.1.9 → 2.2.1.10

data/tracks/julia/exercises/collatz-conjecture/example.jl

@@ -0,0 +1,14 @@
+function collatz(n::Integer)
+    n <= 0 && throw(DomainError())
+    iseven(n) ? div(n, 2) : 3n + 1
+end
+
+function collatz_steps(n::Integer)
+    i = 0
+    while n != 1
+        n = collatz(n)
+        i += 1
+    end
+
+    i
+end

data/tracks/julia/exercises/collatz-conjecture/runtests.jl

@@ -0,0 +1,11 @@
+using Base.Test
+
+include("collatz-conjecture.jl")
+
+# canonical data
+@test collatz_steps(1) == 0
+@test collatz_steps(16) == 4
+@test collatz_steps(12) == 9
+@test collatz_steps(1000000) == 152
+@test_throws DomainError collatz_steps(0)
+@test_throws DomainError collatz_steps(-15)

data/tracks/julia/exercises/complex-numbers/README.md

@@ -20,5 +20,6 @@ Implement `jm` analogous to `im` so that `1 + 1jm == ComplexNumber(1, 1)`.
 
 Wikipedia [https://en.wikipedia.org/wiki/Complex_number](https://en.wikipedia.org/wiki/Complex_number)
 
+
 ## 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/custom-set/README.md

@@ -12,5 +12,6 @@ The tests require a constructor that takes an array. The internals of your custo
 Certain methods have a unicode operator equivalent. E.g. `intersect(CustomSet([1, 2, 3, 4]), CustomSet([]))` is equivalent to `CustomSet([1, 2, 3, 4]) ∩ CustomSet([])`.
 
 
+
 ## 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/difference-of-squares/README.md

@@ -15,5 +15,6 @@ natural numbers is 3025 - 385 = 2640.
 
 Problem 6 at Project Euler [http://projecteuler.net/problem=6](http://projecteuler.net/problem=6)
 
+
 ## 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/etl/README.md

@@ -47,5 +47,6 @@ game while being scored at 4 in the Hawaiian-language version.
 
 The Jumpstart Lab team [http://jumpstartlab.com](http://jumpstartlab.com)
 
+
 ## 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/gigasecond/README.md

@@ -7,5 +7,6 @@ A gigasecond is 10^9 (1,000,000,000) seconds.
 
 Chapter 9 in Chris Pine's online Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=09](http://pine.fm/LearnToProgram/?Chapter=09)
 
+
 ## 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/hamming/README.md

@@ -38,5 +38,6 @@ of equal length differently.
 
 The Calculating Point Mutations problem at Rosalind [http://rosalind.info/problems/hamm/](http://rosalind.info/problems/hamm/)
 
+
 ## 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/hello-world/README.md

@@ -17,5 +17,6 @@ If everything goes well, you will be ready to fetch your first real exercise.
 
 This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program)
 
+
 ## 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/isogram/README.md

@@ -15,5 +15,6 @@ The word *isograms*, however, is not an isogram, because the s repeats.
 
 Wikipedia [https://en.wikipedia.org/wiki/Isogram](https://en.wikipedia.org/wiki/Isogram)
 
+
 ## 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/leap/README.md

@@ -29,5 +29,6 @@ phenomenon, go watch [this youtube video][video].
 
 JavaRanch Cattle Drive, exercise 3 [http://www.javaranch.com/leap.jsp](http://www.javaranch.com/leap.jsp)
 
+
 ## 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/luhn/README.md

@@ -67,5 +67,6 @@ Sum the digits
 
 The Luhn Algorithm on Wikipedia [http://en.wikipedia.org/wiki/Luhn_algorithm](http://en.wikipedia.org/wiki/Luhn_algorithm)
 
+
 ## 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/nucleotide-count/README.md

@@ -29,5 +29,6 @@ about that for now.
 
 The Calculating DNA Nucleotides_problem at Rosalind [http://rosalind.info/problems/dna/](http://rosalind.info/problems/dna/)
 
+
 ## 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/pangram/README.md

@@ -11,5 +11,6 @@ insensitive. Input will not contain non-ASCII symbols.
 
 Wikipedia [https://en.wikipedia.org/wiki/Pangram](https://en.wikipedia.org/wiki/Pangram)
 
+
 ## 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/pascals-triangle/README.md

@@ -17,5 +17,6 @@ the right and left of the current position in the previous row.
 
 Pascal's Triangle at Wolfram Math World [http://mathworld.wolfram.com/PascalsTriangle.html](http://mathworld.wolfram.com/PascalsTriangle.html)
 
+
 ## 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/raindrops/README.md

@@ -20,5 +20,6 @@ Convert a number to a string, the contents of which depend on the number's facto
 
 A variation on a famous interview question intended to weed out potential candidates. [http://jumpstartlab.com](http://jumpstartlab.com)
 
+
 ## 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/rna-transcription/README.md

@@ -21,5 +21,6 @@ each nucleotide with its complement:
 
 Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
 
+
 ## 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/robot-name/README.md

@@ -37,5 +37,6 @@ there are lots of collisions (like when you generate name one thousand times).
 
 A debugging session with Paul Blackwell at gSchool. [http://gschool.it](http://gschool.it)
 
+
 ## 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/roman-numerals/README.md

@@ -45,5 +45,6 @@ See also: http://www.novaroma.org/via_romana/numbers.html
 
 The Roman Numeral Kata [http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals](http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals)
 
+
 ## 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/rotational-cipher/README.md

@@ -55,5 +55,6 @@ R13"abcdefghijklmnopqrstuvwxyz" == "nopqrstuvwxyzabcdefghijklm"
 
 Wikipedia [https://en.wikipedia.org/wiki/Caesar_cipher](https://en.wikipedia.org/wiki/Caesar_cipher)
 
+
 ## 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/scrabble-score/README.md

@@ -40,5 +40,6 @@ And to total:
 
 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/secret-handshake/README.md

@@ -31,5 +31,6 @@ has caused the array to be reversed.
 
 Bert, in Mary Poppins [http://www.imdb.com/character/ch0011238/quotes](http://www.imdb.com/character/ch0011238/quotes)
 
+
 ## 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/sieve/README.md

@@ -30,5 +30,6 @@ correct list of primes.
 
 Sieve of Eratosthenes at Wikipedia [http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
 
+
 ## 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/transpose/README.md

@@ -61,5 +61,6 @@ the corresponding output row should contain the spaces in its right-most column(
 
 Reddit r/dailyprogrammer challenge #270 [Easy]. [https://www.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text](https://www.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text)
 
+
 ## 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/trinary/README.md

@@ -24,5 +24,6 @@ conversion, pretend it doesn't exist and implement it yourself.
 
 All of Computer Science [http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-](http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-)
 
+
 ## 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/word-count/README.md

@@ -15,5 +15,6 @@ free: 1
 
 This is a classic toy problem, but we were reminded of it by seeing it in the Go Tour.
 
+
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/lisp/.travis.yml

@@ -6,7 +6,7 @@ env:
     - LISP=sbcl-bin
     - LISP=ccl-bin
     - LISP=ecl
-    - LISP=clisp
+    # - LISP=clisp
     - LISP=abcl-bin
     - LISP=allegro
     # - LISP=clasp

data/tracks/lisp/config/maintainers.json

@@ -2,12 +2,12 @@
   "maintainers": [
     {
       "github_username": "verdammelt",
-      "show_on_website": false,
+      "show_on_website": true,
       "alumnus": false,
-      "name": null,
-      "bio": null,
-      "link_text": null,
-      "link_url": null,
+      "name": "Mark Simpson",
+      "bio": "I have always been interested in Lisps since taking the SICP course in college. I love the expressiveness and conciseness of the simple syntax, and the ability to build the language upward to meet the domain.",
+      "link_text": "Code and Cocktails",
+      "link_url": "http://code-and-cocktails.herokuapp.com/",
       "avatar_url": null
     },
     {

data/tracks/mips/config.json

@@ -9,7 +9,7 @@
     {
       "uuid": "5fd96880-6af2-415d-9b81-8c6eeffc3a38",
       "slug": "binary",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
@@ -20,7 +20,7 @@
       "uuid": "9a3501ad-6f6f-4899-af8b-a42379928201",
       "slug": "octal",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "binary",
       "difficulty": 1,
       "topics": [
 
@@ -30,7 +30,7 @@
       "uuid": "69464a1e-3da5-41ad-85fa-46e7cd009a1b",
       "slug": "trinary",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "binary",
       "difficulty": 1,
       "topics": [
 
@@ -40,7 +40,7 @@
       "uuid": "4bb585a0-b217-4e97-87d2-ed573449a51a",
       "slug": "hexadecimal",
       "core": false,
-      "unlocked_by": null,
+      "unlocked_by": "binary",
       "difficulty": 1,
       "topics": [
 
@@ -49,7 +49,7 @@
     {
       "uuid": "d3026f71-47d0-44d1-92ac-204404d4e26e",
       "slug": "leap",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
@@ -59,7 +59,7 @@
     {
       "uuid": "9eee92a9-cae9-4388-88aa-6779f468e864",
       "slug": "difference-of-squares",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
@@ -69,9 +69,9 @@
     {
       "uuid": "2ba35b0f-e16c-41be-81b4-88985926445a",
       "slug": "hamming",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
 
       ]
@@ -80,8 +80,8 @@
       "uuid": "e7a3845a-2f5a-455a-9158-0a7d1c1d5979",
       "slug": "rna-transcription",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "hamming",
+      "difficulty": 3,
       "topics": [
 
       ]
@@ -90,8 +90,8 @@
       "uuid": "429467c7-edf4-4010-a696-5fc76d0dd12c",
       "slug": "isogram",
       "core": false,
-      "unlocked_by": null,
-      "difficulty": 1,
+      "unlocked_by": "hamming",
+      "difficulty": 3,
       "topics": [
 
       ]
@@ -99,9 +99,9 @@
     {
       "uuid": "50cacd4d-56c2-4331-b84f-7c91e4b12c35",
       "slug": "triangle",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": [
 
       ]
@@ -109,9 +109,9 @@
     {
       "uuid": "823ca6fc-369c-468c-914e-b53bb0db4763",
       "slug": "atbash-cipher",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 4,
       "topics": [
 
       ]
@@ -119,9 +119,9 @@
     {
       "uuid": "42c7d965-c56c-437f-b513-19bcbcedef01",
       "slug": "scrabble-score",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
 
       ]
@@ -129,9 +129,9 @@
     {
       "uuid": "d294d722-8ea2-461e-86d8-0fecb6c5637a",
       "slug": "raindrops",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
 
       ]
@@ -139,9 +139,9 @@
     {
       "uuid": "cb17b1c8-5559-41bc-ac4f-12bce61d8745",
       "slug": "nth-prime",
-      "core": false,
+      "core": true,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 7,
       "topics": [
 
       ]

data/tracks/mips/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "ozan",
+      "show_on_website": true,
+      "alumnus": false,
+      "name": "Ozan Onay",
+      "bio": "Ozan teaches MIPS assembly as part of the Computer Architecture course at Bradfield, and finds that it's a great excuse to think about how computers actually work!",
+      "link_text": "Bradfield School of Computer Science",
+      "link_url": "https://bradfieldcs.com",
+      "avatar_url": "https://bradfieldcs.com/ozan.jpeg"
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/nim/config/maintainers.json

@@ -0,0 +1,15 @@
+{
+  "maintainers": [
+    {
+      "github_username": "catb0t",
+      "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/php/config/maintainers.json

@@ -0,0 +1,35 @@
+{
+  "maintainers": [
+    {
+      "github_username": "jrdnull",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "petemcfarlane",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "Dog",
+      "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"
+}