trackler 2.2.1.176 → 2.2.1.177

data/tracks/erlang/exercises/perfect-numbers/README.md

@@ -0,0 +1,59 @@
+Determine if a number is perfect, abundant, or deficient based on
+Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
+
+The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
+
+- **Perfect**: aliquot sum = number
+  - 6 is a perfect number because (1 + 2 + 3) = 6
+  - 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
+- **Abundant**: aliquot sum > number
+  - 12 is an abundant number because (1 + 2 + 3 + 4 + 6) = 16
+  - 24 is an abundant number because (1 + 2 + 3 + 4 + 6 + 8 + 12) = 36
+- **Deficient**: aliquot sum < number
+  - 8 is a deficient number because (1 + 2 + 4) = 7
+  - Prime numbers are deficient
+
+Implement a way to determine whether a given number is **perfect**. Depending on your language track, you may also need to implement a way to determine whether a given number is **abundant** or **deficient**.
+
+## 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/perfect-numbers/rebar.config

@@ -0,0 +1,30 @@
+%% Erlang compiler options
+{erl_opts, [debug_info]}.
+
+{deps, [{erl_exercism, "0.1.1"}]}.
+
+{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/perfect-numbers/src/example.erl

@@ -0,0 +1,35 @@
+-module(example).
+
+-export([classify/1, test_version/0]).
+
+classify(1) ->
+	deficient;
+
+classify(N) when N>1 ->
+	classify(N, aliquot(N));
+
+classify(_) ->
+	{error, "Classification is only possible for natural numbers."}.
+
+classify(N, N) ->
+	perfect;
+
+classify(N, Aliquot) when N<Aliquot ->
+	abundant;
+
+classify(_, _) ->
+	deficient.
+
+aliquot(N) ->
+	aliquot(N, N div 2, 0).
+
+aliquot(_, 0, Acc) ->
+	Acc;
+
+aliquot(N, D, Acc) when N rem D=:=0 ->
+	aliquot(N, D-1, Acc+D);
+
+aliquot(N, D, Acc) ->
+	aliquot(N, D-1, Acc).
+
+test_version() -> 1.

data/tracks/erlang/exercises/perfect-numbers/src/perfect_numbers.app.src

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

data/tracks/erlang/exercises/perfect-numbers/src/perfect_numbers.erl

@@ -0,0 +1,8 @@
+-module(perfect_numbers).
+
+-export([classify/1, test_version/0]).
+
+classify(N) ->
+	undefined.
+
+test_version() -> 1.

data/tracks/erlang/exercises/perfect-numbers/test/perfect_numbers_tests.erl

@@ -0,0 +1,48 @@
+%% based on canonical data version 1.1.0
+%% https://raw.githubusercontent.com/exercism/problem-specifications/master/exercises/perfect-numbers/canonical-data.json
+
+-module(perfect_numbers_tests).
+
+-define(TESTED_MODULE, (sut(perfect_numbers))).
+-define(TEST_VERSION, 1).
+-include_lib("erl_exercism/include/exercism.hrl").
+-include_lib("eunit/include/eunit.hrl").
+
+perfect_smallest_test() ->
+	?assertMatch(perfect, perfect_numbers:classify(6)).
+
+perfect_medium_test() ->
+	?assertMatch(perfect, perfect_numbers:classify(28)).
+
+perfect_large_test() ->
+	?assertMatch(perfect, perfect_numbers:classify(33550336)).
+
+abundant_smallest_test() ->
+	?assertMatch(abundant, perfect_numbers:classify(12)).
+
+abundant_medium_test() ->
+	?assertMatch(abundant, perfect_numbers:classify(30)).
+
+abundant_large_test() ->
+	?assertMatch(abundant, perfect_numbers:classify(33550335)).
+
+deficient_smallest_prime_test() ->
+	?assertMatch(deficient, perfect_numbers:classify(2)).
+
+deficient_smallest_non_prime_test() ->
+	?assertMatch(deficient, perfect_numbers:classify(4)).
+
+deficient_medium_test() ->
+	?assertMatch(deficient, perfect_numbers:classify(32)).
+
+deficient_large_test() ->
+	?assertMatch(deficient, perfect_numbers:classify(33550337)).
+
+deficient_edge_case_1_test() ->
+	?assertMatch(deficient, perfect_numbers:classify(1)).
+
+invalid_zero_test() ->
+	?assertMatch({error, "Classification is only possible for natural numbers."}, perfect_numbers:classify(0)).
+
+invalid_negative_test() ->
+	?assertMatch({error, "Classification is only possible for natural numbers."}, perfect_numbers:classify(-1)).

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

@@ -0,0 +1,70 @@
+> There are 10 types of people in the world: Those who understand
+> binary, and those who don't.
+
+You and your fellow cohort of those in the "know" when it comes to
+binary decide to come up with a secret "handshake".
+
+```text
+1 = wink
+10 = double blink
+100 = close your eyes
+1000 = jump
+
+
+10000 = Reverse the order of the operations in the secret handshake.
+```
+
+Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.
+
+Here's a couple of examples:
+
+Given the input 3, the function would return the array
+["wink", "double blink"] because 3 is 11 in binary.
+
+Given the input 19, the function would return the array
+["double blink", "wink"] because 19 is 10011 in binary.
+Notice that the addition of 16 (10000 in binary)
+has caused the array to be reversed.
+
+## 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/secret-handshake/rebar.config

@@ -0,0 +1,30 @@
+%% Erlang compiler options
+{erl_opts, [debug_info]}.
+
+{deps, [{erl_exercism, "0.1.1"}]}.
+
+{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/secret-handshake/src/example.erl

@@ -0,0 +1,19 @@
+-module(example).
+
+-export([commands/1, test_version/0]).
+
+commands(N) when N band 2#10000=:=2#10000 ->
+	commands(N, [2#1000, 2#0100, 2#0010, 2#0001]);
+
+commands(N) ->
+	commands(N, [2#0001, 2#0010, 2#0100, 2#1000]).
+
+commands(N, Bits) ->
+	[action(X) || X <- Bits, N band X=:=X].
+
+action(2#0001) -> "wink";
+action(2#0010) -> "double blink";
+action(2#0100) -> "close your eyes";
+action(2#1000) -> "jump".
+
+test_version() -> 1.

data/tracks/erlang/exercises/secret-handshake/src/secret_handshake.app.src

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

data/tracks/erlang/exercises/secret-handshake/src/secret_handshake.erl

@@ -0,0 +1,8 @@
+-module(secret_handshake).
+
+-export([commands/1, test_version/0]).
+
+commands(N) ->
+	undefined.
+
+test_version() -> 1.

data/tracks/erlang/exercises/secret-handshake/test/secret_handshake_tests.erl

@@ -0,0 +1,45 @@
+%% based on canonical data version 1.2.0
+%% https://raw.githubusercontent.com/exercism/problem-specifications/master/exercises/secret-handshake/canonical-data.json
+
+-module(secret_handshake_tests).
+
+-define(TESTED_MODULE, (sut(secret_handshake))).
+-define(TEST_VERSION, 1).
+-include_lib("erl_exercism/include/exercism.hrl").
+-include_lib("eunit/include/eunit.hrl").
+
+wink_for_1_test() ->
+	?assertMatch(["wink"], secret_handshake:commands(1)).
+
+double_blink_for_10_test() ->
+	?assertMatch(["double blink"], secret_handshake:commands(2)).
+
+close_your_eyes_for_100_test() ->
+	?assertMatch(["close your eyes"], secret_handshake:commands(4)).
+
+jump_for_1000_test() ->
+	?assertMatch(["jump"], secret_handshake:commands(8)).
+
+combine_two_actions_test() ->
+	?assertMatch(["wink", "double blink"], secret_handshake:commands(3)).
+
+reverse_two_actions_test() ->
+	?assertMatch(["double blink", "wink"], secret_handshake:commands(19)).
+
+reversing_one_action_gives_the_same_action_test() ->
+	?assertMatch(["jump"], secret_handshake:commands(24)).
+
+reversing_no_actions_gives_no_actions_test() ->
+	?assertMatch([], secret_handshake:commands(16)).
+
+all_possible_actions_test() ->
+	?assertMatch(["wink", "double blink", "close your eyes", "jump"], secret_handshake:commands(15)).
+
+reverse_all_possible_actions_test() ->
+	?assertMatch(["jump", "close your eyes", "double blink", "wink"], secret_handshake:commands(31)).
+
+do_nothing_for_zero_test() ->
+	?assertMatch([], secret_handshake:commands(0)).
+
+version_test() ->
+	?assertMatch(?TEST_VERSION, secret_handshake:test_version()).

data/tracks/go/.travis.yml

@@ -19,7 +19,7 @@ sudo: false
 # it is better citizenship to not test the additional versions.
 go:
   - 1.9.x
-  - 1.x
+  - 1.10.x
   - tip
 
 # Travis runs in a 64 bit environment but beginning with Go 1.5, building a
@@ -61,7 +61,7 @@ script:
 matrix:
   include:
     # Keep this in sync with the latest version.
-    - go: 1.x
+    - go: 1.10.x
       env: STATIC_CHECKERS=1
   allow_failures:
     - go: tip

data/tracks/nim/config.json

@@ -1,15 +1,15 @@
 {
   "language": "Nim",
   "active": false,
-  "blurb": "",
+  "blurb": "Nim is a system and applications programming language that is statically typed and compiled, designed to be efficient, expressive, and elegant. Being general-purpose it can fill a wide range of uses but has found a niche in game development and systems programming including embedded systems.",
   "exercises": [
     {
       "slug": "hello-world",
       "uuid": "4817a6c0-6c9f-41ce-b53e-54ee3c0a6e40",
       "core": true,
+      "auto_approve": true,
       "unlocked_by": null,
       "difficulty": 1,
-      "auto_approve": true,
       "topics": [
         "conditionals",
         "optional_values",

data/tracks/nim/docs/SNIPPET.txt

@@ -1,2 +1,5 @@
 proc helloWorld*(name="World"): string =
-  return "Hello, " & name & "!"
+  "Hello, " & name & "!"
+
+let greeting = helloWorld("Exercism")
+echo greeting

data/tracks/python/config.json

@@ -1354,6 +1354,18 @@
         "conditionals"
       ]
     },
+    {
+      "slug": "ledger",
+      "uuid": "c2e9d08d-1a58-4d9a-a797-cea265973bd4",
+      "core": false,
+      "unlocked_by": "markdown",
+      "difficulty": 5,
+      "topics": [
+        "globalization",
+        "refactoring",
+        "strings"
+      ]
+    },
     {
       "slug": "accumulate",
       "uuid": "e7351e8e-d3ff-4621-b818-cd55cf05bffd",