[BAEL-3485] - Java Range lookup problem

2019-12-17 07:46:24 +05:30
parent b67a82d87c
commit c02e762a2b
4 changed files with 278 additions and 0 deletions
--- a/algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java
+++ b/algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java
@@ -0,0 +1,60 @@
+package com.baeldung.algorithms.quadtree;
+
+import org.junit.Assert;
+
+import java.util.List;
+
+import org.junit.BeforeClass;
+import org.junit.Test;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+public class QuadTreeSearchTest {
+    
+    private static final Logger LOGGER = LoggerFactory.getLogger(QuadTreeSearchTest.class);
+
+    private static QuadTree quadTree;
+
+    @BeforeClass
+    public static void setUp() {
+        Region area = new Region(0, 0, 400, 400);
+        quadTree = new QuadTree(area);
+
+        float[][] points = new float[][] { { 21, 25 }, { 55, 53 }, { 70, 318 }, { 98, 302 }, 
+            { 49, 229 }, { 135, 229 }, { 224, 292 }, { 206, 321 }, { 197, 258 }, { 245, 238 } };
+
+        for (int i = 0; i < points.length; i++) {
+            Point point = new Point(points[i][0], points[i][1]);
+            quadTree.addPoint(point);
+        }
+        LOGGER.debug("\n" + quadTree.printTree(""));
+        LOGGER.debug("==============================================");
+    }
+
+    @Test
+    public void givenQuadTree_whenSearchingForRange_thenReturn1MatchingItem() {
+        Region searchArea = new Region(200, 200, 250, 250);
+        List<Point> result = quadTree.search(searchArea, null, "");
+        LOGGER.debug(result.toString());
+        LOGGER.debug(quadTree.printSearchTraversePath());
+       
+        Assert.assertEquals(1, result.size());
+        Assert.assertArrayEquals(new float[] { 245, 238 }, 
+            new float[]{result.get(0).getX(), result.get(0).getY() }, 0);
+    }
+    
+    @Test
+    public void givenQuadTree_whenSearchingForRange_thenReturn2MatchingItems() {
+        Region searchArea = new Region(0, 0, 100, 100);
+        List<Point> result = quadTree.search(searchArea, null, "");
+        LOGGER.debug(result.toString());
+        LOGGER.debug(quadTree.printSearchTraversePath());
+        
+        Assert.assertEquals(2, result.size());
+        Assert.assertArrayEquals(new float[] { 21, 25 }, 
+            new float[]{result.get(0).getX(), result.get(0).getY() }, 0);
+        Assert.assertArrayEquals(new float[] { 55, 53 }, 
+            new float[]{result.get(1).getX(), result.get(1).getY() }, 0);
+        
+    }
+}