iSharkFly-Docs
/
java-tutorials
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[BAEL-3485] - Java Range lookup problem

This commit is contained in:
macroscopic64 2019-12-17 08:47:46 +05:30
parent bc463d59b4
commit 1c09c24810
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java
View File

@ -27,16 +27,16 @@ public class QuadTreeSearchTest {
Point point = new Point(points[i][0], points[i][1]);
quadTree.addPoint(point);
}
LOGGER.debug("\n" + quadTree.printTree(""));
LOGGER.debug("==============================================");
LOGGER.info("\n" + quadTree.printTree(""));
LOGGER.info("==============================================");
}
@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());
LOGGER.info(result.toString());
LOGGER.info(quadTree.printSearchTraversePath());
Assert.assertEquals(1, result.size());
Assert.assertArrayEquals(new float[] { 245, 238 },
@ -47,8 +47,8 @@ public class QuadTreeSearchTest {
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());
LOGGER.info(result.toString());
LOGGER.info(quadTree.printSearchTraversePath());
Assert.assertEquals(2, result.size());
Assert.assertArrayEquals(new float[] { 21, 25 },