trackler 2.2.1.179 → 2.2.1.180

data/tracks/groovy/config.json

@@ -9,6 +9,7 @@
       "slug": "hello-world",
       "uuid": "30dff5e7-f2a4-4d7b-be1e-765091958a92",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": null

data/tracks/haxe/config.json

@@ -9,6 +9,7 @@
       "slug": "hello-world",
       "uuid": "3596bbf7-66f0-49c0-8c3e-3472455f90c7",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": null

data/tracks/perl5/exercises/leap/.meta/exercise-data.yaml

@@ -1,9 +1,9 @@
 exercise: Leap
-version: 3
+version: 4
 plan: 5
 subs: is_leap
 tests: |-
-  is is_leap($_->{input}{year}), $_->{expected}, $_->{description} foreach @{$C_DATA->{cases}};
+  ok !(is_leap($_->{input}{year}) xor $_->{expected}), $_->{description} foreach @{$C_DATA->{cases}};
 
 exercise_comment: '# The name of this exercise.'
 version_comment: '# The version we will be matching against the exercise.'
@@ -17,9 +17,7 @@ version_test_comment: |-
 example: |-
   sub is_leap {
     my $year = shift;
-    divisible_by($year, 400)
-      or divisible_by($year, 4) and !divisible_by($year, 100)
-      ? 1 : 0;
+    divisible_by($year, 400) or divisible_by($year, 4) and !divisible_by($year, 100);
   }
 
   sub divisible_by {

data/tracks/perl5/exercises/leap/.meta/solutions/Leap.pm

@@ -1,5 +1,5 @@
 # Declare package 'Leap' with version
-package Leap 3;
+package Leap 4;
 use strict;
 use warnings;
 use Exporter 'import';
@@ -7,9 +7,7 @@ our @EXPORT_OK = qw(is_leap);
 
 sub is_leap {
   my $year = shift;
-  divisible_by($year, 400)
-    or divisible_by($year, 4) and !divisible_by($year, 100)
-    ? 1 : 0;
+  divisible_by($year, 400) or divisible_by($year, 4) and !divisible_by($year, 100);
 }
 
 sub divisible_by {

data/tracks/perl5/exercises/leap/Leap.pm

@@ -1,5 +1,5 @@
 # Declare package 'Leap' with version
-package Leap 3;
+package Leap 4;
 use strict;
 use warnings;
 use Exporter 'import';

data/tracks/perl5/exercises/leap/leap.t

@@ -7,7 +7,7 @@ use lib $FindBin::Bin; # Look for the module inside the same directory as this t
 use Leap qw(is_leap);
 
 my $exercise = 'Leap'; # The name of this exercise.
-my $test_version = 3; # The version we will be matching against the exercise.
+my $test_version = 4; # The version we will be matching against the exercise.
 use Test::More tests => 5; # This is how many tests we expect to run.
 
 # If the exercise is updated, we want to make sure other people testing
@@ -23,7 +23,7 @@ if ($exercise_version != $test_version) {
 can_ok $exercise, 'import' or BAIL_OUT 'Cannot import subroutines from module';
 
 my $C_DATA = do { local $/; decode_json(<DATA>); };
-is is_leap($_->{input}{year}), $_->{expected}, $_->{description} foreach @{$C_DATA->{cases}};
+ok !(is_leap($_->{input}{year}) xor $_->{expected}), $_->{description} foreach @{$C_DATA->{cases}};
 
 __DATA__
 {

data/tracks/php/config.json

@@ -7,6 +7,7 @@
       "slug": "hello-world",
       "uuid": "56116aa6-e3d1-4122-a394-a7e0f6ab6fea",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [

data/tracks/plsql/config.json

@@ -8,6 +8,7 @@
       "slug": "hello-world",
       "uuid": "53156fc9-0945-f080-08a9-ce269bfc9121a5d2c5c",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": null

data/tracks/pony/config.json

@@ -7,6 +7,7 @@
       "slug": "hello-world",
       "uuid": "cc5f77d1-b94d-4a05-b205-08eaa00bf49e",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [

data/tracks/purescript/config.json

@@ -7,6 +7,7 @@
       "slug": "hello-world",
       "uuid": "c41a2961-f7ca-4eaf-83cf-48762fc39c06",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [

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

@@ -12,5 +12,21 @@
 
 {{ . }}
 {{ end }}
-## Submitting Incomplete Solutions
-It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
+```
+npm install
+```
+
+Open two shells, and in the first, start the build process.
+```
+npm start
+```
+
+In the second, start the tests running.
+```
+npm test
+```
+
+As you edit the code, the two processes will continually rebuild and rerun the tests.

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

@@ -5,14 +5,25 @@ Given a word and a list of possible anagrams, select the correct sublist.
 Given `"listen"` and a list of candidates like `"enlists" "google"
 "inlets" "banana"` the program should return a list containing
 `"inlets"`.
+## Source
 
-# Build
+Inspired by the Extreme Startup game [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
+
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm run build
+npm install
 ```
 
-# Build + Watch
+Open two shells, and in the first, start the build process.
+```
+npm start
+```
 
+In the second, start the tests running.
 ```
-npm run start
+npm test
 ```
+
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/armstrong-numbers/README.md

@@ -10,10 +10,9 @@ For example:
 - 154 is *not* an Armstrong number, because: `154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190`
 
 Write some code to determine whether a number is an Armstrong number.
+## Source
 
-## Getting Started
-For installation and learning resources, refer to the
-[exercism help page](http://exercism.io/languages/reasonml).
+Wikipedia [https://en.wikipedia.org/wiki/Narcissistic_number](https://en.wikipedia.org/wiki/Narcissistic_number)
 
 ## Building and testing
 You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
@@ -32,4 +31,4 @@ In the second, start the tests running.
 npm test
 ```
 
-As you edit the code, the two processes will continually rebuild and rerun the tests.
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/binary-search/README.md

@@ -33,18 +33,25 @@ found in the array and a special "not found" indication is returned.
 A binary search halves the number of items to check with each iteration,
 so locating an item (or determining its absence) takes logarithmic time.
 A binary search is a dichotomic divide and conquer search algorithm.
+## Source
 
-# Build
+Wikipedia [http://en.wikipedia.org/wiki/Binary_search_algorithm](http://en.wikipedia.org/wiki/Binary_search_algorithm)
+
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm run build
+npm install
 ```
 
-# Build + Watch
-
+Open two shells, and in the first, start the build process.
 ```
-npm run start
+npm start
 ```
 
+In the second, start the tests running.
+```
+npm test
+```
 
-# Editor
-If you use `vscode`, Press `Windows + Shift + B` it will build automatically
+As you edit the code, the two processes will continually rebuild and rerun the tests.

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

@@ -12,17 +12,25 @@ He says 'Fine. Be that way!' if you address him without actually saying
 anything.
 
 He answers 'Whatever.' to anything else.
+## Source
 
-# Build
+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)
+
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm run build
+npm install
 ```
 
-# Build + Watch
+Open two shells, and in the first, start the build process.
+```
+npm start
+```
 
+In the second, start the tests running.
 ```
-npm run start
+npm test
 ```
 
-# Editor
-If you use `vscode`, Press `Windows + Shift + B` it will build automatically
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/change/README.md

@@ -15,11 +15,9 @@ that the sum of the coins' value would equal the correct amount of change.
 - Does your algorithm work for any given set of coins?
 - Can you ask for negative change?
 - Can you ask for a change value smaller than the smallest coin value?
+## Source
 
-
-## Getting Started
-For installation and learning resources, refer to the
-[exercism help page](http://exercism.io/languages/reasonml).
+Software Craftsmanship - Coin Change Kata [https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata](https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata)
 
 ## Building and testing
 You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)

data/tracks/reasonml/exercises/hello-world/README.md

@@ -13,10 +13,9 @@ The objectives are simple:
 - Submit your solution and check it at the website.
 
 If everything goes well, you will be ready to fetch your first real exercise.
+## Source
 
-## Getting Started
-For installation and learning resources, refer to the
-[exercism help page](http://exercism.io/languages/reasonml).
+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)
 
 ## Building and testing
 You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)

data/tracks/reasonml/exercises/isogram/README.md

@@ -2,8 +2,7 @@
 
 Determine if a word or phrase is an isogram.
 
-An isogram (also known as a "nonpattern word") is a word or phrase without a repeating letter,
-however spaces and hyphens are allowed to appear multiple times.
+An isogram (also known as a "nonpattern word") is a word or phrase without a repeating letter, however spaces and hyphens are allowed to appear multiple times.
 
 Examples of isograms:
 
@@ -13,10 +12,9 @@ Examples of isograms:
 - six-year-old
 
 The word *isograms*, however, is not an isogram, because the s repeats.
+## Source
 
-## Getting Started
-For installation and learning resources, refer to the
-[exercism help page](http://exercism.io/languages/reasonml).
+Wikipedia [https://en.wikipedia.org/wiki/Isogram](https://en.wikipedia.org/wiki/Isogram)
 
 ## Building and testing
 You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
@@ -35,4 +33,4 @@ In the second, start the tests running.
 npm test
 ```
 
-As you edit the code, the two processes will continually rebuild and rerun the tests.
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/leap/README.md

@@ -1,4 +1,4 @@
-# Leap in ReasonML
+# Leap
 
 Given a year, report if it is a leap year.
 
@@ -25,15 +25,25 @@ For a delightful, four minute explanation of the whole leap year
 phenomenon, go watch [this youtube video][video].
 
 [video]: http://www.youtube.com/watch?v=xX96xng7sAE
+## Source
 
-# Build + Watch
+JavaRanch Cattle Drive, exercise 3 [http://www.javaranch.com/leap.jsp](http://www.javaranch.com/leap.jsp)
 
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm start
+npm install
 ```
 
-# Test + Watch
+Open two shells, and in the first, start the build process.
+```
+npm start
+```
 
+In the second, start the tests running.
 ```
 npm test
 ```
+
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/pangram/README.md

@@ -7,15 +7,25 @@ The best known English pangram is:
 
 The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case
 insensitive. Input will not contain non-ASCII symbols.
+## Source
 
-# Build + Watch
+Wikipedia [https://en.wikipedia.org/wiki/Pangram](https://en.wikipedia.org/wiki/Pangram)
 
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm start
+npm install
 ```
 
-# Test + Watch
+Open two shells, and in the first, start the build process.
+```
+npm start
+```
 
+In the second, start the tests running.
 ```
 npm test
 ```
+
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/phone-number/README.md

@@ -1,4 +1,5 @@
 # Phone Number
+
 Clean up user-entered phone numbers so that they can be sent SMS messages.
 
 The **North American Numbering Plan (NANP)** is a telephone numbering system used by many countries in North America like the United States, Canada or Bermuda. All NANP-countries share the same international country code: `1`.
@@ -26,18 +27,25 @@ should all produce the output
 `6139950253`
 
 **Note:** As this exercise only deals with telephone numbers used in NANP-countries, only 1 is considered a valid country code.
+## Source
+
+Event Manager by JumpstartLab [http://tutorials.jumpstartlab.com/projects/eventmanager.html](http://tutorials.jumpstartlab.com/projects/eventmanager.html)
 
-# Build
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm run build
+npm install
 ```
 
-# Build + Watch
-
+Open two shells, and in the first, start the build process.
 ```
-npm run start
+npm start
 ```
 
+In the second, start the tests running.
+```
+npm test
+```
 
-# Editor
-If you use `vscode`, Press `Windows + Shift + B` it will build automatically
+As you edit the code, the two processes will continually rebuild and rerun the tests.

data/tracks/reasonml/exercises/raindrops/README.md

@@ -16,18 +16,25 @@ Convert a number to a string, the contents of which depend on the number's facto
   - In raindrop-speak, this would be a "PlingPlang".
 - 34 has four factors: 1, 2, 17, and 34.
   - In raindrop-speak, this would be "34".
+## Source
 
-# Build
+A variation on a famous interview question intended to weed out potential candidates. [http://jumpstartlab.com](http://jumpstartlab.com)
+
+## Building and testing
+You will need the node package manager (npm) installed - download from [here](https://www.npmjs.com/get-npm)
+There is one time setup for each exercise, which may take a few minutes:
 ```
-npm run build
+npm install
 ```
 
-# Build + Watch
-
+Open two shells, and in the first, start the build process.
 ```
-npm run start
+npm start
 ```
 
+In the second, start the tests running.
+```
+npm test
+```
 
-# Editor
-If you use `vscode`, Press `Windows + Shift + B` it will build automatically
+As you edit the code, the two processes will continually rebuild and rerun the tests.