trackler 2.0.3.5 → 2.0.3.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a7246bea41baef8aa38999af188d6a25fb21c359
-  data.tar.gz: c9b3666bcd5f4c51d3251b9fb1f97048425ed156
+  metadata.gz: b901d5120c25f537dcee46f542598bbb15a01356
+  data.tar.gz: 8466d0a7d4886cd07a4c9110398131daf7e3dcf9
 SHA512:
-  metadata.gz: 5e45c5da080f94f7723a6f32aaabf00005108f74e1000a03436904fa1b7b8f283f3b1c66c2923a3d38ce29d41607c4d61df35986c419faafdb33f94135c5e68a
-  data.tar.gz: 5e0c721dd96f6beb5e4e4a7e7dde487d74161ff94bb861f62dfe7928fa3fce7a3b45aef1a824c2bd5452a0bdb16295e51ec8e462f33e663802d83633f88f498c
+  metadata.gz: b25a7bcb55bb5636de9f61f7ad52e304fa68c9761fc5f479debfd0b58176635183714511d6d3cd0c5a515007c271ebaddf70ac6c7913bc526fdacc4d66e9073b
+  data.tar.gz: dda9f974754afe11ae94ec7d937c422ce3dcb5e2cfc24b16fcfc3ee4527df995802b124e0ea46a2d1ab1a491ad602d2ca4ad8ccf2b933d2aa1ea91450b6d3d1b

data/common/exercises/leap/canonical-data.json

@@ -1,37 +1,22 @@
 {
    "cases": [
       {
-         "description": "leap year in twentieth century",
-         "input": 1996,
-         "expected": true
-      },
-      {
-         "description": "odd standard year in twentieth century",
-         "input": 1997,
-         "expected": false
-      },
-      {
-         "description": "even standard year in twentieth century",
-         "input": 1998,
+         "description": "year not divisible by 4: common year",
+         "input": 2015,
          "expected": false
       },
       {
-         "description": "standard year in nineteenth century",
-         "input": 1900,
-         "expected": false
+         "description": "year divisible by 4, not divisible by 100: leap year",
+         "input": 2016,
+         "expected": true
       },
       {
-         "description": "standard year in eighteenth century",
-         "input": 1800,
+         "description": "year divisible by 100, not divisible by 400: common year",
+         "input": 2100,
          "expected": false
       },
       {
-         "description": "leap year twenty four hundred",
-         "input": 2400,
-         "expected": true
-      },
-      {
-         "description": "leap year two thousand",
+         "description": "year divisible by 400: leap year",
          "input": 2000,
          "expected": true
       }

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.3.5"
+  VERSION = "2.0.3.6"
 end

data/tracks/c/exercises/meetup/makefile

@@ -10,6 +10,6 @@ test: tests.out
 clean:
 	rm -f *.o *.out
 
-tests.out: test/test_meetup.c src/meetup.c src/meetup.h src/example.c
+tests.out: test/test_meetup.c src/meetup.c src/meetup.h
 	@echo Compiling $@
 	@cc $(CFLAGS) src/meetup.c test/vendor/unity.c test/test_meetup.c -o tests.out

data/tracks/crystal/config.json

@@ -4,24 +4,6 @@
   "repository": "https://github.com/exercism/xcrystal",
   "active": true,
   "test_pattern": "_spec.cr",
-  "problems": [
-    "hello-world",
-    "hamming",
-    "gigasecond",
-    "rna-transcription",
-    "bob",
-    "raindrops",
-    "leap",
-    "pangram",
-    "largest-series-product",
-    "bracket-push",
-    "sieve",
-    "roman-numerals",
-    "atbash-cipher",
-    "anagram",
-    "react",
-    "acronym"
-  ],
   "exercises": [
     {
       "slug": "hello-world" ,

data/tracks/dlang/config.json

@@ -35,89 +35,7 @@
     },
     {
       "slug": "rna-transcription" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "raindrops" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "bob" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "etl" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "hamming" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "nucleotide-count" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "robot-name" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "difference-of-squares" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "roman-numerals" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "series" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "triangle" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "crypto-square" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "circular-buffer" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "pangram",
-      "difficulty": 1,
-      "topics": []
-    }
-  ],
-  "exercises": [
-    {
-      "slug": "hello-world" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "gigasecond" ,
-      "difficulty": 1,
-      "topics": []
-    },
-    {
-      "slug": "rna-transcription" ,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": []
     },
     {
@@ -127,57 +45,57 @@
     },
     {
       "slug": "bob" ,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": []
     },
     {
       "slug": "etl" ,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": []
     },
     {
       "slug": "hamming" ,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": []
     },
     {
       "slug": "nucleotide-count" ,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": []
     },
     {
       "slug": "robot-name" ,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": []
     },
     {
       "slug": "difference-of-squares" ,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": []
     },
     {
       "slug": "roman-numerals" ,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": []
     },
     {
       "slug": "series" ,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": []
     },
     {
       "slug": "triangle" ,
-      "difficulty": 1,
+      "difficulty": 2,
       "topics": []
     },
     {
       "slug": "crypto-square" ,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": []
     },
     {
       "slug": "circular-buffer" ,
-      "difficulty": 1,
+      "difficulty": 4,
       "topics": []
     },
     {
@@ -196,3 +114,4 @@
 
   ]
 }
+

data/tracks/fsharp/exercises/binary-search-tree/BinarySearchTreeTest.fs

@@ -24,14 +24,14 @@ let ``Inserting same`` () =
 
 [<Test>]
 [<Ignore("Remove to run test")>]
-let ``Inserting greater()`` =
+let ``Inserting greater`` () =
     let tree = singleton 4 |> insert 5
     Assert.That(tree |> value, Is.EqualTo(4))
     Assert.That(tree |> right |> Option.map value, Is.EqualTo(Some 5))
 
 [<Test>]
 [<Ignore("Remove to run test")>]
-let ``Complex tree()`` =
+let ``Complex tree`` () =
     let tree = fromList [4; 2; 6; 1; 3; 7; 5]
     Assert.That(tree |> value, Is.EqualTo(4))
     Assert.That(tree |> left |> Option.map value, Is.EqualTo(2))

data/tracks/haskell/README.md

@@ -6,38 +6,133 @@ Exercism exercises in Haskell
 
 ## Contributing Guide
 
-Please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md)
-
-### Development Dependencies
-
-You should have [Stack](http://docs.haskellstack.org/) installed in your
-system to make contributing to this repository easier.
-
-### Exercises
-
-All exercises have the following structure:
+- [Asking for help](#asking-for-help)
+- [How to contribute](#how-to-contribute)
+  * [Reporting or fixing bugs](#reporting-or-fixing-bugs)
+  * [Reviewing issues and pull requests](#reviewing-issues-and-pull)
+  * [Porting exercises](#porting-exercises)
+  * [Updating an exercise test suite](#updating-an-exercise-test-suite)
+- [Repository structure and conventions](#repository-structure-and-conventions)
+  * [Directory structure](#directory-structure)
+  * [Exercise structure](#exercise-structure)
+- [Writing an issue](#writing-an-issue)
+- [Writing a pull request](#writing-a-pull-request)
+- [Development Dependencies](#development-dependencies)
+- [Stub solution](#stub-solution)
+- [Example solution](#example-solution)
+- [Test suite](#test-suite)
+- [Running tests](#running-tests)
+- [Running HLint](#running-hlint)
+
+### Asking for help
+When in doubt just ask!
+- [gitter support](https://gitter.im/exercism/support): more specific/technical questions.
+- [gitter dev](https://gitter.im/exercism/dev): technical questions.
+
+In any case, don't be afraid or shy! We promise to be friendly and as helpful as
+possible.
+
+### How to contribute
+As a first step we recommend you read the [contributing guide](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md).
+
+#### Reporting or fixing bugs
+Typical examples for a bug: A typo, a missing test case, an unclear or ambiguous
+problem description.
+- If you are unsure whether you have really found a bug [just ask](#asking-for-help).
+- To report a bug you can [write an issue](#writing-an-issue).
+- If you already have a fix for it you may [write a pull request](#writing-a-pull-request).
+
+#### Reviewing issues and pull requests
+If you have a dedicated opinion you are welcome to [write a comment](https://help.github.com/articles/commenting-on-a-pull-request/) for an [issue](https://github.com/exercism/xhaskell/issue) or a [pull request](https://github.com/exercism/xhaskell/pull).
+Please be detailed and include reasons, links or arguments to support your opinion.
+
+#### Porting exercises
+Here is the [list of missing exercises](http://exercism.io/languages/haskell/todo). See here for more information about [porting an exercise](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#porting-an-exercise-to-another-language-track).
+Of course you can also add a totally new exercise, but it might be a good idea to first discuss it in one of [our forums](#asking-for-help).
+
+#### Updating an exercise test suite
+Updating a test suite of an existing exercise is special because it usually affects all languages. Read more about it [here](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#updating-an-exercise-test-suite).
+Note that the whole test suite must run with the sample solution within a couple of seconds.
+
+### Repository structure and conventions
+[Here](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#track-anatomy) is a general description of all the files and directories that are not explicitly described below.
+
+#### Directory structure
+```bash
+├── .gitignore
+├── .travis.yml
+├── LICENSE
+├── README.md
+├── SETUP.md
+├── bin
+│ └── fetch‐configlet
+├── config.json
+├── docs
+│ ├── ABOUT.md
+│ ├── INSTALLATION.md
+│ ├── LEARNING.md
+│ ├── RESOURCES.md
+│ └── TESTS.md
+└── exercises
+  └── accumulate
+  │ ├── HINTS.md
+  │ ├── package.yaml
+  │ ├── stack.yaml
+  │ ├── examples
+  │ │ └── success-standard
+  │ │   ├── package.yaml
+  │ │   └── src
+  │ │     └── Accumuĺate.hs
+  │ ├── src
+  │ │ └── Accumuĺate.hs
+  │ └── test
+  │   └── Tests.hs
+  └── allergies
+  │ ├── ...
+  └── ...
+```
+- `config.json`: Every exercise has to be registered here. It has a unique name and a difficulty. The sequence order is also the default order in which the exercises are fetched.
 
+### Exercise structure
+Each exercise has the following structure:
 - `stack.yaml` has just one line specifying the current
 [Stack snapshot](https://www.stackage.org/snapshots). We use the same
 resolver for all the exercises.
 - `package.yaml` is a file in the [hpack](https://github.com/sol/hpack#readme)
 format that has all dependencies and build instructions for an exercise.
-- `src/ModuleName.hs` is a *stub solution*.
-- `src/examples/success-foo/package.yaml` has dependencies for the example solution named `foo`.
-- `src/examples/success-foo/src/ModuleName.hs` is the source code of the sample solution.
-- `test/Tests.hs` is the test suite.
-- `HINTS.md` is an optional file containing instructions and/or hints.
+- `HINTS.md` is an optional file containing instructions and/or hints. It is used together with the respective `description.md` for the exercise from [x-common](https://github.com/exercism/x-common) to build the `README.md` file.
+- `src/ModuleName.hs` is a [stub solution](#stub-solution).
+- `examples/success-<name>/package.yaml` contains library dependencies for the [example solution](#example-solution). `<name>` is a unique name for the example - usually "standard" (as in `success-standard`), but it can be some other name in case of multiple example solutions.
+- `examples/success-<name>/src/ModuleName.hs` is the source code of the sample solution.
+- `test/Tests.hs` is the [test suite](#test-suite).
 
-### Running Tests
+### Writing an issue
+To report a bug you should [create an issue](https://help.github.com/articles/creating-an-issue/) [here](https://github.com/exercism/xhaskell/issue).
 
-In order to be accepted by Travis-CI, every exercise must compile without
-warnings and the example solution must pass the tests without failures.
+### Writing a pull request
+To fix a bug you should [create a pull request from a fork](https://help.github.com/articles/creating-a-pull-request-from-a-fork/) [here](https://github.com/exercism/xhaskell/pull). See also [here](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#git-basics) for more information.
 
-To test an exercise, first you need to rename the file `src/Example.hs`
-to match the module name, but - because we already have a *stub solution*
-in place - we have to move it first, otherwise it will be overwritten.
+### Development Dependencies
+You should have [Stack](http://docs.haskellstack.org/) installed in your system to make contributing to this repository easier.
+
+### Stub solution
+The stub solution must compile together with the test suite. It should be as general as possible in order to not exclude any possible solutions. It should take Haskell specifics into account (for example use `Maybe` instead of a dummy return value). It should not contain any comments (people might forget to remove them), you can use the hints file instead.
+
+### Example solution
+The example solution could be inspiration for other language implementors. It doesn't need to be perfect or very elegant. But it should be efficient enough for the test suite to finish in only a few seconds.
+
+### Test suite
+The test suite should be derived from the respective `x-common/exercises/<exercise-name>/canonical-data.json` and comply to some formatting and coding standards (to get an idea you may look at some of the existing tests).
 
-Running `stack test --pedantic` compiles and run the tests with
+### Running Tests
+In order to be accepted by Travis-CI, every exercise must be registered in
+`config.json`, it must compile without warnings and the example solution must
+pass the tests without failures. Additionally the tests should not run longer than
+a few seconds.
+
+First you need to provide an [example solution](#example-solution).
+
+Running `stack test --pedantic` compiles and runs the tests with
 `-Wall -Werror`, but unfortunately it doesn't recompile unchanged
 source code already compiled with warnings.
 
@@ -50,13 +145,12 @@ stack test --pedantic
 ```
 
 ### Running HLint
-
 All code in this repository should be as idiomatic as possible, so we
 enforce in Travis-CI that it returns `No hints` when processed by
 HLint.
 
 It is highly recommended to run `hlint` on your sources before opening
-a *pull request*, so you can fix your code before submitting it for review.
+a [pull request](#writing-a-pull-request), so you can fix your code before submitting it for review.
 
 If you are certain that a suggestion given by `hlint` would make the
 code worse, you can [suppress it](https://github.com/ndmitchell/hlint#customizing-the-hints)