(self)
| 679 | self.assertIsNotNone(next((e for e in retr if e.aabb.mincorner.x == 490), None), str(retr)) |
| 680 | |
| 681 | def test_ents_per_depth(self): |
| 682 | _tree = quadtree.QuadTree(3, 5, self.big_rect) |
| 683 | _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(75, 35)))) |
| 684 | self.assertDictEqual({ 0: 1 }, _tree.find_entities_per_depth()) |
| 685 | _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(300, 499)))) |
| 686 | self.assertDictEqual({ 0: 2 }, _tree.find_entities_per_depth()) |
| 687 | _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(800, 600)))) |
| 688 | self.assertDictEqual({ 0: 3 }, _tree.find_entities_per_depth()) |
| 689 | _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(450, 300)))) |
| 690 | self.assertDictEqual({ 0: 1, 1: 3 }, _tree.find_entities_per_depth()) |
| 691 | _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(150, 100)))) |
| 692 | self.assertDictEqual({ 0: 1, 1: 4 }, _tree.find_entities_per_depth()) |
| 693 | _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(80, 40)))) |
| 694 | self.assertDictEqual({ 0: 1, 1: 1, 2: 4 }, _tree.find_entities_per_depth()) |
| 695 | |
| 696 | def test_nodes_per_depth(self): |
| 697 | _tree = quadtree.QuadTree(1, 5, self.big_rect) |
nothing calls this directly
no test coverage detected