trackler 2.2.1.47 → 2.2.1.48

data/tracks/purescript/config.json

@@ -250,6 +250,17 @@
       "topics": [
         "arrays"
       ]
+    },
+    {
+      "uuid": "d99298e6-0703-6080-8a2d-16e803173b64667909f",
+      "slug": "collatz-conjecture",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "arithmetics",
+        "maybe"
+      ]
     }
   ],
   "foregone": [

data/tracks/purescript/exercises/collatz-conjecture/README.md

@@ -0,0 +1,33 @@
+# Collatz Conjecture
+
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+## Examples
+
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+## Source
+
+An unsolved problem in mathematics named after mathematician Lothar Collatz [https://en.wikipedia.org/wiki/3x_%2B_1_problem](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/purescript/exercises/collatz-conjecture/bower.json

@@ -0,0 +1,26 @@
+{
+  "name": "collatz-conjecture",
+  "ignore": [
+    "**/.*",
+    "node_modules",
+    "bower_components",
+    "output"
+  ],
+  "dependencies": {
+    "purescript-console": "^3.0.0",
+    "purescript-datetime": "^3.4.0",
+    "purescript-either": "^3.1.0",
+    "purescript-enums": "^3.2.1",
+    "purescript-integers": "^3.1.0",
+    "purescript-lists": "^4.10.0",
+    "purescript-maps": "^3.5.2",
+    "purescript-prelude": "^3.1.0",
+    "purescript-sets": "^3.0.0",
+    "purescript-strings": "^3.3.1",
+    "purescript-unicode": "^3.0.1"
+  },
+  "devDependencies": {
+    "purescript-psci-support": "^3.0.0",
+    "purescript-test-unit": "^13.0.0"
+  }
+}

data/tracks/purescript/exercises/collatz-conjecture/examples/src/CollatzConjecture.purs

@@ -0,0 +1,15 @@
+module CollatzConjecture
+  ( collatz
+  ) where
+
+import Prelude
+import Data.Int (even)
+import Data.Maybe (Maybe(..))
+
+collatzHelper :: Int -> Int -> Int
+collatzHelper acc x | x == 1    = acc
+                    | even x    = collatzHelper (acc + 1) (x / 2)
+                    | otherwise = collatzHelper (acc + 1) (x * 3 + 1)
+
+collatz :: Int -> Maybe Int
+collatz x = if x <= 0 then Nothing else Just $ collatzHelper 0 x

data/tracks/purescript/exercises/collatz-conjecture/src/CollatzConjecture.purs

@@ -0,0 +1,3 @@
+module CollatzConjecture
+  ( collatz
+  ) where

data/tracks/purescript/exercises/collatz-conjecture/test/Main.purs

@@ -0,0 +1,43 @@
+module Test.Main where
+
+import Prelude
+
+import CollatzConjecture (collatz)
+import Control.Monad.Aff.AVar (AVAR)
+import Control.Monad.Eff (Eff)
+import Control.Monad.Eff.Console (CONSOLE)
+import Data.Maybe (Maybe(..))
+import Test.Unit (TestSuite, suite, test)
+import Test.Unit.Assert as Assert
+import Test.Unit.Console (TESTOUTPUT)
+import Test.Unit.Main (runTest)
+
+main :: forall eff
+  . Eff ( avar :: AVAR
+        , console :: CONSOLE
+        , testOutput :: TESTOUTPUT
+        | eff
+        )
+        Unit
+main = runTest suites
+
+suites :: forall e. TestSuite e
+suites = do
+  suite "CollatzConjecture.collatz" do
+    test "zero steps for one" do
+      Assert.equal (Just 0) (collatz 1)
+
+    test "divide if even" do
+      Assert.equal (Just 4) (collatz 16)
+
+    test "even and odd steps" do
+      Assert.equal (Just 9) (collatz 12)
+
+    test "Large number of even and odd steps" do
+      Assert.equal (Just 152) (collatz 1000000)
+
+    test "zero is an error" do
+      Assert.equal Nothing (collatz 0)
+
+    test "negative value is an error" do
+      Assert.equal Nothing (collatz (-15))

data/tracks/python/config.json

@@ -326,7 +326,10 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "recursion",
+        "lists",
+        "algorithms",
+        "transforming"
       ]
     },
     {
@@ -374,7 +377,12 @@
       "unlocked_by": null,
       "difficulty": 1,
       "topics": [
-
+        "mathematics",
+        "algorithms",
+        "loops",
+        "conditionals",
+        "pattern_matching",
+        "security"
       ]
     },
     {

data/tracks/racket/README.md

@@ -1,24 +1,31 @@
 # Exercism Racket Track
 
-Exercism problems in Racket.
+[![Build Status](https://travis-ci.org/exercism/racket.svg?branch=master)](https://travis-ci.org/exercism/racket)
 
-## Working on the Exercises
+Exercism exercises in Racket.
 
-We welcome both improvements to the existing exercises and the addition of new exercises. A pool of exercise ideas can be found in the [x-common repo](https://github.com/exercism/x-common). An overview about which language tracks implement which exercises is at [synopsis.exercism.io](http://synopsis.exercism.io/).
+## Contributing
 
-Each exercise should have an example solution and a test suite, as well as a stub file for the solution declaring the module and exports.
+Please read about how to [get involved in a track](https://github.com/exercism/docs/tree/master/contributing-to-language-tracks). Also, be sure to read the Exercism [Code of Conduct](https://github.com/exercism/exercism.io/blob/master/CODE_OF_CONDUCT.md).
+
+We welcome both improvements to the existing exercises and the addition of new exercises. If you are creating a new exercise from scratch please see [adding new exercises](https://github.com/exercism/docs/blob/master/you-can-help/make-up-new-exercises.md).  If you are porting an exercise that exists in other exercism language tracks, see [porting an exercise](https://github.com/exercism/docs/blob/master/you-can-help/implement-an-exercise-from-specification.md).
+
+Please note that this track's exercises must conform to the Exercism-wide standards described in the [documentation](https://github.com/exercism/docs/tree/master/language-tracks/exercises). If you're unsure about how to make a change, then go ahead and open an issue on Github.
+
+Each exercise should have an example solution, a description file, a test suite and a stub file for the solution declaring the module and exports.
 
 ### Naming Conventions
 
-The example solution should be named `example.rkt`. The test should be named `<exercise-name>-test.rkt`, and the stub should be named `<exercise-name>.rkt`.
+The example solution should be named `example.rkt`. The description file: `README.md`. The test suite: `<exercise-name>-test.rkt`, and the stub: `<exercise-name>.rkt`.
 
-For example, if you were to work on the `binary` exercise, you would have the following three files:
+For example, if you were to work on the `binary` exercise, you would create and commit the following four files:
 
 ```bash
-$ tree
+$ racket/exercises/binary/
 .
 ├── binary.rkt
 ├── binary-test.rkt
+├── README.md
 └── example.rkt
 ```
 
@@ -28,7 +35,29 @@ The Racket code in this repo is meant to conform with the conventions set forth
 ### Dependencies
 Try to avoid external dependencies.
 
-### Pull Requests
+### Creating the description file
+
+`README.md` may be [generated](https://github.com/exercism/docs/blob/master/maintaining-a-track/regenerating-exercise-readmes.md) from exercism data. The generator will use the `description.md` from the exercise directory in the [problem-specifications repository](https://github.com/exercism/problem-specifications/tree/master/exercises).  To generate `README.md` for your execise only use the following command from your racket track directory:
+
+```bash
+bin/configlet generate . --only <exercise-name>
+```
+
+### Adding the exercise to config.json
+Be sure to add the exercise to an appropriate place in the `config.json` file.  The position in the file determines the order exercises are fetched by users.  Generate a unique UUID for the exercise with ```configlet uuid```.  Finally check `config.json` with:
+
+```bash
+bin/configlet lint .
+```
+
+## Opening an Issue
+
+If you plan to make significant or breaking changes, please open an issue so we can discuss it first. If this is a discussion that is relevant to more than just the Racket track, please open an issue in [exercism/discussions](https://github.com/exercism/discussions/issues).
+
+## Submitting a Pull Request
+
+Pull requests should be focused on a single exercise, issue, or conceptually cohesive change. Please refer to Exercism's [pull request guidelines](https://github.com/exercism/docs/blob/master/contributing/pull-request-guidelines.md).
+
 Prior to submitting a pull request, ensure that your test requires the stub file, and not the example file - like so:
 
 ```Racket
@@ -49,31 +78,7 @@ Prior to submitting a pull request, ensure that your test requires the stub file
 
   (run-tests suite))
 ```
-The exercise should also be added as a value for the `problems` key in [config.json](https://github.com/exercism/racket/blob/master/config.json); otherwise, the pull request will not pass the Travis CI build. Use [Order of exercises](https://github.com/exercism/racket/wiki/Order-of-exercises) in our wiki to find a good place for the new exercise in the curriculum.
-
-You can perform additional checks by running the following in your terminal:
-
-```bash
-bin/check_exercises.sh
-```
-
-and:
-
-```bash
-bin/configlet lint .
-```
-Your pull request won't pass the Travis CI build if either of those fail.
-
-If you're new to Git, take a look at [this short guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md#git-basics).
-
-## READMEs
-Please do not add a README or README.md file to the problem directory. The READMEs are constructed using shared metadata, which lives in the [exercism/x-common](https://github.com/exercism/x-common) repository.
-
-## Contributing Guide
-
-Please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
-
 
 ## Racket icon
 The Racket logo was created by [Matthew Butterick](https://en.wikipedia.org/wiki/Matthew_Butterick) and released under the Creative Commons Attribution-Share Alike 3.0 Unported license.
-We have adapted it, changing the colour scheme, for use on Exercism.
+We have adapted it, changing the colour scheme for use on Exercism.

data/tracks/racket/config.json

@@ -73,6 +73,16 @@
 
       ]
     },
+    {
+      "uuid": "28102e69-dad0-4f3c-8cdf-5a18a73178a4",
+      "slug": "collatz-conjecture",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "f0a6e55d-6702-4043-bdcf-2ed99bf60645",
       "slug": "hamming",

data/tracks/racket/exercises/collatz-conjecture/README.md

@@ -0,0 +1,58 @@
+# Collatz Conjecture
+
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+## Examples
+
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+
+* * * *
+
+For installation and learning resources, refer to the
+[exercism Racket page](http://exercism.io/languages/racket).
+
+You can run the provided tests through DrRacket, or via the command line.
+
+To run the test through DrRacket, simply open the test file and click the 'Run' button in the upper right.
+
+To run the test from the command line, simply run the test from the exercise directory. For example, if the test suite is called `hello-world-test.rkt`, you can run the following command:
+
+```
+raco test hello-world-test.rkt
+```
+
+which will display the following:
+
+```
+raco test: (submod "hello-world-test.rkt" test)
+2 success(es) 0 failure(s) 0 error(s) 2 test(s) run
+0
+2 tests passed
+```
+
+## Source
+
+An unsolved problem in mathematics named after mathematician Lothar Collatz [https://en.wikipedia.org/wiki/3x_%2B_1_problem](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/racket/exercises/collatz-conjecture/collatz-conjecture-test.rkt

@@ -0,0 +1,34 @@
+#lang racket/base
+
+(require "collatz-conjecture.rkt")
+
+(module+ test
+  (require rackunit rackunit/text-ui)
+
+  (define suite
+    (test-suite
+     "collatz-conjecture tests"
+
+     (test-eqv? "zero steps for one"
+                (collatz 1)
+                0)
+     (test-eqv? "divide if even"
+                (collatz 16)
+                4)
+     (test-eqv? "even and odd steps"
+                (collatz 12)
+                9)
+     (test-eqv? "Large number of even and odd steps"
+                (collatz 1000000)
+                152)
+     (test-exn "zero is an error"
+               exn:fail?
+               (lambda () (collatz 0)))
+     (test-exn "negative value is an error"
+               exn:fail?
+               (lambda () (collatz -15)))
+     (test-exn "non exact value is an error"
+               exn:fail?
+               (lambda () (collatz 3.4)))))
+
+  (run-tests suite))

data/tracks/racket/exercises/collatz-conjecture/collatz-conjecture.rkt

@@ -0,0 +1,6 @@
+#lang racket
+
+(provide collatz)
+
+  
+

data/tracks/racket/exercises/collatz-conjecture/example.rkt

@@ -0,0 +1,20 @@
+#lang racket
+
+(provide collatz)
+
+(define (collatz-length n [acc 0])
+  (if (= n 1)
+      acc
+      (collatz-length (if (even? n)
+                          (/ n 2)
+                          (add1 (* 3 n)))
+                      (add1 acc))))
+
+(define (collatz n)
+  (if (nand (exact-integer? n)
+            (positive? n))
+      (error "number must be a positive integer")
+      (collatz-length n)))
+  
+
+  

data/tracks/ruby/exercises/allergies/.meta/.version

@@ -0,0 +1 @@
+1

data/tracks/ruby/exercises/allergies/.meta/generator/allergies_case.rb

@@ -0,0 +1,33 @@
+require 'generator/exercise_case'
+
+class AllergiesCase < Generator::ExerciseCase
+  def workload
+    assertions = list_expected? ? list_assertion : individual_assertions
+    allergies_declaration = "allergies = Allergies.new(#{score})"
+    indent_lines(assertions.unshift(allergies_declaration), 4)
+  end
+
+  def list_expected?
+    property == 'list'
+  end
+
+  def list_assertion
+    ["assert_equal %w(#{expected.join(' ')}), allergies.list"]
+  end
+
+  def individual_assertions
+    expected.map do |assertion|
+      substance = assertion['substance']
+      result = assertion['result']
+      "#{result ? assert(substance) : refute(substance)}"
+    end
+  end
+
+  def refute(allergen)
+    "refute allergies.allergic_to?('#{allergen}')"
+  end
+
+  def assert(allergen)
+    "assert allergies.allergic_to?('#{allergen}')"
+  end
+end