trackler 2.2.1.176 → 2.2.1.177

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 706da02c4c4f09afe346807e4ff36e9a50753bb2
-  data.tar.gz: d77088f03e5550c99f07516b0c170876af7148df
+  metadata.gz: 2e5bcb62b38646413cb1b774d068463bb8f4a70c
+  data.tar.gz: 955ab5796404df47072cdb28d09600e3edbff1bd
 SHA512:
-  metadata.gz: 12eb93cab8231e066f465388d5311a7ad0cc2deb1eced143d05fb77fb4e37c458faf60c43baca9871fa96162319d003463d08e37290e2124be5a82016b0fc952
-  data.tar.gz: 2c0df862a40b1648781cc844f1c94445426c2b997e0d064ca4d643f8c3915cbf5f41323697b399bdb68f88fd561981efce0d96e562489cfa03459016533624e4
+  metadata.gz: fd13a222bd29b3d53520d44f84b0cee0fad4dedf5b27de00143c1738689a5de48b74c1f17ceb92bcbb2f260d494b9b1f973b6d03574659c2cbac50a9e0a61f89
+  data.tar.gz: 1f33b0a29f2a0800d0ef2151dd0f9a82b0659e504a2557d594b6d168f7d9587a4dd64d43764dea2f4bb2b13adfd6dc858088e116008f14377e404627e64c1a8f

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.176"
+  VERSION = "2.2.1.177"
 end

data/problem-specifications/exercises/isbn-verifier/canonical-data.json

@@ -1,6 +1,6 @@
 {
     "exercise": "isbn-verifier",
-    "version": "2.6.0",
+    "version": "2.7.0",
     "comments": [
         "An expected value of true indicates a valid ISBN-10, ",
         "whereas false means the ISBN-10 is invalid."
@@ -102,14 +102,6 @@
             },
             "expected": false
         },
-        {
-            "description": "too long isbn",
-            "property": "isValid",
-            "input": {
-              "isbn": "3-598-21507-XX"
-            },
-            "expected": false
-        },
         {
             "description": "check digit of X should not be used for 0",
             "property": "isValid",
@@ -141,6 +133,14 @@
                 "isbn": "3132P34035"
             },
             "expected": false
+        },
+        {
+            "description": "input is too long but contains a valid isbn",
+            "property": "isValid",
+            "input": {
+                "isbn": "98245726788"
+            },
+            "expected": false
         }
     ]
 }

data/tracks/bash/docs/LEARNING.md

@@ -1 +1 @@
-Bash is a very powerful Unix shell and command scripting language. The man page for Bash is a well written and informational document. Additional guides, information, and examples can be found at the Linux Documentation Project. Shellcheck.net provides a web interface (and binary for some distros) that checks shell scripts for errors or common issues and provides information on how to best correct them.  
+Bash is a very powerful Unix shell and command scripting language. The man page for Bash is a well written and informational document. Additional guides, information, and examples can be found at [Greg's Wiki](http://mywiki.wooledge.org/BashGuide) and the [GNU Bash Manual](http://gnu.org/s/bash/manual). Shellcheck.net provides a web interface (and binary for some distros) that checks shell scripts for errors or common issues and provides information on how to best correct them.

data/tracks/bash/docs/RESOURCES.md

@@ -1,3 +1,7 @@
-- [Bash man page](http://linux.die.net/man/1/bash)  
-- [The Linux Documentation Project Guides](http://tldp.org/guides.html)  
-- [Shellcheck provides shell script guidelines and help](http://www.shellcheck.net/)  
+- Bash man page: to view it, type `man bash` in a terminal.
+- [Bash Guide](http://mywiki.wooledge.org/BashGuide)
+- [Bash FAQ](http://mywiki.wooledge.org/BashFAQ)
+- [Bash Pitfalls](https://mywiki.wooledge.org/BashPitfalls)
+- [GNU Bash Manual](http://gnu.org/s/bash/manual)
+- [Bash-Hackers Wiki](http://wiki.bash-hackers.org/)
+- [Shellcheck provides shell script guidelines and help](http://www.shellcheck.net/)

data/tracks/clojure/docs/RESOURCES.md

@@ -6,4 +6,4 @@ learning Clojure; here is a short list.
 - [Learn Clojure](http://learn-clojure.com/)
 - [Clojure Docs](https://clojuredocs.org/)
 - [Brave Clojure](http://www.braveclojure.com/)
-- [4Clojure](https://www.4clojure.com/)
+- [4Clojure](http://www.4clojure.com/)

data/tracks/crystal/config.json

@@ -8,6 +8,7 @@
       "slug": "hello-world",
       "uuid": "4078cf4d-4361-4c55-aa18-63a3fe269be1",
       "core": false,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
       "topics": []

data/tracks/crystal/docs/ABOUT.md

@@ -1,4 +1,6 @@
-Crystal is a compiled language that is currently in the alpha stages of development. These are some of the language's goals:
+Crystal is a compiled language that is currently in the alpha stages of development. 
+These are some of the language's goals:
+
 * Ruby-inspired syntax.
 
 * Statically type-checked but without having to specify the type of variables or method arguments.

data/tracks/crystal/exercises/gigasecond/spec/gigasecond_spec.cr

@@ -4,28 +4,28 @@ require "../src/*"
 describe "Gigasecond" do
   describe "#from" do
     it "finds gigsecond from 2011_04_25" do
-      result = Gigasecond.from(Time.new(2011, 4, 25, 0, 0, 0))
-      result.should eq Time.new(2043, 1, 1, 1, 46, 40)
+      result = Gigasecond.from(Time.utc(2011, 4, 25, 0, 0, 0))
+      result.should eq Time.utc(2043, 1, 1, 1, 46, 40)
     end
 
     pending "finds gigsecond from 1977_06_13" do
-      result = Gigasecond.from(Time.new(1977, 6, 13, 0, 0, 0))
-      result.should eq Time.new(2009, 2, 19, 1, 46, 40)
+      result = Gigasecond.from(Time.utc(1977, 6, 13, 0, 0, 0))
+      result.should eq Time.utc(2009, 2, 19, 1, 46, 40)
     end
 
     pending "finds gigsecond from 1959_07_19" do
-      result = Gigasecond.from(Time.new(1959, 7, 19, 0, 0, 0))
-      result.should eq Time.new(1991, 3, 27, 1, 46, 40)
+      result = Gigasecond.from(Time.utc(1959, 7, 19, 0, 0, 0))
+      result.should eq Time.utc(1991, 3, 27, 1, 46, 40)
     end
 
     pending "finds gigsecond with full_time specified" do
-      result = Gigasecond.from(Time.new(2015, 1, 24, 22, 0, 0))
-      result.should eq Time.new(2046, 10, 2, 23, 46, 40)
+      result = Gigasecond.from(Time.utc(2015, 1, 24, 22, 0, 0))
+      result.should eq Time.utc(2046, 10, 2, 23, 46, 40)
     end
 
     pending "finds gigsecond with full_time with day rollover" do
-      result = Gigasecond.from(Time.new(2015, 1, 24, 23, 59, 59))
-      result.should eq Time.new(2046, 10, 3, 1, 46, 39)
+      result = Gigasecond.from(Time.utc(2015, 1, 24, 23, 59, 59))
+      result.should eq Time.utc(2046, 10, 3, 1, 46, 39)
     end
 
     pending "test_with_your_birthday" do

data/tracks/delphi/exercises/isbn-verifier/uTestISBNVerifier.pas

@@ -5,7 +5,7 @@ uses
   DUnitX.TestFramework;
 
 const
-  CanonicalVersion = '2.6.0';
+  CanonicalVersion = '2.7.0';
 
 type
   [TestFixture]
@@ -59,10 +59,6 @@ type
     [Ignore]
     procedure isbn_without_check_digit;
 
-    [Test]
-    [Ignore]
-    procedure too_long_isbn;
-
     [Test]
     [Ignore]
     procedure check_digit_of_X_should_not_be_used_for_0;
@@ -78,6 +74,10 @@ type
     [Test]
     [Ignore]
     procedure invalid_characters_are_not_ignored;
+
+    [Test]
+    [Ignore]
+    procedure input_is_too_long_but_contains_a_valid_isbn;
   end;
 
 implementation
@@ -135,9 +135,9 @@ begin
   Assert.IsTrue(TIsbn.isValid('359821507X'));
 end;
 
-procedure ISBNVerifierTest.too_long_isbn;
+procedure ISBNVerifierTest.input_is_too_long_but_contains_a_valid_isbn;
 begin
-  Assert.IsFalse(TIsbn.isValid('3-598-21507-XX'));
+  Assert.IsFalse(TIsbn.isValid('98245726788'));
 end;
 
 procedure ISBNVerifierTest.too_long_isbn_and_no_dashes;

data/tracks/erlang/config.json

@@ -119,6 +119,18 @@
         "time"
       ]
     },
+    {
+      "slug": "secret-handshake",
+      "uuid": "580309f9-65f1-480b-bdb6-c14846963c33",
+      "core": false,
+      "unlocked_by": "raindrops",
+      "difficulty": 1,
+      "topics": [
+        "control_flow_conditionals",
+        "pattern_matching",
+        "strings"
+      ]
+    },
     {
       "slug": "grains",
       "uuid": "c3070adc-d434-4989-8d6b-d9e483e32d1c",
@@ -199,6 +211,17 @@
         "mathematics"
       ]
     },
+    {
+      "slug": "perfect-numbers",
+      "uuid": "8c58533a-7a1f-11e8-adc0-fa7ae01bbebc",
+      "core": false,
+      "unlocked_by": "collatz-conjecture",
+      "difficulty": 2,
+      "topics": [
+        "integers",
+        "mathematics"
+      ]
+    },
     {
       "slug": "armstrong-numbers",
       "uuid": "a639ce2f-48e3-46cd-9d11-955ba2a9eaaa",
@@ -517,6 +540,19 @@
         "types"
       ]
     },
+    {
+      "slug": "minesweeper",
+      "uuid": "2cf5d5ba-9820-4918-ac91-811b2a434655",
+      "core": false,
+      "unlocked_by": "accumulate",
+      "difficulty": 7,
+      "topics": [
+        "lists",
+        "parsing",
+        "strings",
+        "transforming"
+      ]
+    },
     {
       "slug": "beer-song",
       "uuid": "2fedc6bf-6006-4c2d-bba7-9c66265b6f62",

data/tracks/erlang/exercises/armstrong-numbers/test/armstrong_numbers_tests.erl

@@ -3,7 +3,7 @@
 
 -module(armstrong_numbers_tests).
 
--define(TESTED_MODULE, (sut(<erlangified_slug_name>))).
+-define(TESTED_MODULE, (sut(armstrong_numbers))).
 -define(TEST_VERSION, 1).
 -include_lib("erl_exercism/include/exercism.hrl").
 -include_lib("eunit/include/eunit.hrl").

data/tracks/erlang/exercises/minesweeper/README.md

@@ -0,0 +1,68 @@
+Add the numbers to a minesweeper board.
+
+Minesweeper is a popular game where the user has to find the mines using
+numeric hints that indicate how many mines are directly adjacent
+(horizontally, vertically, diagonally) to a square.
+
+In this exercise you have to create some code that counts the number of
+mines adjacent to a square and transforms boards like this (where `*`
+indicates a mine):
+
+    +-----+
+    | * * |
+    |  *  |
+    |  *  |
+    |     |
+    +-----+
+
+into this:
+
+    +-----+
+    |1*3*1|
+    |13*31|
+    | 2*2 |
+    | 111 |
+    +-----+
+
+## Running tests
+
+In order to run the tests, issue the following command from the exercise
+directory:
+
+For running the tests provided, `rebar3` is used as it is the official build and
+dependency management tool for erlang now. Please refer to [the tracks installation
+instructions](http://exercism.io/languages/erlang/installation) on how to do that.
+
+In order to run the tests, you can issue the following command from the exercise
+directory.
+
+```bash
+$ rebar3 eunit
+```
+
+### Test versioning
+
+Each problem defines a macro `TEST_VERSION` in the test file and
+verifies that the solution defines and exports a function `test_version`
+returning that same value.
+
+To make tests pass, add the following to your solution:
+
+```erlang
+-export([test_version/0]).
+
+test_version() ->
+  1.
+```
+
+The benefit of this is that reviewers can see against which test version
+an iteration was written if, for example, a previously posted solution
+does not solve the current problem or passes current tests.
+
+## Questions?
+
+For detailed information about the Erlang track, please refer to the
+[help page](http://exercism.io/languages/erlang) on the Exercism site.
+This covers the basic information on setting up the development
+environment expected by the exercises.
+

data/tracks/erlang/exercises/minesweeper/rebar.config

@@ -0,0 +1,30 @@
+%% Erlang compiler options
+{erl_opts, [debug_info]}.
+
+{deps, [{erl_exercism, "0.1.2"}]}.
+
+{dialyzer, [
+  {warnings, [underspecs, no_return]},
+  {get_warnings, true},
+  {plt_apps, top_level_deps}, % top_level_deps | all_deps
+  {plt_extra_apps, []},
+  {plt_location, local}, % local | "/my/file/name"
+  {plt_prefix, "rebar3"},
+  {base_plt_apps, [stdlib, kernel, crypto]},
+  {base_plt_location, global}, % global | "/my/file/name"
+  {base_plt_prefix, "rebar3"}
+]}.
+
+%% eunit:test(Tests)
+{eunit_tests, []}.
+%% Options for eunit:test(Tests, Opts)
+{eunit_opts, [verbose]}.
+
+%% == xref ==
+
+{xref_warnings, true}.
+
+%% xref checks to run
+{xref_checks, [undefined_function_calls, undefined_functions,
+  locals_not_used, exports_not_used,
+  deprecated_function_calls, deprecated_functions]}.

data/tracks/erlang/exercises/minesweeper/src/example.erl

@@ -0,0 +1,76 @@
+-module(example).
+
+-export([annotate/1, test_version/0]).
+
+%% no rows
+annotate([]) ->
+	[];
+
+%% no columns
+annotate(Minefield=[""|_]) ->
+	Minefield;
+
+%% proper minefield
+annotate(Minefield) ->
+	process_minefield(extend(Minefield)).
+
+
+%% surround the actual minefield with non-mines
+%% the rows and columns of the extended minefield will be implicitly reversed
+extend(Minefield=[R|_]) ->
+	EdgeRow=[16#20 || _ <- lists:seq(1, length(R)+2)],
+	[EdgeRow|extend(Minefield, [EdgeRow])].
+
+extend([], Acc) ->
+	Acc;
+
+extend([Row|More], Acc) ->
+	ExtendedRow=[16#20|lists:reverse([16#20|Row])],
+	extend(More, [ExtendedRow|Acc]).
+
+
+%% process the (extended) minefield
+%% the rows and columns of the processed minefield will be implicitly reversed,
+%% thereby restoring the original ordering
+%% three rows need to be considered: the previous, the current, and the next
+process_minefield(Minefield) ->
+	process_minefield(Minefield, []).
+
+%% only two rows left, at end of minefield
+process_minefield([_, _], Acc) ->
+	Acc;
+
+%% at least 3 rows left, process them
+process_minefield([PrevRow|More=[CurRow, NextRow|_]], Acc) ->
+	process_minefield(More, [process_row(PrevRow, CurRow, NextRow)|Acc]).
+
+
+%% process a row of the minefield
+%% three columns of the previous and next rows and two of the current row need to be considered
+process_row(PrevRow, CurRow, NextRow) ->
+	process_row(PrevRow, CurRow, NextRow, []).
+
+%% only two columns left, at end of row
+process_row([_, _], [_, _], [_, _], Acc) ->
+	Acc;
+
+%% current element is a mine, don't change it
+process_row([_|MorePrev], [_|MoreCur=[$*|_]], [_|MoreNext], Acc) ->
+	process_row(MorePrev, MoreCur, MoreNext, [$*|Acc]);
+
+%% current element is not a mine, count surrounding mines, translate to character
+process_row([PrevPrev|MorePrev=[PrevCur, PrevNext|_]], [CurPrev|MoreCur=[_, CurNext|_]], [NextPrev|MoreNext=[NextCur, NextNext|_]],  Acc) ->
+	N=lists:foldl(
+		fun ($*, Count) -> Count+1; (16#20, Count) -> Count end,
+		0,
+		[PrevPrev, PrevCur, PrevNext, CurPrev, CurNext, NextPrev, NextCur, NextNext]
+	),
+	process_row(MorePrev, MoreCur, MoreNext, [count_to_char(N)|Acc]).
+
+
+%% translate a count into a character
+count_to_char(0) -> 16#20;
+count_to_char(N) -> $0+N.
+	
+
+test_version() -> 1.

data/tracks/erlang/exercises/minesweeper/src/minesweeper.app.src

@@ -0,0 +1,9 @@
+{application, minesweeper,
+  [{description, "exercism.io - minesweeper"},
+    {vsn, "0.0.1"},
+    {modules, []},
+    {registered, []},
+    {applications, [kernel,
+      stdlib]},
+    {env, []}
+]}.

data/tracks/erlang/exercises/minesweeper/src/minesweeper.erl

@@ -0,0 +1,8 @@
+-module(minesweeper).
+
+-export([annotate/1, test_version/0]).
+
+annotate(Minefield) ->
+	undefined.
+
+test_version() -> 1.

data/tracks/erlang/exercises/minesweeper/test/minesweeper_tests.erl

@@ -0,0 +1,154 @@
+%% based on canonical data version 1.1.0
+%% https://raw.githubusercontent.com/exercism/problem-specifications/master/exercises/minesweeper/canonical-data.json
+
+-module(minesweeper_tests).
+
+-define(TESTED_MODULE, (sut(minesweeper))).
+-define(TEST_VERSION, 1).
+-include_lib("erl_exercism/include/exercism.hrl").
+-include_lib("eunit/include/eunit.hrl").
+
+no_rows_test() ->
+	Input=[],
+	Expected=[],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+no_columns_test() ->
+	Input=[""],
+	Expected=[""],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+no_mines_test() ->
+	Input=[
+		"   ",
+		"   ",
+		"   "
+	],
+	Expected=[
+		"   ",
+		"   ",
+		"   "
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+only_mines_test() ->
+	Input=[
+		"***",
+		"***",
+		"***"
+	],
+	Expected=[
+		"***",
+		"***",
+		"***"
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+mine_surrounded_by_spaces_test() ->
+	Input=[
+		"   ",
+		" * ",
+		"   "
+	],
+	Expected=[
+		"111",
+		"1*1",
+		"111"
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+space_surrounded_by_mines_test() ->
+	Input=[
+		"***",
+		"* *",
+		"***"
+	],
+	Expected=[
+		"***",
+		"*8*",
+		"***"
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+horizontal_line_test() ->
+	Input=[" * * "],
+	Expected=["1*2*1"],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+horizontal_line_mines_at_edges_test() ->
+	Input=["*   *"],
+	Expected=["*1 1*"],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+vertical_line_test() ->
+	Input=[
+		" ",
+		"*",
+		" ",
+		"*",
+		" "
+	],
+	Expected=[
+		"1",
+		"*",
+		"2",
+		"*",
+		"1"
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+vertical_line_mines_at_edges_test() ->
+	Input=[
+		"*",
+		" ",
+		" ",
+		" ",
+		"*"
+	],
+	Expected=[
+		"*",
+		"1",
+		" ",
+		"1",
+		"*"
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+cross_test() ->
+	Input=[
+		"  *  ",
+		"  *  ",
+		"*****",
+		"  *  ",
+		"  *  "
+	],
+	Expected=[
+		" 2*2 ",
+		"25*52",
+		"*****",
+		"25*52",
+		" 2*2 "
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+large_minefield_test() ->
+	Input=[
+		" *  * ",
+		"  *   ",
+		"    * ",
+		"   * *",
+		" *  * ",
+		"      "
+	],
+	Expected=[
+		"1*22*1",
+		"12*322",
+		" 123*2",
+		"112*4*",
+		"1*22*2",
+		"111111"
+	],
+	?assertMatch(Expected, minesweeper:annotate(Input)).
+
+version_test() ->
+	?assertMatch(?TEST_VERSION, minesweeper:test_version()).