collapse assignment1 dir

1 files changed, 58 insertions, 0 deletions

diff --git a/src/test/java/ca/mokhan/assignment1/NumberTest.java b/src/test/java/ca/mokhan/assignment1/NumberTest.java
new file mode 100644
index 0000000..1ef9d96
--- /dev/null
+++ b/src/test/java/ca/mokhan/assignment1/NumberTest.java
@@ -0,0 +1,58 @@
+package ca.mokhan.assignment1;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+import junit.framework.Test;
+import junit.framework.TestCase;
+import junit.framework.TestSuite;
+
+public class NumberTest extends TestCase {
+  public NumberTest(String testName) {
+    super(testName);
+  }
+
+  public static Test suite() {
+    return new TestSuite(NumberTest.class);
+  }
+
+  public void testIsDivisibleBy5() {
+    for (int i = 0; i < 113; i++)
+      if (i % 5 == 0) assertTrue(Number.isDivisibleBy5(i));
+      else assertFalse(Number.isDivisibleBy5(i));
+  }
+
+  public void testIsDivisibleBy7() {
+    for (int i = 0; i < 113; i++)
+      if (i % 7 == 0) assertTrue(Number.isDivisibleBy7(i));
+      else assertFalse(Number.isDivisibleBy7(i));
+  }
+
+  public void testIsOdd() {
+    for (int i = 0; i < 113; i++)
+      if (i % 2 == 0) assertFalse(Number.isOdd(i));
+      else assertTrue(Number.isOdd(i));
+  }
+
+  public void testIsPrime() {
+    List<Integer> primes =
+        Arrays.asList(
+            new Integer[] {
+              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
+            });
+
+    for (Integer i = 0; i < 113; i++)
+      if (primes.contains(i)) assertTrue(Number.isPrime(i));
+      else assertFalse(Number.isPrime(i));
+  }
+
+  public void testIterate() {
+    ArrayList<String> results = Number.iterate();
+    assertTrue(results.contains("0,hi five"));
+    assertTrue(results.contains("1,1 is odd"));
+    assertTrue(results.contains("2,prime"));
+    assertTrue(results.contains("3,3 is odd,wow,prime"));
+    assertTrue(results.contains("4"));
+  }
+}