@Test public void testMerge() { rootQuad = new PointQuadTree<CollisionPoint>(4, 3, 0, 0, 128, 128); rootQuad.add(point1); Assert.assertEquals(1, rootQuad.getTotalQuads()); rootQuad.add(point2); rootQuad.add(point3); rootQuad.add(point4); rootQuad.add(new CollisionPoint(32, 32)); Assert.assertEquals(4, rootQuad.getTotalQuads()); rootQuad.remove(point4); rootQuad.remove(point3); rootQuad.remove(point2); Assert.assertEquals(1, rootQuad.getTotalQuads()); Assert.assertEquals(2, rootQuad.getTotalElements()); Assert.assertEquals(true, rootQuad.getElements().contains(point1, false)); }
protected void merge() { if (topLeft == null) { return; } elements = new Array<>(true, elementLimitPerQuad); topLeft.getElements(elements); topRight.getElements(elements); bottomLeft.getElements(elements); bottomRight.getElements(elements); for (T element : elements) { topLeft.elements.removeValue(element, false); element.removePositionChangeListener(topLeft); topRight.elements.removeValue(element, false); element.removePositionChangeListener(topRight); bottomLeft.elements.removeValue(element, false); element.removePositionChangeListener(bottomLeft); bottomRight.elements.removeValue(element, false); element.removePositionChangeListener(bottomRight); element.addPostionChangeListener(this); } topLeft = null; topRight = null; bottomLeft = null; bottomRight = null; }
PointQuadTree extends Rectangle implements QuadTree<T> { protected void merge() { if (topLeft == null) { return; } elements = new Array<>(true, elementLimitPerQuad); topLeft.getElements(elements); topRight.getElements(elements); bottomLeft.getElements(elements); bottomRight.getElements(elements); for (T element : elements) { topLeft.elements.removeValue(element, false); element.removePositionChangeListener(topLeft); topRight.elements.removeValue(element, false); element.removePositionChangeListener(topRight); bottomLeft.elements.removeValue(element, false); element.removePositionChangeListener(bottomLeft); bottomRight.elements.removeValue(element, false); element.removePositionChangeListener(bottomRight); element.addPostionChangeListener(this); } topLeft = null; topRight = null; bottomLeft = null; bottomRight = null; } }
PointQuadTree extends Rectangle implements QuadTree<T> { protected void merge() { if (topLeft == null) { return; } elements = new Array<>(true, elementLimitPerQuad); topLeft.getElements(elements); topRight.getElements(elements); bottomLeft.getElements(elements); bottomRight.getElements(elements); for (T element : elements) { topLeft.elements.removeValue(element, false); element.removePositionChangeListener(topLeft); topRight.elements.removeValue(element, false); element.removePositionChangeListener(topRight); bottomLeft.elements.removeValue(element, false); element.removePositionChangeListener(bottomLeft); bottomRight.elements.removeValue(element, false); element.removePositionChangeListener(bottomRight); element.addPostionChangeListener(this); } topLeft = null; topRight = null; bottomLeft = null; bottomRight = null; } PointQuadTree(int elementLimitPerQuad, int mergeWatermark, float x, float y, float width, float height);  PointQuadTree(int elementLimitPerQuad, float x, float y, float width, float height);  PointQuadTree(PointQuadTree<T> parent, float x, float y, float width, float height);  PointQuadTree(float minimumQuadWidth, float minimumQuadHeight, int elementLimitPerQuad, int mergeWatermark,
			float x, float y, float width, float height); }
PointQuadTree extends Rectangle implements QuadTree<T> { protected void merge() { if (topLeft == null) { return; } elements = new Array<>(true, elementLimitPerQuad); topLeft.getElements(elements); topRight.getElements(elements); bottomLeft.getElements(elements); bottomRight.getElements(elements); for (T element : elements) { topLeft.elements.removeValue(element, false); element.removePositionChangeListener(topLeft); topRight.elements.removeValue(element, false); element.removePositionChangeListener(topRight); bottomLeft.elements.removeValue(element, false); element.removePositionChangeListener(bottomLeft); bottomRight.elements.removeValue(element, false); element.removePositionChangeListener(bottomRight); element.addPostionChangeListener(this); } topLeft = null; topRight = null; bottomLeft = null; bottomRight = null; } PointQuadTree(int elementLimitPerQuad, int mergeWatermark, float x, float y, float width, float height);  PointQuadTree(int elementLimitPerQuad, float x, float y, float width, float height);  PointQuadTree(PointQuadTree<T> parent, float x, float y, float width, float height);  PointQuadTree(float minimumQuadWidth, float minimumQuadHeight, int elementLimitPerQuad, int mergeWatermark,
			float x, float y, float width, float height); void debugRender(Graphics g); void addAll(Array<T> elementsToAdd); boolean add(T element); void removeAll(Array<T> elementsToRemove); boolean remove(T element); void clear(); @Override Array<T> getElementsWithinArea(Shape area); @Override Array<T> getElementsWithinArea(Shape area, QuadTreeSearchDirection searchDirection); @Override void getElementsWithinArea(Array<T> result, Shape area); @Override void getElementsWithinArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection); @Override Array<T> getElementsContainingArea(Shape area, boolean entirelyContained); @Override Array<T> getElementsContainingArea(Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override Array<T> getElementsContainingPoint(Point point); @Override Array<T> getElementsContainingPoint(Point point, QuadTreeSearchDirection searchDirection); @Override void getElementsContainingPoint(Array<T> result, Point point); @Override void getElementsContainingPoint(Array<T> result, Point point, QuadTreeSearchDirection searchDirection); Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment); @Override Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment, QuadTreeSearchDirection searchDirection); void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment); @Override void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment, QuadTreeSearchDirection searchDirection); Array<T> getElements(); void getElements(Array<T> result); int getTotalQuads(); int getTotalElements(); @Override void positionChanged(T moved); QuadTree<T> getParent(); int getElementLimitPerQuad(); int getMergeWatermark(); boolean hasChildQuads(); @Override float getMinimumQuadWidth(); @Override float getMinimumQuadHeight(); }
PointQuadTree extends Rectangle implements QuadTree<T> { protected void merge() { if (topLeft == null) { return; } elements = new Array<>(true, elementLimitPerQuad); topLeft.getElements(elements); topRight.getElements(elements); bottomLeft.getElements(elements); bottomRight.getElements(elements); for (T element : elements) { topLeft.elements.removeValue(element, false); element.removePositionChangeListener(topLeft); topRight.elements.removeValue(element, false); element.removePositionChangeListener(topRight); bottomLeft.elements.removeValue(element, false); element.removePositionChangeListener(bottomLeft); bottomRight.elements.removeValue(element, false); element.removePositionChangeListener(bottomRight); element.addPostionChangeListener(this); } topLeft = null; topRight = null; bottomLeft = null; bottomRight = null; } PointQuadTree(int elementLimitPerQuad, int mergeWatermark, float x, float y, float width, float height);  PointQuadTree(int elementLimitPerQuad, float x, float y, float width, float height);  PointQuadTree(PointQuadTree<T> parent, float x, float y, float width, float height);  PointQuadTree(float minimumQuadWidth, float minimumQuadHeight, int elementLimitPerQuad, int mergeWatermark,
			float x, float y, float width, float height); void debugRender(Graphics g); void addAll(Array<T> elementsToAdd); boolean add(T element); void removeAll(Array<T> elementsToRemove); boolean remove(T element); void clear(); @Override Array<T> getElementsWithinArea(Shape area); @Override Array<T> getElementsWithinArea(Shape area, QuadTreeSearchDirection searchDirection); @Override void getElementsWithinArea(Array<T> result, Shape area); @Override void getElementsWithinArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection); @Override Array<T> getElementsContainingArea(Shape area, boolean entirelyContained); @Override Array<T> getElementsContainingArea(Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override Array<T> getElementsContainingPoint(Point point); @Override Array<T> getElementsContainingPoint(Point point, QuadTreeSearchDirection searchDirection); @Override void getElementsContainingPoint(Array<T> result, Point point); @Override void getElementsContainingPoint(Array<T> result, Point point, QuadTreeSearchDirection searchDirection); Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment); @Override Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment, QuadTreeSearchDirection searchDirection); void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment); @Override void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment, QuadTreeSearchDirection searchDirection); Array<T> getElements(); void getElements(Array<T> result); int getTotalQuads(); int getTotalElements(); @Override void positionChanged(T moved); QuadTree<T> getParent(); int getElementLimitPerQuad(); int getMergeWatermark(); boolean hasChildQuads(); @Override float getMinimumQuadWidth(); @Override float getMinimumQuadHeight(); static final float DEFAULT_MINIMUM_QUAD_SIZE; static Color QUAD_COLOR; static Color ELEMENT_COLOR; }