MCPcopy Index your code
hub / github.com/OmkarPathak/pygorithm / test_nodes_per_depth

Method test_nodes_per_depth

tests/test_data_structure.py:696–705  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

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)
698 _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(50, 50))))
699 self.assertDictEqual({ 0: 1 }, _tree.find_nodes_per_depth())
700 _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(450, 450))))
701 self.assertDictEqual({ 0: 1, 1: 4, 2: 4 }, _tree.find_nodes_per_depth())
702 _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(550, 550))))
703 self.assertDictEqual({ 0: 1, 1: 4, 2: 4 }, _tree.find_nodes_per_depth())
704 _tree.insert_and_think(quadtree.QuadTreeEntity(rect2.Rect2(5, 5, vector2.Vector2(850, 550))))
705 self.assertDictEqual({ 0: 1, 1: 4, 2: 8 }, _tree.find_nodes_per_depth())
706
707 def test_sum_ents(self):
708 # it shouldn't matter where we put entities in, adding entities

Callers

nothing calls this directly

Calls 2

insert_and_thinkMethod · 0.95
find_nodes_per_depthMethod · 0.95

Tested by

no test coverage detected