trackler 2.2.1.58 → 2.2.1.59

data/tracks/erlang/testgen/src/tgen_custom-set.erl

@@ -0,0 +1,98 @@
+-module('tgen_custom-set').
+
+-behaviour(tgen).
+
+-export([
+    available/0,
+    version/0,
+    generate_test/1
+]).
+
+-spec available() -> true.
+available() ->
+    true.
+
+version() -> 1.
+
+generate_test(#{description := _, cases := Cases}) ->
+    rewrap(lists:flatten(lists:map(fun generate_test/1, Cases)), {[], []});
+generate_test(F=#{description := Desc, expected := Exp, property := Prop, set1 := Set1, set2 := Set2}) when is_list(Exp) ->
+    TestName = tgen:to_test_name(Desc),
+    Property = binary_to_list(Prop),
+
+    Fn = tgs:simple_fun(TestName, [
+        tgs:call_macro("assertEqual", [
+            tgs:call_macro("TESTED_MODULE:from_list", [
+                tgs:value(Exp)]),
+            tgs:call_macro("TESTED_MODULE:" ++ Property, [
+                tgs:call_macro("TESTED_MODULE:from_list", [tgs:value(Set1)]),
+                tgs:call_macro("TESTED_MODULE:from_list", [tgs:value(Set2)])])])]),
+
+    {ok, Fn, [{Property, ["Set1", "Set2"]}]};
+generate_test(F=#{description := Desc, expected := Exp, property := Prop, set1 := Set1, set2 := Set2}) when Exp =:= true; Exp =:= false ->
+    TestName = tgen:to_test_name(Desc),
+    Property = binary_to_list(Prop),
+
+    Assert = case Exp of
+        true -> "assert";
+        false -> "assertNot"
+    end,
+
+    Fn = tgs:simple_fun(TestName, [
+        tgs:call_macro(Assert, [
+            tgs:call_macro("TESTED_MODULE:" ++ Property, [
+                tgs:call_macro("TESTED_MODULE:from_list", [tgs:value(Set1)]),
+                tgs:call_macro("TESTED_MODULE:from_list", [tgs:value(Set2)])])])]),
+
+    {ok, Fn, [{Property, ["Set1", "Set2"]}, {"from_list", ["List"]}]};
+generate_test(#{description := Desc, expected := Exp, property := Prop, set := Set, element := Elem}) when is_list(Exp) ->
+    TestName = tgen:to_test_name(Desc),
+    Property = binary_to_list(Prop),
+
+    Fn = tgs:simple_fun(TestName, [
+        tgs:call_macro("assertEqual", [
+            tgs:call_macro("TESTED_MODULE:from_list", [
+                tgs:value(Exp)]),
+            tgs:call_macro("TESTED_MODULE:" ++ Property, [
+                tgs:value(Elem),
+                tgs:call_macro("TESTED_MODULE:from_list", [
+                    erl_syntax:abstract(Set)])])])]),
+
+    {ok, Fn, [{Property, ["Elem", "Set"]}, {"from_list", ["List"]}]};
+generate_test(#{description := Desc, expected := Exp, property := Prop, set := Set, element := Elem}) when Exp =:= true; Exp =:= false ->
+    TestName = tgen:to_test_name(Desc),
+    Property = binary_to_list(Prop),
+
+    Assert = case Exp of
+        true -> "assert";
+        false -> "assertNot"
+    end,
+
+    Fn = tgs:simple_fun(TestName, [
+        tgs:call_macro(Assert, [
+            tgs:call_macro("TESTED_MODULE:" ++ Property, [
+                tgs:value(Elem),
+                tgs:call_macro("TESTED_MODULE:from_list", [
+                    erl_syntax:abstract(Set)])])])]),
+
+    {ok, Fn, [{Property, ["Elem", "Set"]}, {"from_list", ["List"]}]};
+generate_test(#{description := Desc, expected := Exp, property := <<"empty">>, set := Set}) when Exp =:= true; Exp =:= false ->
+    TestName = tgen:to_test_name(Desc),
+    Property = binary_to_list(<<"empty">>),
+
+    Assert = case Exp of
+        true -> "assert";
+        false -> "assertNot"
+    end,
+
+    Fn = tgs:simple_fun(TestName, [
+        tgs:call_macro(Assert, [
+            tgs:call_macro("TESTED_MODULE:" ++ Property, [
+                tgs:call_macro("TESTED_MODULE:from_list", [
+                    tgs:value(Set)])])])]),
+
+    {ok, Fn, [{Property, ["Set"]}, {"from_list", ["List"]}]}.
+
+rewrap([], {Fns, Props}) -> {ok, lists:reverse(Fns), Props};
+rewrap([{ok, Fn, Props}|Tail], {Fns, AccProps}) ->
+    rewrap(Tail, {[Fn|Fns], Props ++ AccProps}).

data/tracks/haskell/config.json

@@ -69,6 +69,17 @@
         "Number Theory"
       ]
     },
+    {
+      "uuid": "928b22c5-f2bd-4496-8605-fcff2dad2c3a",
+      "slug": "perfect-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "Maybe",
+        "Number Theory"
+      ]
+    },
     {
       "uuid": "6eba4eac-6665-4ad6-ac21-3651a11ab4b4",
       "slug": "isogram",

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

@@ -0,0 +1,78 @@
+# Perfect Numbers
+
+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**.
+
+
+## Getting Started
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/haskell).
+
+## Running the tests
+
+To run the test suite, execute the following command:
+
+```bash
+stack test
+```
+
+#### If you get an error message like this...
+
+```
+No .cabal file found in directory
+```
+
+You are probably running an old stack version and need
+to upgrade it.
+
+#### Otherwise, if you get an error message like this...
+
+```
+No compiler found, expected minor version match with...
+Try running "stack setup" to install the correct GHC...
+```
+
+Just do as it says and it will download and install
+the correct compiler version:
+
+```bash
+stack setup
+```
+
+## Running *GHCi*
+
+If you want to play with your solution in GHCi, just run the command:
+
+```bash
+stack ghci
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/haskell](https://github.com/exercism/haskell) repository on
+GitHub is the home for all of the Haskell exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue.  We'll do our best to help you!
+
+## Source
+
+Taken from Chapter 2 of Functional Thinking by Neal Ford. [http://shop.oreilly.com/product/0636920029687.do](http://shop.oreilly.com/product/0636920029687.do)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/haskell/exercises/perfect-numbers/examples/success-standard/package.yaml

@@ -0,0 +1,16 @@
+name: perfect-numbers
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: PerfectNumbers
+  source-dirs: src
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - perfect-numbers
+      - hspec

data/tracks/haskell/exercises/perfect-numbers/examples/success-standard/src/PerfectNumbers.hs

@@ -0,0 +1,10 @@
+module PerfectNumbers (classify, Classification(..)) where
+
+data Classification = Deficient | Perfect | Abundant deriving (Eq, Show)
+
+classify :: Int -> Maybe Classification
+classify n | n < 1        = Nothing
+           | n < divisors = Just Abundant
+           | n > divisors = Just Deficient
+           | otherwise    = Just Perfect
+  where divisors = sum $ filter ((0==) . mod n) [1..(div n 2)]

data/tracks/haskell/exercises/perfect-numbers/package.yaml

@@ -0,0 +1,20 @@
+name: perfect-numbers
+version: 1.0.1.1
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: PerfectNumbers
+  source-dirs: src
+  dependencies:
+  # - foo       # List here the packages you
+  # - bar       # want to use in your solution.
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - perfect-numbers
+      - hspec

data/tracks/haskell/exercises/perfect-numbers/src/PerfectNumbers.hs

@@ -0,0 +1,6 @@
+module PerfectNumbers (classify, Classification(..)) where
+
+data Classification = Deficient | Perfect | Abundant deriving (Eq, Show)
+
+classify :: Int -> Maybe Classification
+classify = error "You need to implement this function."

data/tracks/haskell/exercises/perfect-numbers/stack.yaml

@@ -0,0 +1 @@
+resolver: lts-8.21

data/tracks/haskell/exercises/perfect-numbers/test/Tests.hs

@@ -0,0 +1,79 @@
+{-# LANGUAGE RecordWildCards #-}
+
+import Data.Foldable     (for_)
+import Test.Hspec        (Spec, describe, it, shouldBe)
+import Test.Hspec.Runner (configFastFail, defaultConfig, hspecWith)
+
+import PerfectNumbers
+
+main :: IO ()
+main = hspecWith defaultConfig {configFastFail = True} specs
+
+specs :: Spec
+specs = describe "classify" $ for_ cases test
+  where
+
+    test Case{..} = it description assertion
+      where
+        assertion = classify number `shouldBe` expected
+
+
+data Case = Case { description :: String
+                 , number      :: Int
+                 , expected    :: Maybe Classification
+                 }
+
+cases :: [Case]
+cases = [ Case { description = "Smallest perfect number is classified correctly"
+               , number      = 6
+               , expected    = Just Perfect
+               }
+        , Case { description = "Medium perfect number is classified correctly"
+               , number      = 28
+               , expected    = Just Perfect
+               }
+        , Case { description = "Large perfect number is classified correctly"
+               , number      = 33550336
+               , expected    = Just Perfect
+               }
+        , Case { description = "Smallest abundant number is classified correctly"
+               , number      = 12
+               , expected    = Just Abundant
+               }
+        , Case { description = "Medium abundant number is classified correctly"
+               , number      = 30
+               , expected    = Just Abundant
+               }
+        , Case { description = "Large abundant number is classified correctly"
+               , number      = 33550335
+               , expected    = Just Abundant
+               }
+        , Case { description = "Smallest prime deficient number is classified correctly"
+               , number      = 2
+               , expected    = Just Deficient
+               }
+        , Case { description = "Smallest non-prime deficient number is classified correctly"
+               , number      = 4
+               , expected    = Just Deficient
+               }
+        , Case { description = "Medium deficient number is classified correctly"
+               , number      = 32
+               , expected    = Just Deficient
+               }
+        , Case { description = "Large deficient number is classified correctly"
+               , number      = 33550337
+               , expected    = Just Deficient
+               }
+        , Case { description = "Edge case (no factors other than itself) is classified correctly"
+               , number      = 1
+               , expected    = Just Deficient
+               }
+        , Case { description = "Zero is rejected (not a natural number)"
+               , number      = 0
+               , expected    = Nothing
+               }
+        , Case { description = "Negative integer is rejected (not a natural number)"
+               , number      = -1
+               , expected    = Nothing
+               }
+        ]

data/tracks/javascript/exercises/acronym/README.md

@@ -13,7 +13,7 @@ like Portable Network Graphics to its acronym (PNG).
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/all-your-base/README.md

@@ -36,7 +36,7 @@ I think you got the idea!
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/allergies/README.md

@@ -35,7 +35,7 @@ score is 257, your program should only report the eggs (1) allergy.
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/alphametics/README.md

@@ -36,7 +36,7 @@ Write a function to solve alphametics puzzles.
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

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

@@ -11,7 +11,7 @@ Given `"listen"` and a list of candidates like `"enlists" "google"
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/atbash-cipher/README.md

@@ -32,7 +32,7 @@ things based on word boundaries.
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/beer-song/README.md

@@ -325,7 +325,7 @@ experiment make the code better? Worse? Did you learn anything from it?
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/binary-search-tree/README.md

@@ -58,7 +58,7 @@ And if we then added 1, 5, and 7, it would look like this
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

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

@@ -39,7 +39,7 @@ A binary search is a dichotomic divide and conquer search algorithm.
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

data/tracks/javascript/exercises/binary/README.md

@@ -33,7 +33,7 @@ So: `101 => 1*2^2 + 0*2^1 + 1*2^0 => 1*4 + 0*2 + 1*1 => 4 + 1 => 5 base 10`.
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass
 

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

@@ -16,7 +16,7 @@ He answers 'Whatever.' to anything else.
 Go through the setup instructions for JavaScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/javascript
+http://exercism.io/languages/javascript/installation
 
 ## Making the Test Suite Pass