trackler 2.2.1.71 → 2.2.1.72

data/tracks/kotlin/exercises/say/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/scrabble-score/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/secret-handshake/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/series/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/sieve/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/simple-cipher/README.md

@@ -58,15 +58,13 @@ would get the same thing as the Caesar Cipher.
 
 The weakest link in any cipher is the human being. Let's make your
 substitution cipher a little more fault tolerant by providing a source
-of randomness and ensuring that the key is not composed of numbers or
-capital letters.
+of randomness and ensuring that the key contains only lowercase letters.
 
 If someone doesn't submit a key at all, generate a truly random key of
-at least 100 characters in length, accessible via Cipher#key (the #
-syntax means instance variable)
+at least 100 characters in length.
 
-If the key submitted has capital letters or numbers, throw an
-ArgumentError with a message to that effect.
+If the key submitted is not composed only of lowercase letters, your
+solution should handle the error in a language-appropriate way.
 
 ## Extensions
 

data/tracks/kotlin/exercises/simple-cipher/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/space-age/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/spiral-matrix/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/strain/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/sublist/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/sum-of-multiples/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-    ext.kotlin_version = '1.1.4-3'
+    ext.kotlin_version = '1.2.0'
     repositories {
         mavenCentral()
     }

data/tracks/kotlin/exercises/triangle/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-    ext.kotlin_version = '1.1.4-3'
+    ext.kotlin_version = '1.2.0'
     repositories {
         mavenCentral()
     }

data/tracks/kotlin/exercises/two-fer/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/kotlin/exercises/word-count/build.gradle

@@ -1,5 +1,5 @@
 buildscript {
-  ext.kotlin_version = '1.1.4-3'
+  ext.kotlin_version = '1.2.0'
   repositories {
     mavenCentral()
   }

data/tracks/lua/.gitignore

@@ -6,3 +6,4 @@
      
 .DS_Store
 bin/configlet.exe
+bin/configlet

data/tracks/lua/config.json

@@ -942,6 +942,18 @@
       ],
       "unlocked_by": "list-ops",
       "uuid": "09df8b87-c2cf-44a7-879c-96c9030cf27b"
+    },
+    {
+      "core": false,
+      "difficulty": 3,
+      "slug": "isbn-verifier",
+      "topics": [
+        "mathematics",
+        "control_flow_loops",
+        "strings"
+      ],
+      "unlocked_by": "run-length-encoding",
+      "uuid": "a9a6a2c7-2a58-4090-b538-5a275c521fe0"
     }
   ],
   "foregone": [],

data/tracks/lua/exercises/isbn-verifier/README.md

@@ -0,0 +1,52 @@
+# Isbn Verifier
+
+Check if a given ISBN-10 is valid.
+
+## Functionality
+
+Given an unkown string the program should check if the provided string is a valid ISBN-10.
+Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
+
+The program should allow for ISBN-10 without the separating dashes to be verified as well.
+
+## ISBN
+
+Let's take a random ISBN-10 number, say `3-598-21508-8` for this.
+The first digit block indicates the group where the ISBN belongs. Groups can consist of shared languages, geographic regions or countries. The leading '3' signals this ISBN is from a german speaking country.
+The following number block is to identify the publisher. Since this is a three digit publisher number there is a 5 digit title number for this book.
+The last digit in the ISBN is the check digit which is used to detect read errors.
+
+The first 9 digits in the ISBN have to be between 0 and 9.
+The check digit can additionally be an 'X' to allow 10 to be a valid check digit as well.
+
+A valid ISBN-10 is calculated with this formula `(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0`
+So for our example ISBN this means:
+(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 = 0
+
+Which proves that the ISBN is valid.
+
+## Caveats
+
+Converting from string to number can be tricky in certain languages.
+It's getting even trickier since the check-digit of an ISBN-10 can be 'X'.
+
+## Bonus tasks
+
+* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier)
+
+* Generate valid ISBN, maybe even from a given starting ISBN
+## Running the tests
+
+To run the tests, run the command `busted .` from within the exercise directory.
+
+## Further information
+
+For more detailed information about the Lua track, including how to get help if
+you're having trouble, please visit the exercism.io [Lua language page](http://exercism.io/languages/lua/about).
+
+## Source
+
+Converting a string into a number and some basic processing utilizing a relatable real world example. [https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation](https://en.wikipedia.org/wiki/International_Standard_Book_Number#ISBN-10_check_digit_calculation)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/lua/exercises/isbn-verifier/example.lua

@@ -0,0 +1,16 @@
+return {
+  valid = function(isbn)
+    isbn = isbn:gsub('-', '')
+
+    if not isbn:match('^%d%d%d%d%d%d%d%d%d[%dX]$') then
+      return false
+    end
+
+    local sum = 0
+    for i = 1, 10 do
+      sum = sum + (11 - i) * (tonumber(isbn:sub(i, i)) or 10)
+    end
+
+    return sum % 11 == 0
+  end
+}

data/tracks/lua/exercises/isbn-verifier/isbn-verifier_spec.lua

@@ -0,0 +1,55 @@
+local valid = require('isbn-verifier').valid
+
+describe('isbn-verifier', function()
+  it('valid isbn number', function()
+    assert.is_true(valid('3-598-21508-8'))
+  end)
+
+  it('invalid isbn check digit', function()
+    assert.is_false(valid('3-598-21508-9'))
+  end)
+
+  it('valid isbn number with a check digit of 10', function()
+    assert.is_true(valid('3-598-21507-X'))
+  end)
+
+  it('check digit is a character other than X', function()
+    assert.is_false(valid('3-598-21507-A'))
+  end)
+
+  it('invalid character in isbn', function()
+    assert.is_false(valid('3-598-2K507-0'))
+  end)
+
+  it('X is only valid as a check digit', function()
+    assert.is_false(valid('3-598-2X507-9'))
+  end)
+
+  it('valid isbn without separating dashes', function()
+    assert.is_true(valid('3598215088'))
+  end)
+
+  it('isbn without separating dashes and X as check digit', function()
+    assert.is_true(valid('359821507X'))
+  end)
+
+  it('isbn without check digit and dashes', function()
+    assert.is_false(valid('359821507'))
+  end)
+
+  it('too long isbn and no dashes', function()
+    assert.is_false(valid('3598215078X'))
+  end)
+
+  it('isbn without check digit', function()
+    assert.is_false(valid('3-598-21507'))
+  end)
+
+  it('too long isbn', function()
+    assert.is_false(valid('3-598-21507-XX'))
+  end)
+
+  it('check digit of X should not be used for 0', function()
+    assert.is_false(valid('3-598-21515-X'))
+  end)
+end)

data/tracks/ocaml/.travis-ci.sh

@@ -2,7 +2,7 @@
 OPAM_DEPENDS="ocamlfind core ounit react ppx_deriving"
 
 case "$OCAML_VERSION,$OPAM_VERSION" in
-    4.05.0,1.2.2) ppa=avsm/ocaml42+opam12 ;;
+    4.06.0,1.2.2) ppa=avsm/ocaml42+opam12 ;;
     *) echo Unknown $OCAML_VERSION,$OPAM_VERSION; exit 1 ;;
 esac
 

data/tracks/ocaml/.travis.yml

@@ -6,4 +6,4 @@ script:
   - bin/configlet lint .
 
 env:
-  - OCAML_VERSION=4.05.0 OPAM_VERSION=1.2.2
+  - OCAML_VERSION=4.06.0 OPAM_VERSION=1.2.2

data/tracks/ocaml/README.md

@@ -11,7 +11,7 @@ notes contain a few details specific to Ocaml.
 
 ## Prerequisites
 
-The OCaml track assumes installation of OCaml version 4.05.0, and installation of Core, OUnit, and React (for the Hangman exercise).
+The OCaml track assumes installation of OCaml version 4.06.0, and installation of Core, OUnit, and React (for the Hangman exercise).
 Assuming you have opam, these can be installed with
 ```bash
 opam install core ounit react

data/tracks/perl6/config.json

@@ -288,6 +288,16 @@
 
       ]
     },
+    {
+      "uuid": "a5d0488e-1a95-4896-8196-541d59dbcea1",
+      "slug": "acronym",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "1d36c4df-a1c8-454c-b4ec-7bec3c1cbca3",
       "slug": "binary",

data/tracks/perl6/exercises/acronym/Acronym.pm6

@@ -0,0 +1,4 @@
+unit module Acronym:ver<1>;
+
+sub abbreviate ($phrase) is export {
+}

data/tracks/perl6/exercises/acronym/Example.pm6

@@ -0,0 +1,5 @@
+unit module Acronym:ver<1>;
+
+sub abbreviate ($phrase) is export {
+  [~] $phrase.uc.comb(/\w+/).map: *.substr(0, 1);
+}

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

@@ -0,0 +1,33 @@
+# Acronym
+
+Convert a phrase to its acronym.
+
+Techies love their TLA (Three Letter Acronyms)!
+
+Help generate some jargon by writing a program that converts a long name
+like Portable Network Graphics to its acronym (PNG).
+
+## Resources
+
+Remember to check out the Perl 6 [documentation](https://docs.perl6.org/) and
+[resources](https://perl6.org/resources/) pages for information, tips, and
+examples if you get stuck.
+
+## Running the tests
+
+There is a test suite and module included with the exercise.
+The test suite (a file with the extension `.t`) will attempt to run routines
+from the module (a file with the extension `.pm6`).
+Add/modify routines in the module so that the tests will pass! You can view the
+test data by executing the command `perl6 --doc *.t` (\* being the name of the
+test suite), and run the test suite for the exercise by executing the command
+`prove . --exec=perl6` in the exercise directory.
+You can also add the `-v` flag e.g. `prove . --exec=perl6 -v` to display all
+tests, including any optional tests marked as 'TODO'.
+
+## Source
+
+Julien Vanier [https://github.com/monkbroc](https://github.com/monkbroc)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl6/exercises/acronym/acronym.t

@@ -0,0 +1,96 @@
+#!/usr/bin/env perl6
+use v6;
+use Test;
+use lib my $dir = $?FILE.IO.dirname;
+use JSON::Fast;
+
+my Str:D $exercise := 'Acronym';
+my Version:D $version = v1;
+my Str $module //= $exercise;
+plan 8;
+
+use-ok $module or bail-out;
+require ::($module);
+
+if ::($exercise).^ver !~~ $version {
+  warn "\nExercise version mismatch. Further tests may fail!"
+    ~ "\n$exercise is $(::($exercise).^ver.gist). "
+    ~ "Test is $($version.gist).\n";
+  bail-out 'Example version must match test version.' if %*ENV<EXERCISM>;
+}
+
+require ::($module) <&abbreviate>;
+
+my $c-data = from-json $=pod.pop.contents;
+
+for $c-data<cases>»<cases>».Array.flat {
+  is abbreviate(.<phrase>), |.<expected description>;
+}
+
+=head2 Canonical Data
+=begin code
+
+{
+  "exercise": "acronym",
+  "version": "1.1.0",
+  "cases": [
+    {
+      "description": "Abbreviate a phrase",
+      "cases": [
+        {
+          "description": "basic",
+          "property": "abbreviate",
+          "phrase": "Portable Network Graphics",
+          "expected": "PNG"
+        },
+        {
+          "description": "lowercase words",
+          "property": "abbreviate",
+          "phrase": "Ruby on Rails",
+          "expected": "ROR"
+        },
+        {
+          "description": "punctuation",
+          "property": "abbreviate",
+          "phrase": "First In, First Out",
+          "expected": "FIFO"
+        },
+        {
+          "description": "all caps words",
+          "property": "abbreviate",
+          "phrase": "PHP: Hypertext Preprocessor",
+          "expected": "PHP"
+        },
+        {
+          "description": "non-acronym all caps word",
+          "property": "abbreviate",
+          "phrase": "GNU Image Manipulation Program",
+          "expected": "GIMP"
+        },
+        {
+          "description": "hyphenated",
+          "property": "abbreviate",
+          "phrase": "Complementary metal-oxide semiconductor",
+          "expected": "CMOS"
+        }
+      ]
+    }
+  ]
+}
+
+=end code
+
+unless %*ENV<EXERCISM> {
+  skip-rest 'exercism tests';
+  exit;
+}
+
+subtest 'canonical-data' => {
+  (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'), 'match problem-specifications' !!
+    flunk 'problem-specifications file not found';
+}
+
+INIT { $module = 'Example' if %*ENV<EXERCISM> }