trackler 2.2.1.43 → 2.2.1.44

data/tracks/java/config.json

@@ -199,7 +199,14 @@
       "core": true,
       "difficulty": 4,
       "slug": "matrix",
-      "topics": null,
+      "topics": [
+        "loops",
+        "arrays",
+        "pattern_matching",
+        "integers",
+        "strings",
+        "type_conversion"
+      ],
       "unlocked_by": null,
       "uuid": "c1d4e0b4-6a0f-4be9-8222-345966621f53"
     },
@@ -229,7 +236,13 @@
       "core": false,
       "difficulty": 4,
       "slug": "sieve",
-      "topics": null,
+      "topics": [
+        "loops",
+        "lists",
+        "integers",
+        "algorithms",
+        "mathematics"
+      ],
       "unlocked_by": "difference-of-squares",
       "uuid": "6791d01f-bae4-4b63-ae76-86529ac49e36"
     },
@@ -274,7 +287,13 @@
       "core": false,
       "difficulty": 4,
       "slug": "collatz-conjecture",
-      "topics": null,
+      "topics": [
+        "exception_handling",
+        "recursion",
+        "conditionals",
+        "integers",
+        "mathematics"
+      ],
       "unlocked_by": "triangle",
       "uuid": "1500d39a-c9d9-4d3a-9e77-fdc1837fc6ad"
     },
@@ -282,7 +301,13 @@
       "core": false,
       "difficulty": 4,
       "slug": "nth-prime",
-      "topics": null,
+      "topics": [
+        "arrays",
+        "exception_handling",
+        "lists",
+        "loops",
+        "integers"
+       ],
       "unlocked_by": "triangle",
       "uuid": "2c69db99-648d-4bd7-8012-1fbdeff6ca0a"
     },
@@ -399,7 +424,14 @@
       "core": false,
       "difficulty": 5,
       "slug": "prime-factors",
-      "topics": null,
+      "topics": [
+        "arrays",
+        "conditionals",
+        "integers",
+        "lists",
+        "loops",
+        "mathematics"
+      ],
       "unlocked_by": "triangle",
       "uuid": "599c08ec-7338-46ed-99f8-a76f78f724e6"
     },
@@ -796,7 +828,11 @@
       "core": false,
       "difficulty": 8,
       "slug": "complex-numbers",
-      "topics": null,
+      "topics": [
+        "mathematics",
+        "floating_point_numbers",
+        "classes"
+      ],
       "unlocked_by": "triangle",
       "uuid": "52d11278-0d65-4b5b-b387-1374fced3243"
     },

data/tracks/java/exercises/largest-series-product/src/main/java/LargestSeriesProductCalculator.java

@@ -1,5 +1,9 @@
-public class LargestSeriesProductCalculator {
-
-
+class LargestSeriesProductCalculator {
+    LargestSeriesProductCalculator(String inputNumber) {
+        throw new UnsupportedOperationException ("Delete this statement and write your own implementation.");
+    }
 
+    long calculateLargestProductForSeriesLength(int numberOfDigits) {
+        throw new UnsupportedOperationException ("Delete this statement and write your own implementation.");
+    }
 }

data/tracks/java/exercises/matrix/src/main/java/Matrix.java

@@ -0,0 +1,23 @@
+
+class Matrix {
+
+    Matrix(String matrixAsString) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    int[] getRow(int rowNumber) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    int[] getColumn(int columnNumber) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    int getRowsCount() {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    int getColumnsCount() {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+}

data/tracks/julia/config.json

@@ -2,8 +2,7 @@
   "language": "Julia",
   "active": true,
   "blurb": "Julia is an open-source high-level, dynamic programming language whose sweet spot is technical and scientific computing. It is convenient for day-to-day work and fast enough for high performance computing.",
-  "exercises": [
-    {
+  "exercises": [{
       "uuid": "a668410d-41aa-4710-a68f-54521da6486d",
       "slug": "hello-world",
       "core": true,
@@ -358,6 +357,16 @@
         "mathematics",
         "iterators"
       ]
+    },
+    {
+      "uuid": "2ed6e171-04e1-b080-f383-a801b2564b3e0f4f1ee",
+      "slug": "grains",
+      "core": false,
+      "unlocked_by": "difference-of-squares",
+      "difficulty": 1,
+      "topics": [
+        "exceptions"
+      ]
     }
   ],
   "foregone": [

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

@@ -0,0 +1,33 @@
+# Grains
+
+Calculate the number of grains of wheat on a chessboard given that the number
+on each square doubles.
+
+There once was a wise servant who saved the life of a prince. The king
+promised to pay whatever the servant could dream up. Knowing that the
+king loved chess, the servant told the king he would like to have grains
+of wheat. One grain on the first square of a chess board. Two grains on
+the next. Four on the third, and so on.
+
+There are 64 squares on a chessboard.
+
+Write code that shows:
+- how many grains were on each square (`on_square`)
+- the total number of grains (`total_after`)
+
+## For bonus points
+
+Did you get the tests passing and the code clean? If you want to, these
+are some additional things you could try:
+
+- Optimize for speed.
+- Optimize for readability.
+
+Then please share your thoughts in a comment on the submission. Did this
+experiment make the code better? Worse? Did you learn anything from it?
+
+## Source
+JavaRanch Cattle Drive, exercise 6 [http://www.javaranch.com/grains.jsp](http://www.javaranch.com/grains.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/grains/example.jl

@@ -0,0 +1,23 @@
+"""Calculate the number of grains on square `square`."""
+function on_square(square)
+    check_square_input(square)
+    2 ^ (square - 1)
+end
+
+"""Calculate the total number of grains after square `square`."""
+function total_after(square)
+    check_square_input(square)
+    sum(map(on_square, 1:square))
+end
+
+"""Validate an arbitrary square."""
+function check_square_input(square)
+    square == 0 && throw(DomainError(square, "Square input of zero is invalid."))
+    square <  0 && throw(DomainError(square, "Negative square input is invalid."))
+    square > 64 && throw(DomainError(square, "Square input greater than 64 is invalid."))
+end
+
+if VERSION < v"0.7"  # backwards compatibility
+    Base.DomainError(val) = DomainError()
+    Base.DomainError(val, msg) = DomainError()
+end

data/tracks/julia/exercises/grains/grains.jl

@@ -0,0 +1,9 @@
+"""Calculate the number of grains on square `square`."""
+function on_square(square)
+
+end
+
+"""Calculate the total number of grains after square `square`."""
+function total_after(square)
+
+end

data/tracks/julia/exercises/grains/runtests.jl

@@ -0,0 +1,27 @@
+using Base.Test
+
+include("grains.jl")
+
+@testset "On squares" begin
+    @testset "On square $s" for s = UInt64(1):64
+        @test on_square(s) == 2^(s-1)
+        @test total_after(s) == 2^s - 1
+    end
+end
+
+@testset "Invalid values" begin
+    @testset "Zero" begin
+        @test_throws DomainError on_square(0)
+        @test_throws DomainError total_after(0)
+    end
+    
+    @testset "Negative" begin
+        @test_throws DomainError on_square(-1)
+        @test_throws DomainError total_after(-1)
+    end
+    
+    @testset "Greater than 64" begin
+        @test_throws DomainError on_square(65)
+        @test_throws DomainError total_after(65)
+    end
+end

data/tracks/lua/README.md

@@ -56,7 +56,7 @@ Pleases see the [Useful Lua Resources][8] page.
 ## Lua icon
 The Lua icon is inspired by the [Lua logo][9], which was designed by Alexandre Nakonechnyj.
 
-[1]: http://exercism.io/languages/lua/installing
+[1]: http://exercism.io/languages/lua/installation
 [2]: https://help.github.com/articles/fork-a-repo/
 [3]: https://help.github.com/articles/creating-a-pull-request/
 [4]: https://github.com/exercism/lua/tree/master/exercises/bob

data/tracks/mips/exercises/octal/README.md

@@ -1,15 +1,10 @@
 # Octal
 
-Convert an octal number, represented as a string (e.g. '1735263'), to its
-decimal equivalent using first principles (i.e. no, you may not use built-in or
-external libraries to accomplish the conversion).
-
-Implement octal to decimal conversion.  Given an octal input
-string, your program should produce a decimal output.
+Convert an octal number, represented as a string of ascii values (e.g. "1735263"), to its
+decimal equivalent using first principles. For instance, given the input "10", your program
+should return the integer 8.
 
 ## Note
-- Implement the conversion yourself.
-  Do not use something else to perform the conversion for you.
 - Treat invalid input as octal 0.
 
 ## About Octal (Base-8)

data/tracks/ocaml/exercises/palindrome-products/README.md

@@ -5,22 +5,16 @@ Detect palindrome products in a given range.
 A palindromic number is a number that remains the same when its digits are
 reversed. For example, `121` is a palindromic number but `112` is not.
 
-Given the definition of a palindromic number, we define a palindrome _product_
-to be the product `c`, such that `a * b = c`, where `c` is a palindromic number and
- `a` and `b` are integers (possibly, but _not_ necessarily palindromic numbers).
+Given a range of numbers, find the largest and smallest palindromes which
+are products of numbers within that range.
 
-For example, the palindromic number 9009 can be written as the palindrome
-product: `91 * 99 = 9009`.
+Your solution should return the largest and smallest palindromes, along with the
+factors of each within the range. If the largest or smallest palindrome has more 
+than one pair of factors within the range, then return all the pairs.
 
-It's possible (and indeed common) for a palindrome product to be the product
-of multiple combinations of numbers. For example, the palindrome product `9` has
-the factors `(1, 9)` and `(3, 3)`.
-
-Write a program that given a range of integers, returns the smallest and largest
-palindromic product of factors within that range, along with all the factors in the range for that product.
-
-Not all ranges of factors can produce a Palindrome, and ranges must have their max at least as large
-as their min. This exercise uses the OCaml `Result.t` type to specify errors.
+Not all ranges of factors can produce a Palindrome, and ranges must have their 
+max at least as large as their min. This exercise uses the OCaml `Result.t` 
+type to specify errors.
 
 ## Example 1
 

data/tracks/perl6/.travis.yml

@@ -1,11 +1,15 @@
 ---
 sudo: false
-services:
-  - docker
 before_script:
   - git clone https://github.com/exercism/problem-specifications.git
   - bin/fetch-configlet
   - docker pull rakudo-star:latest
 script:
   - bin/configlet lint .
-  - docker run -e EXERCISM=1 -t -v $PWD:/exercism rakudo-star prove /exercism -re perl6
+  - docker run
+    --env EXERCISM=1
+    --volume $PWD:/exercism
+    rakudo-star prove /exercism
+    --exec perl6
+    --recurse
+    --jobs 2

data/tracks/perl6/bin/exercise-gen.pl6

@@ -6,6 +6,10 @@ use YAMLish;
 my $base-dir = $?FILE.IO.resolve.parent.parent;
 my @exercises;
 
+if $base-dir.child('problem-specifications') !~~ :d {
+  warn 'problem-specifications directory not found; some exercises may generate incorrectly.';
+}
+
 if @*ARGS {
   if @*ARGS[0] eq '--all' {
     push @exercises, .basename for $base-dir.child('exercises').dir;
@@ -59,4 +63,4 @@ for @exercises -> $exercise {
 }
 
 if @dir-not-found  {warn 'exercise directory does not exist for: ' ~ join ' ', @dir-not-found}
-if @yaml-not-found {warn 'example.yaml not found for: ' ~ join ' ', @yaml-not-found}
+if @yaml-not-found {note 'example.yaml not found for: ' ~ join ' ', @yaml-not-found}

data/tracks/perl6/exercises/accumulate/README.md

@@ -25,9 +25,6 @@ Keep your hands off that collect/map/fmap/whatchamacallit functionality
 provided by your standard library!
 Solve this one yourself using other basic tools instead.
 
-Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
-as this is idiomatic Lisp, not a library function.
-
 ## Resources
 
 Remember to check out the Perl 6 [documentation](https://docs.perl6.org/) and

data/tracks/perl6/exercises/accumulate/accumulate.t

@@ -3,9 +3,9 @@ use v6;
 use Test;
 use lib $?FILE.IO.dirname;
 
-my $exercise = 'Accumulate';
-my $version = v1;
-my $module = %*ENV<EXERCISM> ?? 'Example' !! $exercise;
+my Str:D $exercise := 'Accumulate';
+my Version:D $version = v1;
+my Str $module //= $exercise;
 plan 7;
 
 use-ok $module or bail-out;
@@ -40,3 +40,9 @@ is-deeply accumulate(['the', 'quick', 'brown', 'fox'], sub { @_[0].flip }),
           'reverse strings';
 
 done-testing;
+
+INIT {
+  if %*ENV<EXERCISM> {
+    $module = 'Example';
+  }
+}

data/tracks/perl6/exercises/all-your-base/README.md

@@ -6,6 +6,7 @@ Implement general base conversion. Given a number in base **a**,
 represented as a sequence of digits, convert it to base **b**.
 
 ## Note
+
 - Try to implement the conversion yourself.
   Do not use something else to perform the conversion for you.
 
@@ -28,7 +29,6 @@ The number 1120, *in base 3*, means:
 
 I think you got the idea!
 
-
 *Yes. Those three numbers above are exactly the same. Congratulations!*
 
 ## Resources

data/tracks/perl6/exercises/all-your-base/all-your-base.t

@@ -4,10 +4,12 @@ use Test;
 use lib my $dir = $?FILE.IO.dirname;
 use JSON::Fast;
 
-my $exercise = 'AllYourBase';
-my $version = v2;
-my $module = %*ENV<EXERCISM> ?? 'Example' !! $exercise;
-plan 23;
+my Str:D $exercise := 'AllYourBase';
+my Version:D $version = v2;
+my Str $module //= $exercise;
+INIT {
+  plan 23;
+}
 
 use-ok $module or bail-out;
 require ::($module);
@@ -41,15 +43,9 @@ for @($c-data<cases>) -> $case {
     is-deeply call-convert-base, $expected, $case<description>
   }
 
-  sub call-convert-base { &::('convert-base')(|$case<input_base input_digits output_base>) }
+  sub call-convert-base { convert-base(|$case<input_base input_digits output_base>) }
 }
 
-if %*ENV<EXERCISM> {
-  if (my $c-data-file = "$dir/../../problem-specifications/exercises/{$dir.IO.resolve.basename}/canonical-data.json".IO.resolve) ~~ :f {
-    is-deeply $c-data, EVAL('use JSON::Fast; from-json($c-data-file.slurp);'), 'canonical-data';
-  } else { flunk 'canonical-data' }
-} else { skip }
-
 done-testing;
 
 INIT {
@@ -251,4 +247,20 @@ $c-data := from-json q:to/END/;
 }
 
 END
+
+  if %*ENV<EXERCISM> {
+    $module = 'Example';
+    if (my $c-data-file =
+      "$dir/../../problem-specifications/exercises/{$dir.IO.resolve.basename}/canonical-data.json"
+      .IO.resolve) ~~ :f
+    {
+      is-deeply $c-data, EVAL('from-json $c-data-file.slurp'), 'canonical-data';
+    }
+    else {
+      flunk 'canonical-data';
+    }
+  }
+  else {
+    skip;
+  }
 }