@Test public void testRemove() { Random random = new Random(); Array<CollisionPoint> collisionPoints = new Array<CollisionPoint>(); for(int i = 0; i < 1000; i++) { collisionPoints.add(new CollisionPoint(random.nextInt(128), random.nextInt(128))); } for(int i = 0; i < collisionPoints.size; i++) { Assert.assertEquals(true, rootQuad.add(collisionPoints.get(i))); Assert.assertEquals(i + 1, rootQuad.getElements().size); } for(int i = collisionPoints.size - 1; i >= 0 ; i--) { Assert.assertEquals(i + 1, rootQuad.getElements().size); rootQuad.remove(collisionPoints.get(i)); Assert.assertEquals(i, rootQuad.getElements().size); } }
public boolean remove(T element) { if (element == null) return false; if (!this.contains(element.getX(), element.getY())) { return false; } clearTotalElementsCache(); if (topLeft != null) { return removeElementFromChild(element); } return removeElement(element); }
PointQuadTree extends Rectangle implements QuadTree<T> { public boolean remove(T element) { if (element == null) return false; if (!this.contains(element.getX(), element.getY())) { return false; } clearTotalElementsCache(); if (topLeft != null) { return removeElementFromChild(element); } return removeElement(element); } }
PointQuadTree extends Rectangle implements QuadTree<T> { public boolean remove(T element) { if (element == null) return false; if (!this.contains(element.getX(), element.getY())) { return false; } clearTotalElementsCache(); if (topLeft != null) { return removeElementFromChild(element); } return removeElement(element); } 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> { public boolean remove(T element) { if (element == null) return false; if (!this.contains(element.getX(), element.getY())) { return false; } clearTotalElementsCache(); if (topLeft != null) { return removeElementFromChild(element); } return removeElement(element); } 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> { public boolean remove(T element) { if (element == null) return false; if (!this.contains(element.getX(), element.getY())) { return false; } clearTotalElementsCache(); if (topLeft != null) { return removeElementFromChild(element); } return removeElement(element); } 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; }