Add sieve

Author: ErikSchierboom

exercises/practice/sieve/.meta/Generator.tpl

@@ -0,0 +1,12 @@
+using Xunit;
+
+public class SieveTests
+{
+    {{#test_cases}}
+    [Fact{{#unless @first}}(Skip = "Remove this Skip property to run this test"){{/unless}}]
+    public void {{method_name path}}()
+    {
+        Assert.Equal({{expected}}, Sieve.Primes({{input.limit}}));
+    }
+    {{/test_cases}}
+}

exercises/practice/sieve/SieveTests.cs

@@ -1,42 +1,34 @@
-using System;
-using System.Linq;
 using Xunit;
 
 public class SieveTests
 {
     [Fact]
-    public void No_primes_under_two()
+    public void NoPrimesUnderTwo()
     {
-        Assert.Empty(Sieve.Primes(1).ToArray());
+        Assert.Equal([], Sieve.Primes(1));
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Find_first_prime()
+    public void FindFirstPrime()
     {
-        Assert.Equal(new[] { 2 }, Sieve.Primes(2).ToArray());
+        Assert.Equal([2], Sieve.Primes(2));
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Find_primes_up_to_10()
+    public void FindPrimesUpTo10()
     {
-        Assert.Equal(new[] { 2, 3, 5, 7 }, Sieve.Primes(10).ToArray());
+        Assert.Equal([2, 3, 5, 7], Sieve.Primes(10));
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Limit_is_prime()
+    public void LimitIsPrime()
     {
-        Assert.Equal(new[] { 2, 3, 5, 7, 11, 13 }, Sieve.Primes(13).ToArray());
+        Assert.Equal([2, 3, 5, 7, 11, 13], Sieve.Primes(13));
     }
 
     [Fact(Skip = "Remove this Skip property to run this test")]
-    public void Find_primes_up_to_1000()
+    public void FindPrimesUpTo1000()
     {
-        Assert.Equal(new[] { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997 }, Sieve.Primes(1000).ToArray());
-    }
-
-    [Fact(Skip = "Remove this Skip property to run this test")]
-    public void No_negative_numbers()
-    {
-        Assert.Throws<ArgumentOutOfRangeException>(() => Sieve.Primes(-1).ToArray());
+        Assert.Equal([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], Sieve.Primes(1000));
     }
 }