trackler 2.2.1.58 → 2.2.1.59

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: aa66c91549abb0087fdc23e6f042092222585ec6
-  data.tar.gz: '043992d475673db6aad726d94da4b8539323e471'
+  metadata.gz: ed67c6391790bb62b8a9b5d6aafee1d403f8bd34
+  data.tar.gz: 415063bcd0265caa42ae9ba5c03d4fd13004b8e2
 SHA512:
-  metadata.gz: 64ca07c7338c0c3167adee155b8956f0fa1aa17f1ad0eb51c1626f3818d4405aeb5e16b7fe7438820de2440ec4bbca0261dc7f2081db9f438885e550d5646f59
-  data.tar.gz: 0e932c6b1405d8a573873a75ff4f78bacde1799292f57b23c27fcef8c041460c9a635785b5bd5461a821ee54806ecd18e1ce60992dad14fce79f74e6bb939561
+  metadata.gz: 261c39ecf0b278418a1df105613968e7f5761f939e13faabc30aca95e4499847caf64165936348b7a369bb6252366851c2168ec1358c35bb32bb608fa1b55fec
+  data.tar.gz: fcd9d3385a1629daf5294a467872046ea879d1ccf8e2c2e6176dfff322f44bc33872c7e961f8c10d8070108fd509326647cc8f39687c729faa1ff8ac3f4a4e9b

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.58"
+  VERSION = "2.2.1.59"
 end

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

@@ -1,6 +1,6 @@
 {
     "exercise": "isbn-verifier",
-    "version": "1.0.0",
+    "version": "1.1.0",
     "comments": [
         "An expected value of true indicates a valid ISBN-10, ",
         "whereas false means the ISBN-10 is invalid."
@@ -39,7 +39,7 @@
         {
             "description": "X is only valid as a check digit",
             "property": "isbn",
-            "input": "3-598-2X507-0",
+            "input": "3-598-2X507-9",
             "expected": false
         },
         {
@@ -75,7 +75,7 @@
         {
             "description": "too long isbn",
             "property": "isbn",
-            "input": "3-598-21507-XA",
+            "input": "3-598-21507-XX",
             "expected": false
         },
         {

data/tracks/c/docs/C_STYLE_GUIDE.md

@@ -122,6 +122,29 @@ void tearDown(void)
 
 Next are the test functions themselves. 
 The names of these functions use a `test_` prefix.
+Excepting the first, each test function should have `TEST_IGNORE();` as its first statement. 
+The first occurrence of this should be followed by the line comment `// delete this line to run test`.
+For example:
+
+```c
+void test_the_first(void)
+{
+   test_first_foo();
+}
+
+void test_the_second(void)
+{
+   TEST_IGNORE();               // delete this line to run test
+   test_second_foo();
+}
+
+void test_the_third(void)
+{
+   TEST_IGNORE();
+   char grade = 'A';
+   test_third_foo(grade);
+}
+```
 
 Last in the file is the `main()` function. 
 The function body of main follows a particular layout itself. 

data/tracks/erlang/config.json

@@ -372,6 +372,16 @@
 
       ]
     },
+    {
+      "uuid": "453aad9b-044e-473e-87c1-0193afb2cb13",
+      "slug": "custom-set",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 6,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "249d0c9f-dadc-4168-ba9b-0c6bfe83618d",
       "slug": "meetup",

data/tracks/erlang/exercises/custom-set/README.md

@@ -0,0 +1,54 @@
+# Custom Set
+
+Create a custom set type.
+
+Sometimes it is necessary to define a custom data structure of some
+type, like a set. In this exercise you will define your own set. How it
+works internally doesn't matter, as long as it behaves like a set of
+unique elements.
+
+## 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.
+
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/erlang/exercises/custom-set/include/exercism.hrl

@@ -0,0 +1,11 @@
+-include_lib("eunit/include/eunit.hrl").
+
+sut(Module) ->
+  {ok, Files} = file:list_dir("./src"),
+  case lists:member("example.erl", Files) of
+    true  -> example;
+    false -> Module
+  end.
+
+version_test() ->
+  ?assertMatch(?TEST_VERSION, ?TESTED_MODULE:test_version()).

data/tracks/erlang/exercises/custom-set/rebar.config

@@ -0,0 +1,30 @@
+%% Erlang compiler options
+{erl_opts, [debug_info]}.
+
+{deps, []}.
+
+{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/custom-set/src/custom_set.app.src

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

data/tracks/erlang/exercises/custom-set/src/custom_set.erl

@@ -0,0 +1,27 @@
+-module(custom_set).
+
+-export([add/2, contains/2, difference/2, disjoint/2, empty/1, equal/2, from_list/1, intersection/2, subset/2,
+	 union/2, test_version/0]).
+
+
+add(Elem, Set) -> undefined.
+
+contains(Elem, Set) -> undefined.
+
+difference(Set1, Set2) -> undefined.
+
+disjoint(Set1, Set2) -> undefined.
+
+empty(Set) -> undefined.
+
+equal(Set1, Set2) -> undefined.
+
+from_list(List) -> undefined.
+
+intersection(Set1, Set2) -> undefined.
+
+subset(Set1, Set2) -> undefined.
+
+union(Set1, Set2) -> undefined.
+
+test_version() -> 1.

data/tracks/erlang/exercises/custom-set/src/example.erl

@@ -0,0 +1,51 @@
+-module(example).
+
+-export([add/2, contains/2, difference/2, disjoint/2, empty/1, equal/2, from_list/1, intersection/2, subset/2,
+	 union/2, test_version/0]).
+
+-record(set, {s = #{}}).
+
+add(Elem, #set{s = S}) ->
+	#set{s = maps:put(Elem, true, S)}.
+
+contains(Elem, #set{s = S}) ->
+	maps:is_key(Elem, S).
+
+difference(#set{s = S1}, #set{s = S2}) ->
+	#set{s = lists:foldl(
+		fun (E, S) -> maps:remove(E, S) end, S1, maps:keys(S2))}.
+
+disjoint(Set1, Set2) ->
+	empty(intersection(Set1, Set2)).
+
+empty(#set{s = S}) ->
+	maps:size(S) =:= 0.
+
+equal(Set1, Set2) ->
+	Set1 == Set2.
+
+from_list(List) ->
+	#set{s = from_list(List, #{})}.
+
+from_list([], Acc) -> Acc;
+from_list([E|List], Acc) ->
+	from_list(List, maps:put(E, true, Acc)).
+
+intersection(#set{s = S1}, #set{s = S2}) ->
+	#set{s = lists:foldl(
+		fun (E, S) ->
+			case maps:is_key(E, S2) of
+				true -> maps:put(E, true, S);
+				false -> S
+			end
+		end, #{}, maps:keys(S1))}.
+
+subset(#set{s = S1}, #set{s = S2}) ->
+	lists:all(
+		fun (E) -> maps:is_key(E, S2) end,
+		maps:keys(S1)).
+
+union(#set{s = S1}, #set{s = S2}) ->
+	#set{s = maps:merge(S1, S2)}.
+
+test_version() -> 1.

data/tracks/erlang/exercises/custom-set/test/custom_set_tests.erl

@@ -0,0 +1,188 @@
+-module(custom_set_tests).
+
+% This file is automatically generated from the exercises canonical data.
+
+-define(TESTED_MODULE, (sut(custom_set))).
+-define(TEST_VERSION, 1).
+-include("exercism.hrl").
+
+
+sets_with_no_elements_are_empty_test() ->
+    ?assert(?TESTED_MODULE:empty(?TESTED_MODULE:from_list([]))).
+
+sets_with_elements_are_not_empty_test() ->
+    ?assertNot(?TESTED_MODULE:empty(?TESTED_MODULE:from_list([1]))).
+
+nothing_is_contained_in_an_empty_set_test() ->
+    ?assertNot(?TESTED_MODULE:contains(1,
+				       ?TESTED_MODULE:from_list([]))).
+
+when_the_element_is_in_the_set_test() ->
+    ?assert(?TESTED_MODULE:contains(1,
+				    ?TESTED_MODULE:from_list([1, 2, 3]))).
+
+when_the_element_is_not_in_the_set_test() ->
+    ?assertNot(?TESTED_MODULE:contains(4,
+				       ?TESTED_MODULE:from_list([1, 2, 3]))).
+
+empty_set_is_a_subset_of_another_empty_set_test() ->
+    ?assert(?TESTED_MODULE:subset(?TESTED_MODULE:from_list([]),
+				  ?TESTED_MODULE:from_list([]))).
+
+empty_set_is_a_subset_of_non_empty_set_test() ->
+    ?assert(?TESTED_MODULE:subset(?TESTED_MODULE:from_list([]),
+				  ?TESTED_MODULE:from_list([1]))).
+
+non_empty_set_is_not_a_subset_of_empty_set_test() ->
+    ?assertNot(?TESTED_MODULE:subset(?TESTED_MODULE:from_list([1]),
+				     ?TESTED_MODULE:from_list([]))).
+
+set_is_a_subset_of_set_with_exact_same_elements_test() ->
+    ?assert(?TESTED_MODULE:subset(?TESTED_MODULE:from_list([1,
+							    2, 3]),
+				  ?TESTED_MODULE:from_list([1, 2, 3]))).
+
+set_is_a_subset_of_larger_set_with_same_elements_test() ->
+    ?assert(?TESTED_MODULE:subset(?TESTED_MODULE:from_list([1,
+							    2, 3]),
+				  ?TESTED_MODULE:from_list([4, 1, 2, 3]))).
+
+set_is_not_a_subset_of_set_that_does_not_contain_its_elements_test() ->
+    ?assertNot(?TESTED_MODULE:subset(?TESTED_MODULE:from_list([1,
+							       2, 3]),
+				     ?TESTED_MODULE:from_list([4, 1, 3]))).
+
+the_empty_set_is_disjoint_with_itself_test() ->
+    ?assert(?TESTED_MODULE:disjoint(?TESTED_MODULE:from_list([]),
+				    ?TESTED_MODULE:from_list([]))).
+
+empty_set_is_disjoint_with_non_empty_set_test() ->
+    ?assert(?TESTED_MODULE:disjoint(?TESTED_MODULE:from_list([]),
+				    ?TESTED_MODULE:from_list([1]))).
+
+non_empty_set_is_disjoint_with_empty_set_test() ->
+    ?assert(?TESTED_MODULE:disjoint(?TESTED_MODULE:from_list([1]),
+				    ?TESTED_MODULE:from_list([]))).
+
+sets_are_not_disjoint_if_they_share_an_element_test() ->
+    ?assertNot(?TESTED_MODULE:disjoint(?TESTED_MODULE:from_list([1,
+								 2]),
+				       ?TESTED_MODULE:from_list([2, 3]))).
+
+sets_are_disjoint_if_they_share_no_elements_test() ->
+    ?assert(?TESTED_MODULE:disjoint(?TESTED_MODULE:from_list([1,
+							      2]),
+				    ?TESTED_MODULE:from_list([3, 4]))).
+
+empty_sets_are_equal_test() ->
+    ?assert(?TESTED_MODULE:equal(?TESTED_MODULE:from_list([]),
+				 ?TESTED_MODULE:from_list([]))).
+
+empty_set_is_not_equal_to_non_empty_set_test() ->
+    ?assertNot(?TESTED_MODULE:equal(?TESTED_MODULE:from_list([]),
+				    ?TESTED_MODULE:from_list([1, 2, 3]))).
+
+non_empty_set_is_not_equal_to_empty_set_test() ->
+    ?assertNot(?TESTED_MODULE:equal(?TESTED_MODULE:from_list([1,
+							      2, 3]),
+				    ?TESTED_MODULE:from_list([]))).
+
+sets_with_the_same_elements_are_equal_test() ->
+    ?assert(?TESTED_MODULE:equal(?TESTED_MODULE:from_list([1,
+							   2]),
+				 ?TESTED_MODULE:from_list([2, 1]))).
+
+sets_with_different_elements_are_not_equal_test() ->
+    ?assertNot(?TESTED_MODULE:equal(?TESTED_MODULE:from_list([1,
+							      2, 3]),
+				    ?TESTED_MODULE:from_list([1, 2, 4]))).
+
+add_to_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([3]),
+		 ?TESTED_MODULE:add(3, ?TESTED_MODULE:from_list([]))).
+
+add_to_non_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([1, 2, 3, 4]),
+		 ?TESTED_MODULE:add(3,
+				    ?TESTED_MODULE:from_list([1, 2, 4]))).
+
+adding_an_existing_element_does_not_change_the_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([1, 2, 3]),
+		 ?TESTED_MODULE:add(3,
+				    ?TESTED_MODULE:from_list([1, 2, 3]))).
+
+intersection_of_two_empty_sets_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:intersection(?TESTED_MODULE:from_list([]),
+					     ?TESTED_MODULE:from_list([]))).
+
+intersection_of_an_empty_set_and_non_empty_set_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:intersection(?TESTED_MODULE:from_list([]),
+					     ?TESTED_MODULE:from_list([3, 2,
+								       5]))).
+
+intersection_of_a_non_empty_set_and_an_empty_set_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:intersection(?TESTED_MODULE:from_list([1,
+								       2, 3,
+								       4]),
+					     ?TESTED_MODULE:from_list([]))).
+
+intersection_of_two_sets_with_no_shared_elements_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:intersection(?TESTED_MODULE:from_list([1,
+								       2, 3]),
+					     ?TESTED_MODULE:from_list([4, 5,
+								       6]))).
+
+intersection_of_two_sets_with_shared_elements_is_a_set_of_the_shared_elements_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([2, 3]),
+		 ?TESTED_MODULE:intersection(?TESTED_MODULE:from_list([1,
+								       2, 3,
+								       4]),
+					     ?TESTED_MODULE:from_list([3, 2,
+								       5]))).
+
+difference_of_two_empty_sets_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:difference(?TESTED_MODULE:from_list([]),
+					   ?TESTED_MODULE:from_list([]))).
+
+difference_of_empty_set_and_non_empty_set_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:difference(?TESTED_MODULE:from_list([]),
+					   ?TESTED_MODULE:from_list([3, 2,
+								     5]))).
+
+difference_of_a_non_empty_set_and_an_empty_set_is_the_non_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([1, 2, 3, 4]),
+		 ?TESTED_MODULE:difference(?TESTED_MODULE:from_list([1,
+								     2, 3, 4]),
+					   ?TESTED_MODULE:from_list([]))).
+
+difference_of_two_non_empty_sets_is_a_set_of_elements_that_are_only_in_the_first_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([1, 3]),
+		 ?TESTED_MODULE:difference(?TESTED_MODULE:from_list([3,
+								     2, 1]),
+					   ?TESTED_MODULE:from_list([2, 4]))).
+
+union_of_empty_sets_is_an_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([]),
+		 ?TESTED_MODULE:union(?TESTED_MODULE:from_list([]),
+				      ?TESTED_MODULE:from_list([]))).
+
+union_of_an_empty_set_and_non_empty_set_is_the_non_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([2]),
+		 ?TESTED_MODULE:union(?TESTED_MODULE:from_list([]),
+				      ?TESTED_MODULE:from_list([2]))).
+
+union_of_a_non_empty_set_and_empty_set_is_the_non_empty_set_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([1, 3]),
+		 ?TESTED_MODULE:union(?TESTED_MODULE:from_list([1, 3]),
+				      ?TESTED_MODULE:from_list([]))).
+
+union_of_non_empty_sets_contains_all_unique_elements_test() ->
+    ?assertEqual(?TESTED_MODULE:from_list([3, 2, 1]),
+		 ?TESTED_MODULE:union(?TESTED_MODULE:from_list([1, 3]),
+				      ?TESTED_MODULE:from_list([2, 3]))).