tiennm99/java-design-patterns
1
0
Fork 0
mirror of https://github.com/tiennm99/java-design-patterns.git synced 2026-05-16 08:58:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Resolves checkstyle errors for facade factory-kit spatial-partition state step-builder (#1077)

Browse Source 
* Reduces checkstyle errors in facade

* Reduces checkstyle errors in factory-kit

* Reduces checkstyle errors in spatial-partition

* Reduces checkstyle errors in state

* Reduces checkstyle errors in step-builder
This commit is contained in:
Anurag Agarwal
2019-11-12 01:51:12 +05:30
committed by Ilkka Seppälä
parent 2628cc0dfc
commit c954a436ad
29 changed files with 195 additions and 197 deletions
Download Patch File Download Diff File Expand all files Collapse all files
spatial-partition/src/main/java/com/iluwatar/spatialpartition/QuadTree.java
+19 -19
View File
@@ -28,9 +28,9 @@ import java.util.Enumeration;
import java.util.Hashtable;
/**
* The quadtree data structure is being used to keep track of the objects' locations.
* It has the insert(Point) and query(range) methods to insert a new object and find
* the objects within a certain (rectangular) range respectively.
* The quadtree data structure is being used to keep track of the objects' locations. It has the
* insert(Point) and query(range) methods to insert a new object and find the objects within a
* certain (rectangular) range respectively.
*/
public class QuadTree {
@@ -48,9 +48,9 @@ public class QuadTree {
this.capacity = capacity;
this.divided = false;
this.points = new Hashtable<Integer, Point>();
this.northwest = null;
this.northeast = null;
this.southwest = null;
this.northwest = null;
this.northeast = null;
this.southwest = null;
this.southeast = null;
}
@@ -76,25 +76,25 @@ public class QuadTree {
}
void divide() {
Rect nw = new Rect(this.boundary.x - this.boundary.width / 4, this.boundary.y + this.boundary.height / 4,
this.boundary.width / 2, this.boundary.height / 2);
this.northwest = new QuadTree(nw , this.capacity);
Rect ne = new Rect(this.boundary.x + this.boundary.width / 4, this.boundary.y + this.boundary.height / 4,
this.boundary.width / 2, this.boundary.height / 2);
this.northeast = new QuadTree(ne , this.capacity);
Rect sw = new Rect(this.boundary.x - this.boundary.width / 4, this.boundary.y - this.boundary.height / 4,
this.boundary.width / 2, this.boundary.height / 2);
this.southwest = new QuadTree(sw , this.capacity);
Rect se = new Rect(this.boundary.x + this.boundary.width / 4, this.boundary.y - this.boundary.height / 4,
this.boundary.width / 2, this.boundary.height / 2);
this.southeast = new QuadTree(se , this.capacity);
double x = this.boundary.coordinateX;
double y = this.boundary.coordinateY;
double width = this.boundary.width;
double height = this.boundary.height;
Rect nw = new Rect(x - width / 4, y + height / 4, width / 2, height / 2);
this.northwest = new QuadTree(nw, this.capacity);
Rect ne = new Rect(x + width / 4, y + height / 4, width / 2, height / 2);
this.northeast = new QuadTree(ne, this.capacity);
Rect sw = new Rect(x - width / 4, y - height / 4, width / 2, height / 2);
this.southwest = new QuadTree(sw, this.capacity);
Rect se = new Rect(x + width / 4, y - height / 4, width / 2, height / 2);
this.southeast = new QuadTree(se, this.capacity);
this.divided = true;
}
ArrayList<Point> query(Rect r, ArrayList<Point> relevantPoints) {
//could also be a circle instead of a rectangle
if (this.boundary.intersects(r)) {
for (Enumeration<Integer> e = this.points.keys(); e.hasMoreElements();) {
for (Enumeration<Integer> e = this.points.keys(); e.hasMoreElements(); ) {
Integer i = e.nextElement();
if (r.contains(this.points.get(i))) {
relevantPoints.add(this.points.get(i));