Refactor neighbor computation using directional vectors

1 files changed, 18 insertions, 8 deletions

diff --git a/test/ch/epfl/xblast/DirectionTest.java b/test/ch/epfl/xblast/DirectionTest.java
index a2ac9cd..0ebb3b7 100644
--- a/test/ch/epfl/xblast/DirectionTest.java
+++ b/test/ch/epfl/xblast/DirectionTest.java
@@ -1,21 +1,23 @@
 package ch.epfl.xblast;
 
-import static org.junit.Assert.assertEquals;
-import static org.junit.Assert.assertFalse;
-import static org.junit.Assert.assertTrue;
-
 import org.junit.Test;
 
+import static org.junit.Assert.*;
+
+/**
+ * @author EPFL
+ * @author Pacien TRAN-GIRARD (261948)
+ */
 public class DirectionTest {
     @Test
     public void oppositeOfOppositeIsIdentity() {
-        for (Direction d: Direction.values())
+        for (Direction d : Direction.values())
             assertEquals(d, d.opposite().opposite());
     }
 
     @Test
     public void oppositeIsTwoStepsAway() {
-        for (Direction d: Direction.values())
+        for (Direction d : Direction.values())
             assertEquals(2, Math.abs(d.ordinal() - d.opposite().ordinal()));
     }
 
@@ -29,8 +31,8 @@ public class DirectionTest {
 
     @Test
     public void isParallelIsTrueOnlyForOppositeAndSelf() {
-        for (Direction d1: Direction.values()) {
-            for (Direction d2: Direction.values()) {
+        for (Direction d1 : Direction.values()) {
+            for (Direction d2 : Direction.values()) {
                 if (d1 == d2 || d1 == d2.opposite())
                     assertTrue(d1.isParallelTo(d2));
                 else
@@ -38,4 +40,12 @@ public class DirectionTest {
             }
         }
     }
+
+    @Test
+    public void oppositeVectorSumIsNil() {
+        for (Direction d : Direction.values()) {
+            assertEquals(0, d.xVector() + d.opposite().xVector());
+            assertEquals(0, d.yVector() + d.opposite().yVector());
+        }
+    }
 }