|
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+import org.junit.Test;
|
|
|
2
|
+
|
|
|
3
|
+import java.util.Arrays;
|
|
|
4
|
+import java.util.List;
|
|
|
5
|
+
|
|
|
6
|
+import static org.junit.Assert.assertEquals;
|
|
|
7
|
+
|
|
|
8
|
+public class SieveTest {
|
|
|
9
|
+
|
|
|
10
|
+ @Test
|
|
|
11
|
+ public void findFirstPrime() {
|
|
|
12
|
+ Sieve sieve = new Sieve(2);
|
|
|
13
|
+ List<Integer> expectedOutput = Arrays.asList(new Integer[]{2});
|
|
|
14
|
+
|
|
|
15
|
+ assertEquals(expectedOutput, sieve.getPrimes());
|
|
|
16
|
+ }
|
|
|
17
|
+
|
|
|
18
|
+ @Test
|
|
|
19
|
+ public void findPrimesUpTo10() {
|
|
|
20
|
+ Sieve sieve = new Sieve(10);
|
|
|
21
|
+ List<Integer> expectedOutput = Arrays.asList(2, 3, 5, 7);
|
|
|
22
|
+
|
|
|
23
|
+ assertEquals(expectedOutput, sieve.getPrimes());
|
|
|
24
|
+ }
|
|
|
25
|
+
|
|
|
26
|
+ @Test
|
|
|
27
|
+ public void findPrimesUpTo1000() {
|
|
|
28
|
+ Sieve sieve = new Sieve(1000);
|
|
|
29
|
+ List<Integer> expectedOutput = Arrays.asList(2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61,
|
|
|
30
|
+ 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
|
|
|
31
|
+ 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283,
|
|
|
32
|
+ 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421,
|
|
|
33
|
+ 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563,
|
|
|
34
|
+ 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683,
|
|
|
35
|
+ 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829,
|
|
|
36
|
+ 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983,
|
|
|
37
|
+ 991, 997);
|
|
|
38
|
+
|
|
|
39
|
+ assertEquals(expectedOutput, sieve.getPrimes());
|
|
|
40
|
+ }
|
|
|
41
|
+}
|