* Intermittent test failure in Spatial Partition pattern #1001 * Intermittent test failure in Spatial Partition pattern #1001
This commit is contained in:
parent
dd5997b495
commit
c438ec0557
@ -26,6 +26,8 @@ import static org.junit.jupiter.api.Assertions.*;
|
|||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.Hashtable;
|
import java.util.Hashtable;
|
||||||
import java.util.Random;
|
import java.util.Random;
|
||||||
|
|
||||||
|
|
||||||
import org.junit.jupiter.api.Test;
|
import org.junit.jupiter.api.Test;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@ -50,12 +52,12 @@ class QuadTreeTest {
|
|||||||
|
|
||||||
static Hashtable<Integer, Point> quadTreeTest(ArrayList<Point> points, Rect field, Rect queryRange) {
|
static Hashtable<Integer, Point> quadTreeTest(ArrayList<Point> points, Rect field, Rect queryRange) {
|
||||||
//creating quadtree and inserting all points
|
//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++) {
|
for (int i = 0; i < points.size(); i++) {
|
||||||
qTree.insert(points.get(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>();
|
Hashtable<Integer, Point> result = new Hashtable<Integer, Point>();
|
||||||
for (int i = 0; i < queryResult.size(); i++) {
|
for (int i = 0; i < queryResult.size(); i++) {
|
||||||
Point p = queryResult.get(i);
|
Point p = queryResult.get(i);
|
||||||
|
Loading…
x
Reference in New Issue
Block a user