trackler 2.2.1.68 → 2.2.1.69

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 93727b2027f0b9bb82b47a47508ca7ffcc6ff35d
-  data.tar.gz: 5b5ad9daef87088409e3e8b2c22ad16803cddd8d
+  metadata.gz: c900f215603f2847b56ef3c2542264b3623c134a
+  data.tar.gz: 9cee0a9156eace5beff7d34a075513d00b956307
 SHA512:
-  metadata.gz: 76aff154bb6cfb996c616f4f77cfd2de03d6029fbf1cab3255bb162310a6b41767576a818b001abeec9f3e875b27bc9118833ba83ae8e65a5ed35df9427be62e
-  data.tar.gz: 361c13c1a88ce84f99c1bfea50d5af3590fc9ee21a85a22e10c3333089f29cba08211a6e703c6eb1d23c5185636170fd7c93603f4ef6b889e28261121e249f6c
+  metadata.gz: f04eed61e824d8cfdcc8baa814ca910ef02348c106ab2fe518778458eada7dc50d70d9ee816bd9553891e9088ddc50aa9d4f2a526c41cbeddf58d838064c9a4f
+  data.tar.gz: 1a2cbfd9bbb5c12dcdcfce7aaf8577cbc20732ba6eaaa143cdd52351cc044ef7682cf450dbbc8e948c1ac0c167066502b3584c380297ab5a3d376e60e368aa99

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.68"
+  VERSION = "2.2.1.69"
 end

data/problem-specifications/exercises/pov/description.md

@@ -1,7 +1,5 @@
 Reparent a graph on a selected node.
 
-# Tree Reparenting
-
 This exercise is all about re-orientating a graph to see things from a different
 point of view. For example family trees are usually presented from the
 ancestor's perspective:

data/problem-specifications/exercises/protein-translation/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "protein-translation",
-  "version": "1.0.0",
+  "version": "1.0.1",
   "cases": [
     {
       "description": "Translate input RNA sequences into proteins",
@@ -136,13 +136,13 @@
           "expected": ["Methionine","Phenylalanine"]
         },
         {
-          "description": "Translation stops if STOP codon in middle of sequence of three-codon sequence",
+          "description": "Translation stops if STOP codon in middle of three-codon sequence",
           "property": "proteins",
           "strand": "UGGUAGUGG",
           "expected": ["Tryptophan"]
         },
         {
-          "description": "Translation stops if codon in middle of sequence of six-codon sequence",
+          "description": "Translation stops if STOP codon in middle of six-codon sequence",
           "property": "proteins",
           "strand": "UGGUGUUAUUAAUGGUUU",
           "expected": ["Tryptophan","Cysteine","Tyrosine"]

data/problem-specifications/exercises/simple-cipher/description.md

@@ -56,15 +56,13 @@ would get the same thing as the Caesar Cipher.
 
 The weakest link in any cipher is the human being. Let's make your
 substitution cipher a little more fault tolerant by providing a source
-of randomness and ensuring that the key is not composed of numbers or
-capital letters.
+of randomness and ensuring that the key contains only lowercase letters.
 
 If someone doesn't submit a key at all, generate a truly random key of
-at least 100 characters in length, accessible via Cipher#key (the #
-syntax means instance variable)
+at least 100 characters in length.
 
-If the key submitted has capital letters or numbers, throw an
-ArgumentError with a message to that effect.
+If the key submitted is not composed only of lowercase letters, your
+solution should handle the error in a language-appropriate way.
 
 ## Extensions
 

data/tracks/csharp/exercises/all-your-base/AllYourBaseTest.cs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 2.0.0 of the canonical data.
+// This file was auto-generated based on version 2.0.1 of the canonical data.
 
 using Xunit;
 using System;
@@ -126,7 +126,7 @@ public class AllYourBaseTest
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void First_base_is_one()
+    public void Input_base_is_one()
     {
         var inputBase = 1;
         var inputDigits = new int[0];
@@ -135,7 +135,7 @@ public class AllYourBaseTest
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void First_base_is_zero()
+    public void Input_base_is_zero()
     {
         var inputBase = 0;
         var inputDigits = new int[0];
@@ -144,7 +144,7 @@ public class AllYourBaseTest
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void First_base_is_negative()
+    public void Input_base_is_negative()
     {
         var inputBase = -2;
         var inputDigits = new[] { 1 };
@@ -171,7 +171,7 @@ public class AllYourBaseTest
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Second_base_is_one()
+    public void Output_base_is_one()
     {
         var inputBase = 2;
         var inputDigits = new[] { 1, 0, 1, 0, 1, 0 };
@@ -180,7 +180,7 @@ public class AllYourBaseTest
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Second_base_is_zero()
+    public void Output_base_is_zero()
     {
         var inputBase = 10;
         var inputDigits = new[] { 7 };
@@ -189,7 +189,7 @@ public class AllYourBaseTest
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Second_base_is_negative()
+    public void Output_base_is_negative()
     {
         var inputBase = 2;
         var inputDigits = new[] { 1 };

data/tracks/csharp/exercises/dominoes/README.md

@@ -1,24 +1,15 @@
 # Dominoes
 
-Make a chain of dominoes.
-
-Compute a way to order a given set of dominoes in such a way that they form a
+Compute whether there exists a way to order a given set of dominoes in such a way that they form a
 correct domino chain (the dots on one half of a stone match the dots on the
 neighbouring half of an adjacent stone) and that dots on the halfs of the stones
 which don't have a neighbour (the first and last stone) match each other.
 
-For example given the stones `21`, `23` and `13` you should compute something
-like `12 23 31` or `32 21 13` or `13 32 21` etc, where the first and last numbers are the same.
+For example given the stones `21`, `23` and `13` you should declare that there exists a possible chain (for example, `12`, `23` and `31` is a possible chain).
 
 For stones 12, 41 and 23 the resulting chain is not valid: 41 12 23's first and last numbers are not the same. 4 != 3
 
 Some test cases may use duplicate stones in a chain solution, assume that multiple Domino sets are being used.
 
-### Submitting Exercises
-
-Note that, when trying to submit an exercise, make sure the exercise file that you're submitting is in the `exercism/csharp/<exerciseName>` directory.
-
-For example, if you're submitting `bob.cs` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/csharp/bob/bob.cs`.
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/csharp/exercises/reverse-string/ReverseStringTest.cs

@@ -1,11 +1,11 @@
-// This file was auto-generated based on version 1.0.0 of the canonical data.
+// This file was auto-generated based on version 1.0.1 of the canonical data.
 
 using Xunit;
 
 public class ReverseStringTest
 {
     [Fact]
-    public void Empty_string()
+    public void An_empty_string()
     {
         Assert.Equal("", ReverseString.Reverse(""));
     }

data/tracks/dart/CONTRIBUTING.md

@@ -32,16 +32,17 @@ Please keep the following in mind:
 
 - Please run the following commands before submitting your PR:
     * `pub run test` - All the tests for Dart exercises can be run from the top level of the repo with this command
-    * `bin/configlet lint .` - Checks the config.json for formatting issues
+    * `bin/fetch-configlet` - Downloads the latest version of configlet and stores it in the bin/ directory
+    * `bin/configlet lint --track-id dart .` - Checks the config.json for formatting issues
     * `bin/configlet fmt .` - Formats the config.json
     * `bin/check_formatting` - Checks All the Dart files for formatting issues
     * `pub run dart_style:format -l 120 -w .` - Formats all the Dart files
 
-- Once a Pull Request is approved, the contributing branch will be Rebased onto the latest version of our master branch.
+- Once a Pull Request is approved, the contributing branch will be rebased onto the latest version of our master branch.
 
 ## Contributing a New Exercise ###
 
-- All Exercism exercises must be defined in [problem-specifications](https://github.com/exercism/problem-specifications/tree/master/exercises) before they are implemented for a specific track. Please submit a PR there if your exercise is new to Exercism.
+- All Exercism exercises must be defined in [problem-specifications](https://github.com/exercism/problem-specifications/tree/master/exercises) before they are implemented for a specific track. If your exercise is new, please submit a PR to [exercism/problem-specification].
 
 - Please make sure the new exercise conforms to specifications in the [exercism/problem-specifications](https://github.com/exercism/problem-specifications) repo.
 
@@ -58,4 +59,6 @@ Please keep the following in mind:
 
 - Please do not commit any configuration files or directories inside the exercise other than pubspec.lock and pubspec.yaml
 
-- Be sure to add it to the appropriate place in the `config.json` file. Also, please run `bin/fetch-configlet && bin/configlet lint .` to ensure the exercise is configured correctly.
+- Be sure to add the new exercise to the appropriate place in the `config.json` file.
+
+- Please run `bin/fetch-configlet && bin/configlet lint --track-id dart .` to ensure the exercise is configured correctly.

data/tracks/delphi/config.json

@@ -3,7 +3,7 @@
   "blurb": "Object Pascal based, Delphi is great for developing cross-platform desktop, mobile, web, and console applications.",
   "exercises": [
     {
-      "core": false,
+      "core": true,
       "difficulty": 1,
       "slug": "hello-world",
       "topics": [
@@ -13,7 +13,7 @@
       "uuid": "497011b8-4dcf-4084-a7d1-11ea954e605f"
     },
     {
-      "core": true,
+      "core": false,
       "difficulty": 1,
       "slug": "two-fer",
       "topics": [
@@ -50,29 +50,29 @@
         "strings",
         "transforming"
       ],
-      "unlocked_by": null,
+      "unlocked_by": "roman-numerals",
       "uuid": "4a50bfd2-f6c9-480e-af82-d468cf585f0d"
     },
     {
-      "core": false,
+      "core": true,
       "difficulty": 2,
       "slug": "raindrops",
       "topics": [
         "filtering",
         "text_formatting"
       ],
-      "unlocked_by": "two-fer",
+      "unlocked_by": null,
       "uuid": "2617f4a3-cf0e-4690-a464-45eac3f97317"
     },
     {
       "core": false,
-      "difficulty": 2,
+      "difficulty": 1,
       "slug": "hamming",
       "topics": [
         "filtering",
         "strings"
       ],
-      "unlocked_by": null,
+      "unlocked_by": "hello-world",
       "uuid": "c623f1f2-8e54-4c46-a577-2570fa2f317b"
     },
     {
@@ -82,7 +82,7 @@
       "topics": [
         "classes"
       ],
-      "unlocked_by": null,
+      "unlocked_by": "clock",
       "uuid": "777f9f9e-acf8-4b73-89c7-ee08d4ff49e3"
     },
     {
@@ -108,17 +108,18 @@
       "uuid": "f22f0ac1-3836-4ece-9c47-491929c8fc85"
     },
     {
-      "core": true,
+      "core": false,
       "difficulty": 2,
       "slug": "grains",
       "topics": [
         "integers",
         "recursion"
       ],
+      "unlocked_by": "leap",
       "uuid": "d0ddd5dc-30cd-4876-937d-9e89bae7dc93"
     },
     {
-      "core": false,
+      "core": true,
       "difficulty": 2,
       "slug": "collatz-conjecture",
       "topics": [
@@ -137,17 +138,18 @@
         "algorithms",
         "text_formatting"
       ],
-      "unlocked_by": "two-fer",
+      "unlocked_by": "raindrops",
       "uuid": "48f443f6-3bbc-4086-9f47-f46bcfa0623a"
     },
     {
-      "core": true,
+      "core": false,
       "difficulty": 3,
       "slug": "phone-number",
       "topics": [
         "parsing",
         "transforming"
       ],
+      "unlocked_by": "collatz-conjecture",
       "uuid": "cba5cf99-8001-4113-af80-cf9c041f1b21"
     },
     {
@@ -161,7 +163,7 @@
       "uuid": "964abaeb-b1b6-4609-bb9e-ca569302f406"
     },
     {
-      "core": false,
+      "core": true,
       "difficulty": 3,
       "slug": "binary-search",
       "topics": [
@@ -169,7 +171,7 @@
         "recursion",
         "searching"
       ],
-      "unlocked_by": "grains",
+      "unlocked_by": null,
       "uuid": "b1cfe374-4881-4e06-9333-d5d9b367580f"
     },
     {
@@ -183,13 +185,14 @@
       "uuid": "0223dfe4-3ff4-4f4e-8cd2-821e1fd50217"
     },
     {
-      "core": true,
+      "core": false,
       "difficulty": 3,
       "slug": "triangle",
       "topics": [
         "enumerations",
         "integers"
       ],
+      "unlocked_by": "leap",
       "uuid": "f5d43bcd-34fe-4b96-a687-254f7c0f5601"
     },
     {
@@ -224,14 +227,14 @@
       "uuid": "f949b958-d2e0-4f21-a6db-12ba89f8ab57"
     },
     {
-      "core": false,
+      "core": true,
       "difficulty": 5,
       "slug": "minesweeper",
       "topics": [
         "parsing",
         "transforming"
       ],
-      "unlocked_by": "phone-number",
+      "unlocked_by": null,
       "uuid": "5ab52a90-8a72-42f8-b430-042436041348"
     },
     {
@@ -252,7 +255,7 @@
         "algorithms",
         "control_flow_loops"
       ],
-      "unlocked_by": null,
+      "unlocked_by": "circular-buffer",
       "uuid": "88f7ab7d-30c1-4cb5-81ff-1114b5f78291"
     },
     {
@@ -287,7 +290,7 @@
         "strings",
         "transforming"
       ],
-      "unlocked_by": "phone-number",
+      "unlocked_by": "minesweeper",
       "uuid": "24d81651-de3b-4cc8-8a4a-67cefc0453f6"
     },
     {
@@ -299,7 +302,7 @@
         "parsing",
         "sorting"
       ],
-      "unlocked_by": null,
+      "unlocked_by": "minesweeper",
       "uuid": "d4f0509b-2687-4ee2-adbb-2a1a295a9975"
     }
   ],

data/tracks/ecmascript/CONTRIBUTING.md

@@ -0,0 +1,3 @@
+We like to keep the guidelines for all of our different language tracks in one place.
+
+You'll find them in the [docs repo](https://github.com/exercism/docs). Happy contributing! 😊

data/tracks/ecmascript/README.md

@@ -30,9 +30,6 @@ The make script will test all exercises:
 Pass the exercise name to make script to run the tests for a specific exercise:
 
     make test-assignment ASSIGNMENT=hello-world
-
-
+    
 ## Contributing Guide
-
-For an in-depth discussion of how exercism language tracks and exercises work, please see the [contributing guide](https://github.com/exercism/x-api/blob/master/CONTRIBUTING.md#the-exercise-data)
-
+For an in-depth discussion of how exercism language tracks and exercises work, please see [CONTRIBUTING.md](https://github.com/exercism/ecmascript/blob/master/CONTRIBUTING.md)

data/tracks/fsharp/config.json

@@ -866,6 +866,17 @@
       "unlocked_by": "accumulate",
       "uuid": "3741977a-adff-47bb-a9c5-c2e444805bac"
     },
+    {
+      "core": false,
+      "difficulty": 5,
+      "slug": "spiral-matrix",
+      "topics": [
+        "algorithms",
+        "matrices"
+      ],
+      "unlocked_by": "matrix",
+      "uuid": "52f8f299-b93b-4f44-bd5b-b445741b285d"
+    },
     {
       "core": false,
       "difficulty": 6,

data/tracks/fsharp/exercises/Exercises.sln

@@ -220,6 +220,8 @@ Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "RotationalCipher", "rotatio
 EndProject
 Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "IsbnVerifier", "isbn-verifier\IsbnVerifier.fsproj", "{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}"
 EndProject
+Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "SpiralMatrix", "spiral-matrix\SpiralMatrix.fsproj", "{4C02F0E3-90F6-4ACD-9D34-EDFF301B058D}"
+EndProject
 Global
 	GlobalSection(SolutionConfigurationPlatforms) = preSolution
 		Debug|Any CPU = Debug|Any CPU
@@ -662,6 +664,10 @@ Global
 		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Debug|Any CPU.Build.0 = Debug|Any CPU
 		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Release|Any CPU.ActiveCfg = Release|Any CPU
 		{531D1AB8-1297-4DE2-9B9B-3742A648EDB7}.Release|Any CPU.Build.0 = Release|Any CPU
+		{4C02F0E3-90F6-4ACD-9D34-EDFF301B058D}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{4C02F0E3-90F6-4ACD-9D34-EDFF301B058D}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{4C02F0E3-90F6-4ACD-9D34-EDFF301B058D}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{4C02F0E3-90F6-4ACD-9D34-EDFF301B058D}.Release|Any CPU.Build.0 = Release|Any CPU
 	EndGlobalSection
 	GlobalSection(SolutionProperties) = preSolution
 		HideSolutionNode = FALSE

data/tracks/fsharp/exercises/all-your-base/AllYourBaseTest.fs

@@ -1,4 +1,4 @@
-// This file was auto-generated based on version 2.0.0 of the canonical data.
+// This file was auto-generated based on version 2.0.1 of the canonical data.
 
 module AllYourBaseTest
 
@@ -104,7 +104,7 @@ let ``Leading zeros`` () =
     rebase inputBase inputDigits outputBase |> should equal expected
 
 [<Fact(Skip = "Remove to run test")>]
-let ``First base is one`` () =
+let ``Input base is one`` () =
     let inputBase = 1
     let inputDigits = []
     let outputBase = 10
@@ -112,7 +112,7 @@ let ``First base is one`` () =
     rebase inputBase inputDigits outputBase |> should equal expected
 
 [<Fact(Skip = "Remove to run test")>]
-let ``First base is zero`` () =
+let ``Input base is zero`` () =
     let inputBase = 0
     let inputDigits = []
     let outputBase = 10
@@ -120,7 +120,7 @@ let ``First base is zero`` () =
     rebase inputBase inputDigits outputBase |> should equal expected
 
 [<Fact(Skip = "Remove to run test")>]
-let ``First base is negative`` () =
+let ``Input base is negative`` () =
     let inputBase = -2
     let inputDigits = [1]
     let outputBase = 10
@@ -144,7 +144,7 @@ let ``Invalid positive digit`` () =
     rebase inputBase inputDigits outputBase |> should equal expected
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Second base is one`` () =
+let ``Output base is one`` () =
     let inputBase = 2
     let inputDigits = [1; 0; 1; 0; 1; 0]
     let outputBase = 1
@@ -152,7 +152,7 @@ let ``Second base is one`` () =
     rebase inputBase inputDigits outputBase |> should equal expected
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Second base is zero`` () =
+let ``Output base is zero`` () =
     let inputBase = 10
     let inputDigits = [7]
     let outputBase = 0
@@ -160,7 +160,7 @@ let ``Second base is zero`` () =
     rebase inputBase inputDigits outputBase |> should equal expected
 
 [<Fact(Skip = "Remove to run test")>]
-let ``Second base is negative`` () =
+let ``Output base is negative`` () =
     let inputBase = 2
     let inputDigits = [1]
     let outputBase = -7

data/tracks/fsharp/exercises/diamond/Diamond.fsproj

@@ -17,6 +17,7 @@
     <PackageReference Include="xunit" Version="2.3.1" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.3.1" />
     <PackageReference Include="FsUnit.xUnit" Version="3.0.0" />
+    <PackageReference Include="FsCheck.Xunit" Version="2.10.4" />
     <DotNetCliToolReference Include="dotnet-xunit" Version="2.3.1" />
   </ItemGroup>