def setup_class(self):
self.qt = Node(0, 0, 1000, 1000)
# fill with 10x10 squares
[
self.qt.insert(Rectangle(x, y, x + 10, y + 10))
for x in range(0, 1000, 10) for y in range(0, 1000, 10)
]
assert len(self.qt.get_children()) == 10000
def test_clear(self):
qt = Node(0, 0, 1000, 1000)
[qt.insert(random_rectangle(qt.bounds)) for _ in range(300)]
assert len(qt.get_children()) == 300
assert qt._get_depth() in [3, 4] # can't know for sure
qt.clear()
assert qt.get_children() == []
assert qt.direct_children == []
def setup_class(self):
self.qt = Node(0, 0, 90, 90)
# put a 9x9 tile on every 3 horizontal and vertical units
[
self.qt.insert(Rectangle(x, y, x + 9, y + 9))
for x in range(0, 80, 3) for y in range(0, 80, 3)
]
assert len(self.qt.get_children()) == 27 * 27
def test_item_crossing_border(self, max_depth, coords):
# adding item that cross borders shouldn't trigger nested subdivisions
qt = Node(0, 0, 1024, 1024, max_depth)
assert qt._get_depth() == 0
assert qt._get_number_of_nodes() == 1
rect = Rectangle(*coords)
qt.insert(rect)
assert qt.get_children() == [rect]
assert qt._get_depth() == 1
assert qt._get_number_of_nodes() == 5
def test_insert_and_reinsert(self, quadtree_bounds, max_depth):
params = quadtree_bounds + (max_depth, )
qt = Node(*params)
rect = random_rectangle(quadtree_bounds)
print 'Testing with {0}, {1}'.format(qt, rect) # shown if test fails
assert qt.direct_children == []
assert qt.get_children() == []
qt.insert(rect)
assert qt.get_children() == [rect]
qt.reinsert(rect)
assert qt.get_children() == [rect]
def test_insert_small_rect_in_corner(self, max_depth, coords):
# inserting small rectangle in top left corner should make the
# quadtree perform maximum number of subdivisions
qt = Node(0, 0, 1024, 1024, max_depth)
assert qt._get_depth() == 0
assert qt._get_number_of_nodes() == 1
rect = Rectangle(*coords)
qt.insert(rect)
assert qt._get_depth() == max_depth
assert qt._get_number_of_nodes() == 1 + max_depth * 4
qt.remove(rect)
assert qt._get_depth() == 0
assert qt._get_number_of_nodes() == 1
def test(self, n_elems, quadtree_bounds, max_depth, change_bounds):
rects = [random_rectangle(quadtree_bounds) for _ in range(n_elems)]
params = quadtree_bounds + (max_depth, )
qt = Node(*params)
[qt.insert(r) for r in rects]
key = lambda r: r.bounds
assert sorted(qt.get_children(), key=key) == sorted(rects, key=key)
assert len(qt.get_children()) == n_elems
shuffle(rects)
for r in rects:
if change_bounds:
new_bounds = random_rectangle(quadtree_bounds).bounds
r.bounds = new_bounds
qt.reinsert(r)
assert sorted(qt.get_children(), key=key) == sorted(rects, key=key)
def test_reinsert_into_same_quadrant(self, max_depth):
bounds = (0.001, 0.001, 0.002, 0.002)
qt = Node(0, 0, 1024, 1024, max_depth)
assert qt._get_depth() == 0
assert qt._get_number_of_nodes() == 1
rect = Rectangle(*bounds)
qt.insert(rect)
assert qt._get_depth() == max_depth
assert qt._get_number_of_nodes() == 1 + max_depth * 4
# make sure that top-left quadrant is the only one subdivided
depths = [qt.quadrants[i]._get_depth() for i in range(4)]
assert depths == [max_depth - 1, 0, 0, 0]
# change coords and reinsert into same place
qt.reinsert(rect)
assert qt._get_depth() == max_depth
assert qt._get_number_of_nodes() == 1 + max_depth * 4
depths = [qt.quadrants[i]._get_depth() for i in range(4)]
assert depths == [max_depth - 1, 0, 0, 0]
def test_insert_two_at_different_locations(self):
qt = Node(0, 0, 1000, 1000)
rect1 = Rectangle(10, 10, 20, 20)
rect2 = Rectangle(800, 800, 900, 900)
qt.insert(rect1)
qt.insert(rect2)
assert qt.get_children() == [rect1, rect2]
qt.remove(rect1)
assert qt.get_children() == [rect2]
qt.insert(rect1)
assert qt.get_children() == [rect1, rect2]
qt.remove(rect2)
assert qt.get_children() == [rect1]
qt.remove(rect1)
assert qt.get_children() == []
assert qt.direct_children == []
def test(self, n_elems, quadtree_bounds, max_depth, removal_order):
rects = [random_rectangle(quadtree_bounds) for _ in range(n_elems)]
params = quadtree_bounds + (max_depth, )
qt = Node(*params)
[qt.insert(r) for r in rects]
key = lambda r: r.bounds
assert sorted(qt.get_children(), key=key) == sorted(rects, key=key)
assert len(qt.get_children()) == n_elems
pop_element = [
lambda: rects.pop(0),
lambda: rects.pop(),
lambda: rects.pop(randint(0,
len(rects) - 1)),
][removal_order]
while rects:
rect = pop_element()
qt.remove(rect)
assert sorted(qt.get_children(), key=key) == sorted(rects, key=key)
assert qt.get_children() == []
def test_reinsert_into_another_quadrant(self, max_depth):
bounds_1 = (0.01, 0.01, 0.02, 0.02)
bounds_2 = (1023.998, 1023.998, 1023.999, 1023.999)
qt = Node(0, 0, 1024, 1024, max_depth)
assert qt._get_depth() == 0
assert qt._get_number_of_nodes() == 1
rect = Rectangle(*bounds_1)
qt.insert(rect)
assert qt._get_depth() == max_depth
assert qt._get_number_of_nodes() == 1 + max_depth * 4
# make sure that top-left quadrant is the only one subdivided
depths = [qt.quadrants[i]._get_depth() for i in range(4)]
assert depths == [max_depth - 1, 0, 0, 0]
# change coords and reinsert
rect.bounds = bounds_2
qt.reinsert(rect)
assert qt._get_depth() == max_depth
assert qt._get_number_of_nodes() == 1 + max_depth * 4
# make sure that bottom-right quadrant is the only one subdivided
depths = [qt.quadrants[i]._get_depth() for i in range(4)]
assert depths == [0, 0, 0, max_depth - 1]
def setup_class(self):
self.qt = Node(0, 0, 1000, 1000)
self.rect = Rectangle(20, 20, 40, 40)
