trackler 2.2.1.135 → 2.2.1.136

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e668f282132d63c1231f79fddb5137f51faf314e
-  data.tar.gz: 127deef6f4aa01b28b4b74330f9826aed28fa24c
+  metadata.gz: 699eec34e75cdaa468a3ce1c7a3886760cf01a6a
+  data.tar.gz: e4eba91c00477ab11723b6ab763fddc63a8d96e5
 SHA512:
-  metadata.gz: 04c5e56a00719b737739a8490682bafee1888a1879a26a4a6b008ad301e5df2811d223bcf5f6cf819b834366863087b92dd77b78dd4ab524c7fe83e6dc31f3ca
-  data.tar.gz: d5dfc98f5a4349fa1c383b66f954eaeed399eb836f40fac6bde8a57531572c3b05513e2b59ab33e4b91761d5c5592f4f827d80532fdb684d9e84524e56151d15
+  metadata.gz: f33e6a32dbb9cbde60a28160521ffe29f85855f0ccdc367576bf22167b2588dd267f38067773cec141423efe21314cb22ac6dea70e51b288df5d7ddef29d3468
+  data.tar.gz: a8edb8f1fac25c9f7fd9520803b22cbb6711d1741637c84fe0842e0544365610fdbc87d1d8e4a8a95eb81f0643b5a4534d057cdff14184cabf9a9f57c50635e0

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.135"
+  VERSION = "2.2.1.136"
 end

data/problem-specifications/exercises/pov/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "pov",
-  "version": "1.2.0",
+  "version": "1.3.0",
   "cases": [
     {
       "description": "Reroot a tree so that its root is the specified node.",
@@ -434,6 +434,38 @@
             "cousin-1"
           ]
         },
+        {
+          "description": "Can find path not involving root",
+          "property": "pathTo",
+          "input": {
+            "from": "x",
+            "to": "sibling-1",
+            "tree": {
+              "label": "grandparent",
+              "children": [
+                {
+                  "label": "parent",
+                  "children": [
+                    {
+                      "label": "x"
+                    },
+                    {
+                      "label": "sibling-0"
+                    },
+                    {
+                      "label": "sibling-1"
+                    }
+                  ]
+                }
+              ]
+            }
+          },
+          "expected": [
+            "x",
+            "parent",
+            "sibling-1"
+          ]
+        },
         {
           "description": "Can find path from nodes other than x",
           "property": "pathTo",

data/tracks/c/exercises/acronym/test/test_acronym.c

@@ -26,14 +26,6 @@ void test_null_string(void)
    test_abbreviation(phrase, expected);
 }
 
-void test_empty_string(void)
-{
-   TEST_IGNORE();
-   char *phrase = "";
-   char *expected = NULL;
-   test_abbreviation(phrase, expected);
-}
-
 void test_basic_abbreviation(void)
 {
    TEST_IGNORE();
@@ -58,6 +50,22 @@ void test_punctuation(void)
    test_abbreviation(phrase, expected);
 }
 
+void test_non_acronym_all_caps_words(void)
+{
+   TEST_IGNORE();
+   char *phrase = "GNU Image Manipulation Program";
+   char *expected = "GIMP";
+   test_abbreviation(phrase, expected);
+}
+
+void test_hyphenated(void)
+{
+   TEST_IGNORE();
+   char *phrase = "Complementary metal-oxide semiconductor";
+   char *expected = "CMOS";
+   test_abbreviation(phrase, expected);
+}
+
 void test_all_caps_words(void)
 {
    TEST_IGNORE();
@@ -66,19 +74,19 @@ void test_all_caps_words(void)
    test_abbreviation(phrase, expected);
 }
 
-void test_non_acronym_all_caps_words(void)
+void test_empty_string(void)
 {
    TEST_IGNORE();
-   char *phrase = "GNU Image Manipulation Program";
-   char *expected = "GIMP";
+   char *phrase = "";
+   char *expected = NULL;
    test_abbreviation(phrase, expected);
 }
 
-void test_hyphenated(void)
+void test_all_words_starting_with_lowercase(void)
 {
    TEST_IGNORE();
-   char *phrase = "Complementary metal-oxide semiconductor";
-   char *expected = "CMOS";
+   char *phrase = "for what it's worth";
+   char *expected = "FWIW";
    test_abbreviation(phrase, expected);
 }
 
@@ -88,13 +96,13 @@ int main(void)
 
    RUN_TEST(test_basic_abbreviation);
    RUN_TEST(test_null_string);
-   RUN_TEST(test_empty_string);
    RUN_TEST(test_lower_case_words);
    RUN_TEST(test_punctuation);
-   RUN_TEST(test_all_caps_words);
    RUN_TEST(test_non_acronym_all_caps_words);
    RUN_TEST(test_hyphenated);
-
+   RUN_TEST(test_all_caps_words);
+   RUN_TEST(test_empty_string);
+   RUN_TEST(test_all_words_starting_with_lowercase);
    UnityEnd();
    return 0;
 }

data/tracks/csharp/exercises/binary-search-tree/BinarySearchTreeTest.cs

@@ -1,5 +1,7 @@
-using System.Linq;
+// This file was auto-generated based on version 1.0.0 of the canonical data.
+
 using Xunit;
+using System.Linq;
 
 public class BinarySearchTreeTest
 {
@@ -11,67 +13,74 @@ public void Data_is_retained()
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Inserting_less()
+    public void Can_create_complex_tree()
     {
-        var tree = new BinarySearchTree(4).Add(2);
+        var tree = new BinarySearchTree(new[] { 4, 2, 6, 1, 3, 5, 7 });
         Assert.Equal(4, tree.Value);
         Assert.Equal(2, tree.Left.Value);
+        Assert.Equal(1, tree.Left.Left.Value);
+        Assert.Equal(3, tree.Left.Right.Value);
+        Assert.Equal(6, tree.Right.Value);
+        Assert.Equal(5, tree.Right.Left.Value);
+        Assert.Equal(7, tree.Right.Right.Value);
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Inserting_same()
+    public void Smaller_number_at_left_node()
     {
-        var tree = new BinarySearchTree(4).Add(4);
+        var tree = new BinarySearchTree(new[] { 4, 2 });
+        Assert.Equal(4, tree.Value);
+        Assert.Equal(2, tree.Left.Value);
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Same_number_at_left_node()
+    {
+        var tree = new BinarySearchTree(new[] { 4, 4 });
         Assert.Equal(4, tree.Value);
         Assert.Equal(4, tree.Left.Value);
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Inserting_greater()
+    public void Greater_number_at_right_node()
     {
-        var tree = new BinarySearchTree(4).Add(5);
+        var tree = new BinarySearchTree(new[] { 4, 5 });
         Assert.Equal(4, tree.Value);
         Assert.Equal(5, tree.Right.Value);
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Complex_tree()
+    public void Can_sort_single_number()
     {
-        var tree = new BinarySearchTree(new [] {  4, 2, 6, 1, 3, 7, 5 });
-        Assert.Equal(4, tree.Value);
-        Assert.Equal(2, tree.Left.Value);
-        Assert.Equal(1, tree.Left.Left.Value);
-        Assert.Equal(3, tree.Left.Right.Value);
-        Assert.Equal(6, tree.Right.Value);
-        Assert.Equal(5, tree.Right.Left.Value);
-        Assert.Equal(7, tree.Right.Right.Value);
+        var tree = new BinarySearchTree(2);
+        Assert.Equal(new[] { 2 }, tree.AsEnumerable());
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Iterating_one_element()
+    public void Can_sort_if_second_number_is_smaller_than_first()
     {
-        var elements = new BinarySearchTree(4).AsEnumerable();
-        Assert.Equal(new [] { 4 }, elements);
+        var tree = new BinarySearchTree(new[] { 2, 1 });
+        Assert.Equal(new[] { 1, 2 }, tree.AsEnumerable());
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Iterating_over_smaller_element()
+    public void Can_sort_if_second_number_is_same_as_first()
     {
-        var elements = new BinarySearchTree(new[] { 4, 2 }).AsEnumerable();
-        Assert.Equal(new[] { 2, 4 }, elements);
+        var tree = new BinarySearchTree(new[] { 2, 2 });
+        Assert.Equal(new[] { 2, 2 }, tree.AsEnumerable());
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Iterating_over_larger_element()
+    public void Can_sort_if_second_number_is_greater_than_first()
     {
-        var elements = new BinarySearchTree(new[] { 4, 5 }).AsEnumerable();
-        Assert.Equal(new[] { 4, 5 }, elements);
+        var tree = new BinarySearchTree(new[] { 2, 3 });
+        Assert.Equal(new[] { 2, 3 }, tree.AsEnumerable());
     }
 
     [Fact(Skip = "Remove to run test")]
-    public void Iterating_over_complex_element()
+    public void Can_sort_complex_tree()
     {
-        var elements = new BinarySearchTree(new[] { 4, 2, 1, 3, 6, 7, 5 }).AsEnumerable();
-        Assert.Equal(new[] { 1, 2, 3, 4, 5, 6, 7 }, elements);
+        var tree = new BinarySearchTree(new[] { 2, 1, 3, 6, 7, 5 });
+        Assert.Equal(new[] { 1, 2, 3, 5, 6, 7 }, tree.AsEnumerable());
     }
 }

data/tracks/csharp/generators/Exercises/BinarySearchTree.cs

@@ -0,0 +1,69 @@
+using System;
+using System.Collections.Generic;
+using System.Text;
+using Generators.Output;
+
+namespace Generators.Exercises
+{
+    public class ExpectedDataBinaryTree
+    {
+        public ExpectedDataBinaryTree(System.Collections.Generic.Dictionary<string, object> treeNode)
+        {
+            Value = treeNode["data"] as string;
+            if (treeNode["left"] != null) this.Left = new ExpectedDataBinaryTree(treeNode["left"] as System.Collections.Generic.Dictionary<string, object>);
+            if (treeNode["right"] != null) this.Right = new ExpectedDataBinaryTree(treeNode["right"] as System.Collections.Generic.Dictionary<string, object>);
+        }
+
+        public int Level { get; }
+        public string Value { get; }
+        public ExpectedDataBinaryTree Left { get; private set; }
+        public ExpectedDataBinaryTree Right { get; private set; }
+
+        public IEnumerable<string> TestAsserts(string traverse = "")
+        {
+            yield return $"Assert.Equal({this.Value}, tree{traverse}.Value);";
+            if (this.Left != null) foreach (var assert in this.Left.TestAsserts(traverse + ".Left")) yield return assert;
+            if (this.Right != null) foreach (var assert in this.Right.TestAsserts(traverse + ".Right")) yield return assert;
+        }
+    }
+
+    public class BinarySearchTree : GeneratorExercise
+    {
+        protected override HashSet<string> AddAdditionalNamespaces() => new HashSet<string>() { typeof(System.Linq.IQueryable).Namespace };
+
+        private StringBuilder testFactCodeLines;
+        void addCodeLine(string line) => testFactCodeLines.Append(line + "\r\n");
+
+        protected override string RenderTestMethodBodyAssert(TestMethodBody testMethodBody)
+        {
+            testFactCodeLines = new StringBuilder();
+            var canonicalDataCase = testMethodBody.CanonicalDataCase;
+            var input = canonicalDataCase.Properties["input"] as System.Collections.Generic.Dictionary<string, object>;
+            var constructorData = input["treeData"] as string[];
+
+            if (constructorData.Length == 1) addCodeLine($"var tree = new BinarySearchTree({constructorData[0]});");
+            else
+            {
+                string constructorDataString = string.Join(", ", constructorData);
+                addCodeLine($"var tree = new BinarySearchTree(new[] {{ {constructorDataString} }});");
+            }
+
+            var expected = canonicalDataCase.Properties["expected"] as System.Collections.Generic.Dictionary<string, object>;
+            if (expected != null)
+            {
+                var tree = new ExpectedDataBinaryTree(expected as System.Collections.Generic.Dictionary<string, object>);
+                foreach (var assert in tree.TestAsserts()) addCodeLine(assert);
+            }
+            else
+            {
+                string expectedArrayString = string.Join(", ", canonicalDataCase.Properties["expected"] as string[]);
+                addCodeLine($"Assert.Equal(new[] {{ {expectedArrayString} }}, tree.AsEnumerable());");
+            }
+
+            return TemplateRenderer.RenderInline(testFactCodeLines.ToString(), testMethodBody.AssertTemplateParameters);
+        }
+
+    }
+}
+
+

data/tracks/haskell/config.json

@@ -282,6 +282,7 @@
       "unlocked_by": null,
       "difficulty": 3,
       "topics": [
+        "Define type"
       ]
     },
     {

data/tracks/haskell/exercises/accumulate/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Accumulate
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/acronym/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Acronym
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/all-your-base/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Base
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/allergies/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Allergies
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/alphametics/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Alphametics
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/anagram/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Anagram
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/atbash-cipher/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Atbash
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/bank-account/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: BankAccount
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/beer-song/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Beer
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/binary-search-tree/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: BST
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/binary/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Binary
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.
 

data/tracks/haskell/exercises/bob/package.yaml

@@ -7,7 +7,7 @@ dependencies:
 library:
   exposed-modules: Bob
   source-dirs: src
-  dependencies:
+  # dependencies:
   # - foo       # List here the packages you
   # - bar       # want to use in your solution.