Bin Test

src/main/java/Bins.java

@@ -1,7 +1,7 @@
 import java.util.HashMap;
 
 public class Bins {
-    private HashMap<Integer, Integer> results;
+    public HashMap<Integer, Integer> results;
     int min = 0;
     int max = 0;
     // creates an array of required length
@@ -17,8 +17,4 @@ public class Bins {
             this.results.put(i, 0);
         }
     }
-
-    public HashMap getHashMap() {
-        return this.results;
-    }
 }

src/test/java/BinsTest.java

@@ -1,16 +1,13 @@
+import org.junit.Assert;
 import org.junit.Test;
 
+import java.util.Set;
+
 public class BinsTest {
 
     Dice testDice;
     Bins testBins;
 
-
-    /**
-     * test to make?
-     * get bin # { how many in that bin? }
-     *
-     */
     public BinsTest() {
 
         testDice = new Dice(2);
@@ -18,14 +15,27 @@ public class BinsTest {
 
     }
 
-
     @Test
     public void testHashMap() {
 
-        for (int key: testBins.results.keySet()) {
-
+        // Given
+        int[] expected = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
+        boolean keyMatches = false;
+        boolean expectedKey = true;
+        int i = 0;
+
+        // When
+        Set<Integer> actual = testBins.results.keySet();
+
+        for (int key: actual) {
+            if (key == expected[i]) {
+                keyMatches = true;
+                break;
+            }
+            i++;
         }
 
-
+        // Then
+        Assert.assertTrue(keyMatches);
     }
 }

src/test/java/SimulationTest.java

@@ -0,0 +1,2 @@
+public class SimulationTest {
+}