From c438ec0557b31cdc58a6c0bdbba0987a0525621e Mon Sep 17 00:00:00 2001
From: Sharad Paul <paul.sharadchandra@gmail.com>
Date: Tue, 15 Oct 2019 22:03:36 +0530
Subject: [PATCH] Intermittent test failure in Spatial Partition pattern #1001
 (#1006)

* Intermittent test failure in Spatial Partition pattern #1001

* Intermittent test failure in Spatial Partition pattern #1001
---
 .../java/com/iluwatar/spatialpartition/QuadTreeTest.java    | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/spatial-partition/src/test/java/com/iluwatar/spatialpartition/QuadTreeTest.java b/spatial-partition/src/test/java/com/iluwatar/spatialpartition/QuadTreeTest.java
index 0f9dc1e4e..15f1022fd 100644
--- a/spatial-partition/src/test/java/com/iluwatar/spatialpartition/QuadTreeTest.java
+++ b/spatial-partition/src/test/java/com/iluwatar/spatialpartition/QuadTreeTest.java
@@ -26,6 +26,8 @@ import static org.junit.jupiter.api.Assertions.*;
 import java.util.ArrayList;
 import java.util.Hashtable;
 import java.util.Random;
+
+
 import org.junit.jupiter.api.Test;
 
 /**
@@ -50,12 +52,12 @@ class QuadTreeTest {
 
   static Hashtable<Integer, Point> quadTreeTest(ArrayList<Point> points, Rect field, Rect queryRange) {
     //creating quadtree and inserting all points
-    QuadTree qTree = new QuadTree(field, 4);
+    QuadTree qTree = new QuadTree(queryRange, 4);
     for (int i = 0; i < points.size(); i++) {
       qTree.insert(points.get(i));
     }
 
-    ArrayList<Point> queryResult = qTree.query(queryRange, new ArrayList<Point>());
+    ArrayList<Point> queryResult = qTree.query(field, new ArrayList<Point>());
     Hashtable<Integer, Point> result = new Hashtable<Integer, Point>();
     for (int i = 0; i < queryResult.size(); i++) {
       Point p = queryResult.get(i);