@Test public void testSearch() { System.gc(); for (int i = 0; i < 10000; i++) { mTree.add(new Item(i / 20000.0, i / 20000.0)); } Assert.assertEquals(10000, searchAll().size()); Assert.assertEquals( 1, mTree.search(new Bounds((double) 0, 0.00001, (double) 0, 0.00001)).size()); Assert.assertEquals(0, mTree.search(new Bounds(.7, .8, .7, .8)).size()); mTree.clear(); System.gc(); }
public Collection<T> search(Bounds searchBounds) { final List<T> results = new ArrayList<T>(); search(searchBounds, results); return results; }
PointQuadTree { public Collection<T> search(Bounds searchBounds) { final List<T> results = new ArrayList<T>(); search(searchBounds, results); return results; } }
PointQuadTree { public Collection<T> search(Bounds searchBounds) { final List<T> results = new ArrayList<T>(); search(searchBounds, results); return results; } PointQuadTree(double minX, double maxX, double minY, double maxY);  PointQuadTree(Bounds bounds); private  PointQuadTree(double minX, double maxX, double minY, double maxY, int depth); private  PointQuadTree(Bounds bounds, int depth); }
PointQuadTree { public Collection<T> search(Bounds searchBounds) { final List<T> results = new ArrayList<T>(); search(searchBounds, results); return results; } PointQuadTree(double minX, double maxX, double minY, double maxY);  PointQuadTree(Bounds bounds); private  PointQuadTree(double minX, double maxX, double minY, double maxY, int depth); private  PointQuadTree(Bounds bounds, int depth); void add(T item); boolean remove(T item); void clear(); Collection<T> search(Bounds searchBounds); }
PointQuadTree { public Collection<T> search(Bounds searchBounds) { final List<T> results = new ArrayList<T>(); search(searchBounds, results); return results; } PointQuadTree(double minX, double maxX, double minY, double maxY);  PointQuadTree(Bounds bounds); private  PointQuadTree(double minX, double maxX, double minY, double maxY, int depth); private  PointQuadTree(Bounds bounds, int depth); void add(T item); boolean remove(T item); void clear(); Collection<T> search(Bounds searchBounds);  }