trackler 2.2.1.73 → 2.2.1.74

data/tracks/idris/config.json

@@ -1,5 +1,11 @@
 {
   "active": false,
+  "deprecated": [
+
+  ],
+  "foregone": [
+
+  ],
   "exercises": [
     {
       "core": false,

data/tracks/idris/exercises/hello-world/src/HelloWorld.idr

@@ -0,0 +1,4 @@
+module HelloWorld
+
+export
+greet : Maybe String -> String

data/tracks/java/exercises/reverse-string/src/main/java/ReverseString.java

@@ -1,6 +1,6 @@
 class ReverseString {
   
-    String reverse() {
+    String reverse(String stringToReverse) {
         throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
     }
   

data/tracks/javascript/.eslintignore

@@ -1,11 +1,9 @@
 big-integer.js
 exercises/alphametics
-exercises/anagram
 exercises/binary-search
 exercises/binary-search-tree
 exercises/bowling
 exercises/bracket-push
-exercises/circular-buffer
 exercises/clock
 exercises/custom-set
 exercises/flatten-array
@@ -22,7 +20,6 @@ exercises/minesweeper
 exercises/nth-prime
 exercises/octal
 exercises/palindrome-products
-exercises/pangram
 exercises/perfect-numbers
 exercises/pythagorean-triplet
 exercises/queen-attack
@@ -30,10 +27,6 @@ exercises/robot-name
 exercises/robot-simulator
 exercises/roman-numerals
 exercises/saddle-points
-exercises/say
-exercises/scrabble-score
 exercises/secret-handshake
 exercises/simple-cipher
 exercises/simple-linked-list
-exercises/triangle
-exercises/trinary

data/tracks/javascript/config.json

@@ -13,6 +13,17 @@
       ],
       "uuid": "4756cfc9-7509-4783-8be7-60e3376b8256"
     },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "two-fer",
+      "topics": [
+        "strings",
+        "control-flow-(conditionals)"
+      ],
+      "unlocked_by": "hello-world",
+      "uuid": "5f3d1326-f0c5-44a6-b90a-6af3b7d455f1"
+    },
     {
       "core": true,
       "difficulty": 1,

data/tracks/javascript/exercises/anagram/example.js

@@ -4,8 +4,8 @@ function Anagram(word) {
   this.word = word;
 }
 
-Anagram.prototype.matches = function (words) {
-  words = Array.isArray(words) ? words : [].slice.call(arguments, 0);
+Anagram.prototype.matches = function (wordList) {
+  var words = Array.isArray(wordList) ? wordList : [].slice.call(arguments, 0);
 
   return words.filter(function (candidate) {
     return !sameWord(this.word, candidate) && isAnagram(this.word, candidate);

data/tracks/javascript/exercises/circular-buffer/circular-buffer.spec.js

@@ -57,7 +57,7 @@ describe('CircularBuffer', function () {
   xit('writes of undefined or null don\'t occupy buffer', function () {
     var buffer = circularBuffer(3);
     buffer.write(null);
-    buffer.write(undefined);
+    buffer.write(undefined); // eslint-disable-line no-undefined
     [1, 2, 3].map(function (i) { buffer.write(i.toString()); });
     expect(buffer.read()).toBe('1');
   });

data/tracks/javascript/exercises/circular-buffer/example.js

@@ -68,7 +68,7 @@ function CircularBuffer(capacity) {
   }
 
   function isEmpty(data) {
-    return data === null || data === undefined;
+    return !data;
   }
 }
 

data/tracks/javascript/exercises/pangram/example.js

@@ -1,9 +1,10 @@
-var notAlpha = /[^a-z]+/gi,
-  ALPHA_LENGTH = 26,
-  cleaned,
-  unique;
 
 var Pangram = function (candidate) {
+  var notAlpha = /[^a-z]+/gi;
+  var ALPHA_LENGTH = 26;
+  var cleaned;
+  var unique;
+
   unique = {};
   cleaned = (candidate.replace(notAlpha, '')).toLowerCase();
   cleaned.split('').forEach(function (el) {

data/tracks/javascript/exercises/say/example.js

@@ -41,7 +41,8 @@ var bigNumbers = {
 };
 
 function bigPart(number) {
-  var factor, result = '';
+  var factor;
+  var result = '';
   for (var bigNumber = 1000000000; bigNumber >= 1000; bigNumber /= 1000) {
     if (number.current >= bigNumber) {
       factor = Math.floor(number.current / bigNumber);
@@ -58,6 +59,7 @@ function sayDecade(n) {
       return decades[decade] + '-' + smallNumbers[n - decade];
     }
   }
+  throw new Error('Number must be between 10 and 99.');
 }
 
 function twoDigit(n) {
@@ -78,7 +80,8 @@ function threeDigit(n) {
 }
 
 exports.inEnglish = function (n) {
-  var result, number = {current: n};
+  var result;
+  var number = {current: n};
   if (n >= 0 && n < 1000000000000) {
     result = bigPart(number);
     result += threeDigit(number.current);

data/tracks/javascript/exercises/scrabble-score/example.js

@@ -14,9 +14,8 @@ function letterScore(letter) {
   return letterScores[letter] || 0;
 }
 
-module.exports = function (word) {
-  word || (word = '');
-  word = word.toLowerCase();
+module.exports = function (wrd) {
+  var word = wrd ? wrd.toLowerCase() : '';
 
   var sum = 0;
   var idx = -1;

data/tracks/javascript/exercises/secret-handshake/README.md

@@ -53,7 +53,7 @@ changing `xit` to `it`.
 
 ## Source
 
-Bert, in Mary Poppins [http://www.imdb.com/character/ch0011238/quotes](http://www.imdb.com/character/ch0011238/quotes)
+Bert, in Mary Poppins [http://www.imdb.com/title/tt0058331/quotes/qt0437047](http://www.imdb.com/title/tt0058331/quotes/qt0437047)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/javascript/exercises/triangle/example.js

@@ -22,7 +22,6 @@ function Triangle(a, b, c) {
   };
 
   this.violatesInequality = function () {
-    var a = this.sides[0], b = this.sides[1], c = this.sides[2];
     return (a + b < c) || (a + c < b) || (b + c < a);
   };
 
@@ -50,7 +49,9 @@ function Triangle(a, b, c) {
     var uniqueSides = [];
 
     for (var uniqueSide in uniques) {
-      uniqueSides.push(uniqueSide);
+      if (uniques.hasOwnProperty(uniqueSide)) {
+        uniqueSides.push(uniqueSide);
+      }
     }
 
     return uniqueSides;

data/tracks/javascript/exercises/trinary/example.js

@@ -14,5 +14,5 @@ Trinary.prototype.toDecimal = function () {
 };
 
 Trinary.prototype.accumulator = function (decimal, digit, index) {
-  return decimal += digit * Math.pow(BASE, index);
+  return decimal + digit * Math.pow(BASE, index);
 };

data/tracks/javascript/exercises/two-fer/README.md

@@ -0,0 +1,41 @@
+# Two Fer
+
+`Two-fer` or `2-fer` is short for two for one. One for you and one for me.
+
+```
+"One for X, one for me."
+```
+
+When X is a name or "you".
+
+If the given name is "Alice", the result should be "One for Alice, one for me."
+If no name is given, the result should be "One for you, one for me."
+
+## Setup
+
+Go through the setup instructions for JavaScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/javascript
+
+## Making the Test Suite Pass
+
+Execute the tests with:
+
+    jasmine <exercise-name>.spec.js
+
+Replace `<exercise-name>` with the name of the current exercise. E.g., to
+test the Two Fer exercise:
+
+    jasmine two-fer.spec.js
+
+All tests but the first have been skipped. Once you get a test passing,
+you can unskip the next one by changing `xit` to `it`.
+
+## Source
+
+This is an exercise to introduce users to basic programming constructs, just after 'Hello World'. [https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+

data/tracks/javascript/exercises/two-fer/example.js

@@ -0,0 +1,10 @@
+var TwoFer = function () {};
+
+TwoFer.prototype.twoFer = function (who) {
+  if (who) {
+    return 'One for ' + who + ', one for me.';
+  }
+  return 'One for you, one for me.';
+};
+
+module.exports = TwoFer;

data/tracks/javascript/exercises/two-fer/two-fer.js

@@ -0,0 +1,12 @@
+var TwoFer = function () {};
+
+TwoFer.prototype.twoFer = function (who) {
+  // your code goes here
+  // You will have to use the parameter who
+  // in some way. In this example, it is just
+  // returned, but your solution will have to
+  // use a conditional.
+  return who;
+};
+
+module.exports = TwoFer;

data/tracks/javascript/exercises/two-fer/two-fer.spec.js

@@ -0,0 +1,18 @@
+
+var TwoFer = require('./two-fer');
+
+describe('Two Fer', function () {
+  var twoFer = new TwoFer();
+
+  it('gives one to you if no parameter given', function () {
+    expect(twoFer.twoFer()).toEqual('One for you, one for me.');
+  });
+
+  xit('gives one to Alice if \'Alice\' is given', function () {
+    expect(twoFer.twoFer('Alice')).toEqual('One for Alice, one for me.');
+  });
+
+  xit('gives one to Bob if \'Bob\' is given', function () {
+    expect(twoFer.twoFer('Bob')).toEqual('One for Bob, one for me.');
+  });
+});

data/tracks/kotlin/exercises/secret-handshake/README.md

@@ -32,7 +32,7 @@ has caused the array to be reversed.
 
 ## Source
 
-Bert, in Mary Poppins [http://www.imdb.com/character/ch0011238/quotes](http://www.imdb.com/character/ch0011238/quotes)
+Bert, in Mary Poppins [http://www.imdb.com/title/tt0058331/quotes/qt0437047](http://www.imdb.com/title/tt0058331/quotes/qt0437047)
 
 ## 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/rna-transcription/Example.pm6

@@ -1,6 +1,5 @@
-unit module RNA:ver<1>;
+unit module RNA:ver<2>;
 
 sub to-rna ($dna) is export {
-  fail if $dna ~~ /<-[AGCT]>/;
   $dna.trans(<A G C T> => <U C G A>);
 }

data/tracks/perl6/exercises/rna-transcription/RNA.pm6

@@ -1,4 +1,4 @@
-unit module RNA:ver<1>;
+unit module RNA:ver<2>;
 
 sub to-rna ($dna) is export {
 }

data/tracks/perl6/exercises/rna-transcription/example.yaml

@@ -1,20 +1,13 @@
 exercise: RNA
-version: 1
-plan: 10
+version: 2
+plan: 7
 imports: '&to-rna'
 tests: |-
-  for @($c-data<cases>) {
-    if .<expected> {
-      is .<dna>.&to-rna, |.<expected description>;
-    } else {
-      throws-like {.<dna>.&to-rna}, Exception;
-    }
-  }
+  is .<dna>.&to-rna, |.<expected description> for $c-data<cases>.values;
 
 unit: module
 example: |-
   sub to-rna ($dna) is export {
-    fail if $dna ~~ /<-[AGCT]>/;
     $dna.trans(<A G C T> => <U C G A>);
   }
 stub: |-

data/tracks/perl6/exercises/rna-transcription/rna-transcription.t

@@ -5,9 +5,9 @@ use lib my $dir = $?FILE.IO.dirname;
 use JSON::Fast;
 
 my Str:D $exercise := 'RNA';
-my Version:D $version = v1;
+my Version:D $version = v2;
 my Str $module //= $exercise;
-plan 10;
+plan 7;
 
 use-ok $module or bail-out;
 require ::($module);
@@ -22,32 +22,14 @@ if ::($exercise).^ver !~~ $version {
 require ::($module) <&to-rna>;
 
 my $c-data = from-json $=pod.pop.contents;
-for @($c-data<cases>) {
-  if .<expected> {
-    is .<dna>.&to-rna, |.<expected description>;
-  } else {
-    throws-like {.<dna>.&to-rna}, Exception;
-  }
-}
+is .<dna>.&to-rna, |.<expected description> for $c-data<cases>.values;
 
 =head2 Canonical Data
 =begin code
 
 {
   "exercise": "rna-transcription",
-  "version": "1.0.1",
-  "comments": [
-    "Language implementations vary on the issue of invalid input data.",
-    "A language may elect to simplify this task by only presenting valid",
-    "test cases.  For languages handling invalid input data as",
-    "error conditions, invalid test cases are included here and are",
-    "indicated with an expected value of null.  Note however that null is",
-    "simply an indication here in the JSON.  Actually returning null from",
-    "a rna-transcription function may or may not be idiomatic in a language.",
-    "Language idioms of errors or exceptions should be followed.",
-    "Alternative interpretations such as ignoring excess length at the end",
-    "are not represented here."
-  ],
+  "version": "1.1.0",
   "cases": [
     {
       "description": "RNA complement of cytosine is guanine",
@@ -78,24 +60,6 @@ for @($c-data<cases>) {
       "property": "toRna",
       "dna": "ACGTGGTCTTAA",
       "expected": "UGCACCAGAAUU"
-    },
-    {
-      "description": "correctly handles invalid input (RNA instead of DNA)",
-      "property": "toRna",
-      "dna": "U",
-      "expected": null
-    },
-    {
-      "description": "correctly handles completely invalid DNA input",
-      "property": "toRna",
-      "dna": "XXX",
-      "expected": null
-    },
-    {
-      "description": "correctly handles partially invalid DNA input",
-      "property": "toRna",
-      "dna": "ACGTXXXCTTAA",
-      "expected": null
     }
   ]
 }

data/tracks/php/exercises/hamming/hamming_test.php

@@ -49,7 +49,8 @@ class HammingComparatorTest extends PHPUnit\Framework\TestCase
     public function testExceptionThrownWhenStrandsAreDifferentLength()
     {
         $this->markTestSkipped();
-        $this->expectException('InvalidArgumentException', 'DNA strands must be of equal length.');
+        $this->expectException('InvalidArgumentException');
+        $this->expectExceptionMessage('DNA strands must be of equal length.');
         distance('GGACG', 'AGGACGTGG');
     }
 }

data/tracks/python/config.json

@@ -150,6 +150,18 @@
         "pattern_recognition"
       ]
     },
+    {
+      "uuid": "e9b0defc-dac5-11e7-9296-cec278b6b50a",
+      "slug": "armstrong-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "mathematics",
+        "algorithms",
+        "loops"
+      ]
+    },
     {
       "uuid": "4c408aab-80b9-475d-9c06-b01cd0fcd08f",
       "slug": "rotational-cipher",