trackler 2.0.8.41 → 2.0.8.42

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 5d69353254fc4ffd4ba4aa0def00d3d50072abe6
-  data.tar.gz: b39816fc7ab3bc4e0dc967d164153ebc7ca966ad
+  metadata.gz: ad0c8c481adab8fc6597c91e49a145230f5a0e3d
+  data.tar.gz: bf9269a54e783bf01145d450c8712d57eb0d8204
 SHA512:
-  metadata.gz: 9847a2b2d9141ec9ec8ffbec5f31962cd80c787575f9ce16efef0c9ee50ed71b1d1c3adb019a3adfdad2fa6711a5ce349a5a7a535d1001194352f1484aac937a
-  data.tar.gz: dc710738809d474bac826e1b4fa261521da31dcb41fba063718a4bb4d8825569bead88b971bcc731a8e3f538a0963ba0eca33ccfdc77846452b98d623dfd691a
+  metadata.gz: dc3576e5ff9be012b404eafa0776795a2aaf6bd09903bf9cf4f42554b9da8cddb6974c92714b867c232cd8476da1fc504de6e90510d59ccca087bf9ab5329a94
+  data.tar.gz: 25537ab8bb99975a7bb6507c4e9153f722912f6d970c2b64481e75fcc9dd61e1456e7517be2b85226242c1b66cb220f3332b8f298626f4188c7728b82b81dcc1

data/common/exercises/triangle/description.md

@@ -1,5 +1,5 @@
 An _equilateral_ triangle has all three sides the same length.<br/>
-An _isoceles_ triangle has at least two sides the same length. (It is sometimes
+An _isosceles_ triangle has at least two sides the same length. (It is sometimes
 specified as having exactly two sides the same length, but for the purposes of
 this exercise we'll say at least two.)<br/>
 A _scalene_ triangle has all sides of different lengths.

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.8.41"
+  VERSION = "2.0.8.42"
 end

data/tracks/c/.github/stale.yml

@@ -0,0 +1 @@
+

data/tracks/csharp/exercises/accumulate/HINTS.md

@@ -1,2 +1,2 @@
-## Hints
-This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx).
+## Hints		
+This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx).

data/tracks/csharp/exercises/allergies/HINTS.md

@@ -1,2 +1,2 @@
 ## Hints
-This exercise requires you to use bitwise operations. For more information, see [this page](https://msdn.microsoft.com/en-us/library/6a71f45d.aspx).
+This exercise requires you to use bitwise operations. For more information, see [this page](https://msdn.microsoft.com/en-us/library/6a71f45d.aspx). 

data/tracks/csharp/exercises/sum-of-multiples/HINTS.md

@@ -0,0 +1,3 @@
+## Hints
+This exercise requires you to process a collection of data. You can simplify your code by using LINQ (Language Integrated Query).
+For more information, see [this page](https://docs.microsoft.com/en-us/dotnet/articles/standard/using-linq).

data/tracks/csharp/exercises/zebra-puzzle/HINTS.md

@@ -0,0 +1,3 @@
+## Hints
+This exercise requires you to process a collection of data. You can simplify your code by using lazy sequences to improve performance.
+For more information, see [this page](https://xosfaere.wordpress.com/2010/03/21/lazy-evaluation-in-csharp/).

data/tracks/go/exercises/change/change_test.go

@@ -19,7 +19,7 @@ func TestChange(t *testing.T) {
 		if tc.valid {
 			if err != nil {
 				t.Fatalf("%s : Change(%v, %d): expected %v, got error %s",
-					tc.description, tc.coins, tc.target, tc.expectedChange, err)
+					tc.description, tc.coins, tc.target, tc.expectedChange, err.Error())
 			} else {
 				if !reflect.DeepEqual(actual, tc.expectedChange) {
 					t.Fatalf("%s : Change(%v, %d): expected %v, actual %v",

data/tracks/groovy/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/tracks/java/exercises/nth-prime/src/example/java/{Prime.java → PrimeCalculator.java}

@@ -1,7 +1,7 @@
 import java.util.stream.IntStream;
 
-public final class Prime {
-    public static int nth(int nth) {
+public final class PrimeCalculator {
+    public int nth(int nth) {
         if (nth < 1) {
             throw new IllegalArgumentException();
         }
@@ -20,7 +20,7 @@ public final class Prime {
         return possiblePrime;
     }
 
-    private static boolean isPrime(int n) {
+    private boolean isPrime(int n) {
         if (n == 1) {
             return false;
         }

data/tracks/java/exercises/nth-prime/src/test/java/{PrimeTest.java → PrimeCalculatorTest.java}

@@ -1,44 +1,51 @@
-import org.junit.Test;
+import org.junit.Before;
 import org.junit.Ignore;
 import org.junit.Rule;
+import org.junit.Test;
 import org.junit.rules.ExpectedException;
 
 import static org.hamcrest.CoreMatchers.*;
 import static org.junit.Assert.*;
 
-public class PrimeTest {
+public class PrimeCalculatorTest {
+    private PrimeCalculator primeCalculator;
+
+    @Before
+    public void setup() {
+        primeCalculator = new PrimeCalculator();
+    }
 
     @Rule
     public ExpectedException thrown = ExpectedException.none();
-    
+
     @Test
     public void testFirstPrime() {
-        assertThat(Prime.nth(1), is(2));
+        assertThat(primeCalculator.nth(1), is(2));
     }
 
     @Ignore
     @Test
     public void testSecondPrime() {
-        assertThat(Prime.nth(2), is(3));
+        assertThat(primeCalculator.nth(2), is(3));
     }
 
     @Ignore
     @Test
     public void testSixthPrime() {
-        assertThat(Prime.nth(6), is(13));
+        assertThat(primeCalculator.nth(6), is(13));
     }
 
     @Ignore
     @Test
     public void testBigPrime() {
-        assertThat(Prime.nth(10001), is(104743));
+        assertThat(primeCalculator.nth(10001), is(104743));
     }
 
     @Ignore
     @Test
     public void testUndefinedPrime() {
         thrown.expect(IllegalArgumentException.class);
-        Prime.nth(0);
+        primeCalculator.nth(0);
     }
-    
+
 }

data/tracks/lua/.github/stale.yml

@@ -0,0 +1,22 @@
+# Configuration for probot-stale - https://github.com/probot/stale
+
+# Number of days of inactivity before an Issue or Pull Request becomes stale
+daysUntilStale: 60
+# Number of days of inactivity before a stale Issue or Pull Request is closed
+daysUntilClose: 7
+# Issues or Pull Requests with these labels will never be considered stale
+exemptLabels:
+  - pinned
+  - security
+  - good first patch
+# Label to use when marking as stale
+staleLabel: wontfix
+# Comment to post when marking as stale. Set to `false` to disable
+markComment: >
+  This issue has been automatically marked as stale because it has not had
+  recent activity. It will be closed if no further activity occurs. Thank you
+  for your contributions.
+# Comment to post when closing a stale Issue or Pull Request. Set to `false` to disable
+closeComment: false
+# Limit to only `issues` or `pulls`
+# only: issues

data/tracks/purescript/config.json

@@ -108,6 +108,13 @@
         "maps",
         "bitwise operations"
       ]
+    },
+    {
+      "slug": "all-your-base",
+      "difficulty": 1,
+      "topics": [
+        "base conversion"
+      ]
     }
   ],
   "deprecated": [

data/tracks/purescript/exercises/all-your-base/bower.json

@@ -0,0 +1,16 @@
+{
+  "name": "all-your-base",
+  "ignore": [
+    "**/.*",
+    "node_modules",
+    "bower_components",
+    "output"
+  ],
+  "dependencies": {
+    "purescript-prelude": "^2.5.0"
+  },
+  "devDependencies": {
+    "purescript-psci-support": "^2.0.0",
+    "purescript-test-unit": "^10.1.0"
+  }
+}

data/tracks/purescript/exercises/all-your-base/examples/src/AllYourBase.purs

@@ -0,0 +1,28 @@
+module AllYourBase
+  ( rebase
+  ) where
+
+import Prelude
+import Data.Array (all, any, head, length, range, reverse, zipWith)
+import Data.Foldable (sum)
+import Data.Int (pow)
+import Data.Maybe (Maybe(Just, Nothing))
+import Data.Tuple (Tuple(..))
+import Data.Unfoldable (unfoldr)
+
+rebase' :: Int -> Int -> Array Int -> Array Int
+rebase' inb oub ind =
+  zipWith (*) ind pows
+  # sum
+  # unfoldr fromDec
+  # reverse
+  where pows = map (pow inb) (range (length ind - 1) 0)
+        fromDec 0 = Nothing
+        fromDec n = Just $ Tuple (n `mod` oub) (n / oub)
+
+rebase :: Int -> Int -> Array Int -> Maybe (Array Int)
+rebase inb oub ind
+  | all (_ == 0) (head ind)         = Nothing
+  | any ((_ < 0) || (inb <= _)) ind = Nothing
+  | inb < 2 || oub < 2              = Nothing
+  | otherwise                       = Just $ rebase' inb oub ind

data/tracks/purescript/exercises/all-your-base/src/AllYourBase.purs

@@ -0,0 +1,3 @@
+module AllYourBase
+  ( rebase
+  ) where

data/tracks/purescript/exercises/all-your-base/test/Main.purs

@@ -0,0 +1,97 @@
+module Test.Main where
+
+import Prelude
+import Control.Monad.Eff (Eff)
+import Data.Maybe (Maybe(..))
+import Test.Unit.Assert as Assert
+import Test.Unit (suite, test)
+import Test.Unit.Main (runTest)
+import AllYourBase (rebase)
+
+main :: Eff _ Unit
+main = runTest do
+  suite "AllYourBase.rebase" do
+
+    test "single bit one to decimal" $
+      Assert.equal (Just [1])
+                   (rebase 2 10 [1])
+
+    test "binary to single decimal" $
+      Assert.equal (Just [5])
+                   (rebase 2 10 [1,0,1])
+
+    test "single decimal to binary" $
+      Assert.equal (Just [1,0,1])
+                   (rebase 10 2 [5])
+
+    test "binary to multiple decimal" $
+      Assert.equal (Just [4,2])
+                   (rebase 2 10 [1,0,1,0,1,0])
+
+    test "decimal to binary" $
+      Assert.equal (Just [1,0,1,0,1,0])
+                   (rebase 10 2 [4,2])
+
+    test "trinary to hexadecimal" $
+      Assert.equal (Just [2,10])
+                   (rebase 3 16 [1,1,2,0])
+
+    test "hexadecimal to trinary" $
+      Assert.equal (Just [1,1,2,0])
+                   (rebase 16 3 [2,10])
+
+    test "15-bit integer" $
+      Assert.equal (Just [6,10,45])
+                   (rebase 97 73 [3,46,60])
+
+    test "empty list" $
+      Assert.equal Nothing
+                   (rebase 2 10 [])
+
+    test "single zero" $
+      Assert.equal Nothing
+                   (rebase 10 2 [0])
+
+    test "multiple zeros" $
+      Assert.equal Nothing
+                   (rebase 10 2 [0,0,0])
+
+    test "leading zeros" $
+      Assert.equal Nothing
+                   (rebase 7 10 [0,6,0])
+
+    test "negative digit" $
+      Assert.equal Nothing
+                   (rebase 2 10 [1,-1,1,0,1,0])
+
+    test "invalid positive digit" $
+      Assert.equal Nothing
+                   (rebase 2 10 [1,2,1,0,1,0])
+
+    test "first base is one" $
+      Assert.equal Nothing
+                   (rebase 1 10 [])
+
+    test "second base is one" $
+      Assert.equal Nothing
+                   (rebase 2 1 [1,0,1,0,1,0])
+
+    test "first base is zero" $
+      Assert.equal Nothing
+                   (rebase 0 10 [])
+
+    test "second base is zero" $
+      Assert.equal Nothing
+                   (rebase 10 0 [7])
+
+    test "first base is negative" $
+      Assert.equal Nothing
+                   (rebase (-2) 10 [1])
+
+    test "second base is negative" $
+      Assert.equal Nothing
+                   (rebase 2 (-7) [1])
+
+    test "both bases are negative" $
+      Assert.equal Nothing
+                   (rebase (-2) (-7) [1])

data/tracks/python/.github/stale.yml

@@ -0,0 +1,17 @@
+# Number of days of inactivity before an issue becomes stale
+daysUntilStale: 21
+# Number of days of inactivity before a stale issue is closed
+daysUntilClose: 7
+# Issues with these labels will never be considered stale
+exemptLabels:
+  - pinned
+  - security
+# Label to use when marking an issue as stale
+staleLabel: on hiatus
+# Comment to post when marking an issue as stale. Set to `false` to disable
+markComment: >
+  This issue has been automatically marked as `on hiatus because it has not had
+  recent activity. It will be closed if no further activity occurs. Thank you
+  for your contributions.
+# Comment to post when closing a stale issue. Set to `false` to disable
+closeComment: false

data/tracks/r/.github/stale.yml

@@ -0,0 +1 @@
+

data/tracks/r/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014 Katrina Owen
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/tracks/r/README.md

@@ -4,7 +4,116 @@ Exercism problems in R
 
 ## Contributing Guide
 
-Please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
+- [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-requests)
+  * [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)
+- [Example Solution](#example-solution)
+- [Test Suite](#test-suite)
+- [Running Tests](#running-tests)
+- [R Style Guide](#style-guide)
+
+### Asking for help
+If stuck or in doubt just ask! We try our best to be friendly and helpful, so don't be shy!
+- [gitter support](https://gitter.im/exercism/support): general questions about exercism, setup, track content etc.
+- [gitter dev](https://gitter.im/exercism/dev): technical questions.
+
+### 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 have a fix you can [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/xr/issues) or a [pull request](https://github.com/exercism/xr/pulls).
+Please be detailed and include motivations or relevant links to support your opinion.
+
+#### Porting exercises
+Here is the [list of missing exercises](http://exercism.io/languages/r/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 the test suite of an existing exercise is a special case 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 test suite must run within a couple of seconds.
+
+### Repository structure and conventions
+A general description of all the files and directories can be found [here](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#track-anatomy).
+
+#### Directory structure
+```bash
+├── bin
+│ └── fetch‐configlet
+├── docs
+│ ├── ABOUT.md
+│ ├── INSTALLATION.md
+│ ├── LEARNING.md
+│ ├── RESOURCES.md
+│ └── TESTS.md
+└── exercises
+  ├── TRACK_HINTS.md
+  └── <exercise-name>
+  │ ├── <exercise-name>.R
+  │ └── example.R
+  │ └── test_<exercise-name>.R
+  └── <exercise-name>
+  │ ├── <exercise-name>.R
+  │ └── example.R
+  │ └── test_<exercise-name>.R
+  └── ...
+└── img
+  └── icon.png
+├── .gitignore
+├── .travis.yml
+├── LICENSE
+├── README.md
+└── config.json
+```
+- `config.json`: Note that every exercise has to be registered here, with a unique name and a difficulty. The sequence order in this file determines the default order in which the exercises are fetched.
+
+#### Exercise structure
+Each exercise has the following structure:
+- `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.
+- `<exercise-name>.R` usually contains an empty function declaration, as a starting point for the required solution.
+- `example.R` is the source code of the sample solution.
+- `test_<exercise-name>.R` is the [test suite](#test-suite).
+
+### 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/xr/issues).
+
+### 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/xr/pulls). See also [here](https://github.com/exercism/x-common/blob/master/CONTRIBUTING.md#git-basics) for more information.
+
+### Development dependencies
+You'll need to have a recent version of [R](https://cran.r-project.org/) installed on your system, as well as the `testthat` package (run `install.packages('testthat')` from the R console to install) in order to run tests.
+
+### Example solution
+The example solution doesn't have to be perfect, but should pass all of the tests and ideally also strive for a healthy balance of human readability and computational efficiency.
+
+### 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 can look at some of the existing tests).
+
+### Running tests
+To run the tests for an exercise, simply run `source('test_<exercise-name>.R')` from within the exercise's directory. Note that when testing locally you'll need to (temporarily) replace the first line of `test_<exercise-name>.R` (which sources `<exercise-name>.R`) with `source('example.R')`.
+
+The example solutions must pass the tests without failures. Additionally the tests should not run longer than a few seconds.
+
+In order to be accepted by Travis-CI, every exercise must be registered in `config.json`.
+
+### Style guide
+Given that there are a variety of R style guides in circulation, at this stage we don't enforce a particular style guide, but our preference is to have R code in this repository follow Hadley Wickham's [R style guide](http://adv-r.had.co.nz/Style.html).
+
+You are thus encouraged to run [`lintr`](https://github.com/jimhester/lintr) on your R scripts before opening a [pull request](#writing-a-pull-request) in order to check that your code adheres to this style guide before submitting it for review.
 
 ## License
 
@@ -13,4 +122,4 @@ The MIT License (MIT)
 Copyright (c) 2014 Katrina Owen, _@kytrinyx.com
 
 ## R icon
-The R logo was created by Hadley Wickham and others at RStudio. The original file is licensed under version [4.0 of the Creative Commons Attribution-Share Alike license](https://creativecommons.org/licenses/by-sa/4.0/). We have adapted it, changing the colour scheme, for use on Exercism.
+The R logo was created by [Hadley Wickham](https://github.com/hadley) and others at [RStudio](https://www.rstudio.com/). The original file is licensed under version [4.0 of the Creative Commons Attribution-Share Alike license](https://creativecommons.org/licenses/by-sa/4.0/). We have adapted it, changing the colour scheme, for use on Exercism.

data/tracks/rust/exercises/triangle/tests/triangle.rs

@@ -23,7 +23,6 @@ fn equilateral_triangles_have_equal_sides() {
     let sides = [2, 2, 2];
     let triangle = Triangle::build(sides).unwrap();
     assert!(triangle.is_equilateral());
-    assert!(!triangle.is_isosceles());
     assert!(!triangle.is_scalene());
 }
 
@@ -33,13 +32,12 @@ fn larger_equilateral_triangles_have_equal_sides() {
     let sides = [10, 10, 10];
     let triangle = Triangle::build(sides).unwrap();
     assert!(triangle.is_equilateral());
-    assert!(!triangle.is_isosceles());
     assert!(!triangle.is_scalene());
 }
 
 #[test]
 #[ignore]
-fn isocseles_triangles_have_two_equal_sides_one() {
+fn isosceles_triangles_have_two_equal_sides_one() {
     let sides = [3, 4, 4];
     let triangle = Triangle::build(sides).unwrap();
     assert!(!triangle.is_equilateral());
@@ -49,7 +47,7 @@ fn isocseles_triangles_have_two_equal_sides_one() {
 
 #[test]
 #[ignore]
-fn isocseles_triangles_have_two_equal_sides_two() {
+fn isosceles_triangles_have_two_equal_sides_two() {
     let sides = [4, 4, 3];
     let triangle = Triangle::build(sides).unwrap();
     assert!(!triangle.is_equilateral());
@@ -59,7 +57,7 @@ fn isocseles_triangles_have_two_equal_sides_two() {
 
 #[test]
 #[ignore]
-fn isocseles_triangles_have_two_equal_sides_three() {
+fn isosceles_triangles_have_two_equal_sides_three() {
     let sides = [4, 3, 4];
     let triangle = Triangle::build(sides).unwrap();
     assert!(!triangle.is_equilateral());
@@ -69,7 +67,7 @@ fn isocseles_triangles_have_two_equal_sides_three() {
 
 #[test]
 #[ignore]
-fn isocseles_triangles_have_two_equal_sides_four() {
+fn isosceles_triangles_have_two_equal_sides_four() {
     let sides = [4, 7, 4];
     let triangle = Triangle::build(sides).unwrap();
     assert!(!triangle.is_equilateral());
@@ -156,12 +154,11 @@ fn sum_of_two_sides_must_equal_or_exceed_the_remaining_side_two() {
 //     let sides = [0.2, 0.2, 0.2];
 //     let triangle = Triangle::build(sides).unwrap();
 //     assert!(triangle.is_equilateral());
-//     assert!(!triangle.is_isosceles());
 //     assert!(!triangle.is_scalene());
 // }
 //
 // #[test]
-// fn isocseles_triangle_with_floating_point_sides() {
+// fn isosceles_triangle_with_floating_point_sides() {
 //     let sides = [0.3, 0.4, 0.4];
 //     let triangle = Triangle::build(sides).unwrap();
 //     assert!(!triangle.is_equilateral());

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.0.8.41
+  version: 2.0.8.42
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-04-05 00:00:00.000000000 Z
+date: 2017-04-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -557,6 +557,7 @@ files:
 - tracks/bash/exercises/rna-transcription/rna_transcription_test.sh
 - tracks/bash/img/icon.png
 - tracks/c/.git
+- tracks/c/.github/stale.yml
 - tracks/c/.gitignore
 - tracks/c/.travis.yml
 - tracks/c/README.md
@@ -1805,6 +1806,7 @@ files:
 - tracks/csharp/exercises/sublist/Sublist.csproj
 - tracks/csharp/exercises/sublist/SublistTest.cs
 - tracks/csharp/exercises/sum-of-multiples/Example.cs
+- tracks/csharp/exercises/sum-of-multiples/HINTS.md
 - tracks/csharp/exercises/sum-of-multiples/SumOfMultiples.cs
 - tracks/csharp/exercises/sum-of-multiples/SumOfMultiples.csproj
 - tracks/csharp/exercises/sum-of-multiples/SumOfMultiplesTest.cs
@@ -1853,6 +1855,7 @@ files:
 - tracks/csharp/exercises/wordy/Wordy.csproj
 - tracks/csharp/exercises/wordy/WordyTest.cs
 - tracks/csharp/exercises/zebra-puzzle/Example.cs
+- tracks/csharp/exercises/zebra-puzzle/HINTS.md
 - tracks/csharp/exercises/zebra-puzzle/ZebraPuzzle.cs
 - tracks/csharp/exercises/zebra-puzzle/ZebraPuzzle.csproj
 - tracks/csharp/exercises/zebra-puzzle/ZebraPuzzleTest.cs
@@ -3603,6 +3606,7 @@ files:
 - tracks/groovy/.git
 - tracks/groovy/.gitignore
 - tracks/groovy/.travis.yml
+- tracks/groovy/LICENSE
 - tracks/groovy/README.md
 - tracks/groovy/SETUP.md
 - tracks/groovy/bin/fetch-configlet
@@ -4405,9 +4409,9 @@ files:
 - tracks/java/exercises/minesweeper/src/main/java/MinesweeperBoard.java
 - tracks/java/exercises/minesweeper/src/test/java/MinesweeperBoardTest.java
 - tracks/java/exercises/nth-prime/build.gradle
-- tracks/java/exercises/nth-prime/src/example/java/Prime.java
+- tracks/java/exercises/nth-prime/src/example/java/PrimeCalculator.java
 - tracks/java/exercises/nth-prime/src/main/java/.keep
-- tracks/java/exercises/nth-prime/src/test/java/PrimeTest.java
+- tracks/java/exercises/nth-prime/src/test/java/PrimeCalculatorTest.java
 - tracks/java/exercises/nucleotide-count/build.gradle
 - tracks/java/exercises/nucleotide-count/src/example/java/DNA.java
 - tracks/java/exercises/nucleotide-count/src/main/java/DNA.java
@@ -5275,6 +5279,7 @@ files:
 - tracks/lfe/rebar.config
 - tracks/lfe/rebar.lock
 - tracks/lisp/.git
+- tracks/lisp/.github/stale.yml
 - tracks/lisp/.gitignore
 - tracks/lisp/.travis.yml
 - tracks/lisp/ABOUT.org
@@ -5379,6 +5384,7 @@ files:
 - tracks/lisp/good.out
 - tracks/lisp/img/icon.png
 - tracks/lua/.git
+- tracks/lua/.github/stale.yml
 - tracks/lua/.gitignore
 - tracks/lua/.travis.yml
 - tracks/lua/LICENSE
@@ -6193,6 +6199,7 @@ files:
 - tracks/perl5/exercises/wordy/wordy.t
 - tracks/perl5/img/icon.png
 - tracks/perl6/.git
+- tracks/perl6/.github/stale.yml
 - tracks/perl6/.gitignore
 - tracks/perl6/.travis.yml
 - tracks/perl6/LICENSE
@@ -6549,6 +6556,10 @@ files:
 - tracks/purescript/exercises/acronym/examples/src/Acronym.purs
 - tracks/purescript/exercises/acronym/src/Acronym.purs
 - tracks/purescript/exercises/acronym/test/Main.purs
+- tracks/purescript/exercises/all-your-base/bower.json
+- tracks/purescript/exercises/all-your-base/examples/src/AllYourBase.purs
+- tracks/purescript/exercises/all-your-base/src/AllYourBase.purs
+- tracks/purescript/exercises/all-your-base/test/Main.purs
 - tracks/purescript/exercises/allergies/bower.json
 - tracks/purescript/exercises/allergies/examples/src/Allergies.purs
 - tracks/purescript/exercises/allergies/src/Allergies.purs
@@ -6599,6 +6610,7 @@ files:
 - tracks/purescript/exercises/word-count/test/Main.purs
 - tracks/purescript/img/icon.png
 - tracks/python/.git
+- tracks/python/.github/stale.yml
 - tracks/python/.gitignore
 - tracks/python/.travis.yml
 - tracks/python/LICENSE
@@ -6855,8 +6867,10 @@ files:
 - tracks/python/requirements-travis.txt
 - tracks/python/test/check-exercises.py
 - tracks/r/.git
+- tracks/r/.github/stale.yml
 - tracks/r/.gitignore
 - tracks/r/.travis.yml
+- tracks/r/LICENSE
 - tracks/r/README.md
 - tracks/r/bin/fetch-configlet
 - tracks/r/config.json