linked-list: add generator

Author: ErikSchierboom

exercises/practice/linked-list/.meta/Generator.tpl

@@ -0,0 +1,21 @@
+using Xunit;
+
+public class DequeTests
+{
+    {{- for test in tests }}
+    [Fact{{ if !for.first }}(Skip = "Remove this Skip property to run this test"){{ end }}]
+    public void {{ test.testMethod }}()
+    {
+        var sut = new Deque<int>();
+        {{- for op in test.input.operations }}
+        {{- if op.operation != "count" }}
+        {{- if op.expected }}
+        Assert.Equal({{ op.expected }}, sut.{{ op.operation | string.capitalize }}());
+        {{- else }}
+        sut.{{ op.operation | string.capitalize }}({{ op.value }});
+        {{- end -}}
+        {{- end -}}
+        {{ end -}}
+    }
+    {{ end -}}
+}

exercises/practice/linked-list/.meta/tests.toml

@@ -29,12 +29,15 @@ description = "pop, push, shift, and unshift can be used in any order"
 
 [88f65c0c-4532-4093-8295-2384fb2f37df]
 description = "count an empty list"
+include = false
 
 [fc055689-5cbe-4cd9-b994-02e2abbb40a5]
 description = "count a list with items"
+include = false
 
 [8272cef5-130d-40ea-b7f6-5ffd0790d650]
 description = "count is correct after mutation"
+include = false
 
 [229b8f7a-bd8a-4798-b64f-0dc0bb356d95]
 description = "popping to empty doesn't break the list"
@@ -44,24 +47,32 @@ description = "shifting to empty doesn't break the list"
 
 [e8f7c600-d597-4f79-949d-8ad8bae895a6]
 description = "deletes the only element"
+include = false
 
 [fd65e422-51f3-45c0-9fd0-c33da638f89b]
 description = "deletes the element with the specified value from the list"
+include = false
 
 [59db191a-b17f-4ab7-9c5c-60711ec1d013]
 description = "deletes the element with the specified value from the list, re-assigns tail"
+include = false
 
 [58242222-5d39-415b-951d-8128247f8993]
 description = "deletes the element with the specified value from the list, re-assigns head"
+include = false
 
 [ee3729ee-3405-4bd2-9bad-de0d4aa5d647]
 description = "deletes the first of two elements"
+include = false
 
 [47e3b3b4-b82c-4c23-8c1a-ceb9b17cb9fb]
 description = "deletes the second of two elements"
+include = false
 
 [7b420958-f285-4922-b8f9-10d9dcab5179]
 description = "delete does not modify the list if the element is not found"
+include = false
 
 [7e04828f-6082-44e3-a059-201c63252a76]
 description = "deletes only the first occurrence"
+include = false

exercises/practice/linked-list/LinkedListTests.cs

@@ -3,84 +3,88 @@
 public class DequeTests
 {
     [Fact]
-    public void Push_and_pop_are_first_in_last_out_order()
+    public void Pop_gets_element_from_the_list()
     {
-        var deque = new Deque<int>();
-        deque.Push(10);
-        deque.Push(20);
-        Assert.Equal(20, deque.Pop());
-        Assert.Equal(10, deque.Pop());
+        var sut = new Deque<int>();
+        sut.Push(7);
+        Assert.Equal(7, sut.Pop());
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Push_and_shift_are_first_in_first_out_order()
+    public void Push_pop_respectively_add_remove_at_the_end_of_the_list()
     {
-        var deque = new Deque<int>();
-        deque.Push(10);
-        deque.Push(20);
-        Assert.Equal(10, deque.Shift());
-        Assert.Equal(20, deque.Shift());
+        var sut = new Deque<int>();
+        sut.Push(11);
+        sut.Push(13);
+        Assert.Equal(13, sut.Pop());
+        Assert.Equal(11, sut.Pop());
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Unshift_and_shift_are_last_in_first_out_order()
+    public void Shift_gets_an_element_from_the_list()
     {
-        var deque = new Deque<int>();
-        deque.Unshift(10);
-        deque.Unshift(20);
-        Assert.Equal(20, deque.Shift());
-        Assert.Equal(10, deque.Shift());
+        var sut = new Deque<int>();
+        sut.Push(17);
+        Assert.Equal(17, sut.Shift());
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Unshift_and_pop_are_last_in_last_out_order()
+    public void Shift_gets_first_element_from_the_list()
     {
-        var deque = new Deque<int>();
-        deque.Unshift(10);
-        deque.Unshift(20);
-        Assert.Equal(10, deque.Pop());
-        Assert.Equal(20, deque.Pop());
+        var sut = new Deque<int>();
+        sut.Push(23);
+        sut.Push(5);
+        Assert.Equal(23, sut.Shift());
+        Assert.Equal(5, sut.Shift());
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Push_and_pop_can_handle_multiple_values()
+    public void Unshift_adds_element_at_start_of_the_list()
     {
-        var deque = new Deque<int>();
-        deque.Push(10);
-        deque.Push(20);
-        deque.Push(30);
-        Assert.Equal(30, deque.Pop());
-        Assert.Equal(20, deque.Pop());
-        Assert.Equal(10, deque.Pop());
+        var sut = new Deque<int>();
+        sut.Unshift(23);
+        sut.Unshift(5);
+        Assert.Equal(5, sut.Shift());
+        Assert.Equal(23, sut.Shift());
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Unshift_and_shift_can_handle_multiple_values()
+    public void Pop_push_shift_and_unshift_can_be_used_in_any_order()
     {
-        var deque = new Deque<int>();
-        deque.Unshift(10);
-        deque.Unshift(20);
-        deque.Unshift(30);
-        Assert.Equal(30, deque.Shift());
-        Assert.Equal(20, deque.Shift());
-        Assert.Equal(10, deque.Shift());
+        var sut = new Deque<int>();
+        sut.Push(1);
+        sut.Push(2);
+        Assert.Equal(2, sut.Pop());
+        sut.Push(3);
+        Assert.Equal(1, sut.Shift());
+        sut.Unshift(4);
+        sut.Push(5);
+        Assert.Equal(4, sut.Shift());
+        Assert.Equal(5, sut.Pop());
+        Assert.Equal(3, sut.Shift());
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void All_methods_of_manipulating_the_deque_can_be_used_together()
+    public void Popping_to_empty_doesn_t_break_the_list()
     {
-        var deque = new Deque<int>();
-        deque.Push(10);
-        deque.Push(20);
-        Assert.Equal(20, deque.Pop());
-
-        deque.Push(30);
-        Assert.Equal(10, deque.Shift());
+        var sut = new Deque<int>();
+        sut.Push(41);
+        sut.Push(59);
+        sut.Pop();
+        sut.Pop();
+        sut.Push(47);
+        Assert.Equal(47, sut.Pop());
+    }
 
-        deque.Unshift(40);
-        deque.Push(50);
-        Assert.Equal(40, deque.Shift());
-        Assert.Equal(50, deque.Pop());
-        Assert.Equal(30, deque.Shift());
+    [Fact(Skip = "Remove this Skip property to run this test")]
+    public void Shifting_to_empty_doesn_t_break_the_list()
+    {
+        var sut = new Deque<int>();
+        sut.Push(41);
+        sut.Push(59);
+        sut.Shift();
+        sut.Shift();
+        sut.Push(47);
+        Assert.Equal(47, sut.Shift());
     }
-}
+}