From 0d9a2e739b898e4d3585672979c6e759fb6e96b1 Mon Sep 17 00:00:00 2001 From: macroscopic64 Date: Tue, 17 Dec 2019 08:47:46 +0530 Subject: [PATCH] [BAEL-3485] - Java Range lookup problem --- .../algorithms/quadtree/QuadTreeSearchTest.java | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java b/algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java index 4c810a4724..e7240e76b5 100644 --- a/algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java +++ b/algorithms-searching/src/test/java/com/baeldung/algorithms/quadtree/QuadTreeSearchTest.java @@ -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 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 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 },