def test_full(self): """Rotate a fully-populated tree. The transformation is as such:: r r │ │ y x ┌┴┐ → ┌┴┐ x c a y ┌┴┐ ┌┴┐ a b b c """ tree = IntervalTree() node_r = Node(Interval(1, 1)) node_a = Node(Interval(2, 2)) node_x = Node(Interval(3, 3)) node_b = Node(Interval(4, 4)) node_y = Node(Interval(5, 5)) node_c = Node(Interval(6, 6)) tree.insert(node_r) tree.insert(node_y) # force tree to take desired shape node_y.left = node_x node_y.right = node_c node_x.parent = node_y node_x.left = node_a node_x.right = node_b node_c.parent = node_y node_a.parent = node_x node_b.parent = node_x tree._rotate_right(node_y) # pylint:disable=protected-access with self.subTest(comment='verify node_r'): self.assertIsNone(node_r.parent) self.assertIsNone(node_r.left) self.assertEqual(node_r.right, node_x) with self.subTest(comment='verify node_y'): self.assertEqual(node_y.parent, node_x) self.assertEqual(node_y.left, node_b) self.assertEqual(node_y.right, node_c) with self.subTest(comment='verify node_x'): self.assertEqual(node_x.parent, node_r) self.assertEqual(node_x.left, node_a) self.assertEqual(node_x.right, node_y) with self.subTest(comment='verify node_a'): self.assertEqual(node_a.parent, node_x) self.assertIsNone(node_a.left) self.assertIsNone(node_a.right) with self.subTest(comment='verify node_b'): self.assertEqual(node_b.parent, node_y) self.assertIsNone(node_b.left) self.assertIsNone(node_b.right) with self.subTest(comment='verify node_c'): self.assertEqual(node_c.parent, node_y) self.assertIsNone(node_c.left) self.assertIsNone(node_c.right)
def test_full(self): """Rotate a fully-populated tree. The transformation is as such:: r r │ │ y x ┌┴┐ → ┌┴┐ x c a y ┌┴┐ ┌┴┐ a b b c """ tree = IntervalTree() node_r = Node(Interval(1, 1)) node_a = Node(Interval(2, 2)) node_x = Node(Interval(3, 3)) node_b = Node(Interval(4, 4)) node_y = Node(Interval(5, 5)) node_c = Node(Interval(6, 6)) tree.insert(node_r) tree.insert(node_y) # force tree to take desired shape node_y.left = node_x node_y.right = node_c node_x.parent = node_y node_x.left = node_a node_x.right = node_b node_c.parent = node_y node_a.parent = node_x node_b.parent = node_x tree._rotate_right(node_y) # pylint:disable=protected-access with self.subTest(comment='verify node_r'): self.assertIsNone(node_r.parent) self.assertIsNone(node_r.left) self.assertEqual(node_r.right, node_x) with self.subTest(comment='verify node_y'): self.assertEqual(node_y.parent, node_x) self.assertEqual(node_y.left, node_b) self.assertEqual(node_y.right, node_c) with self.subTest(comment='verify node_x'): self.assertEqual(node_x.parent, node_r) self.assertEqual(node_x.left, node_a) self.assertEqual(node_x.right, node_y) with self.subTest(comment='verify node_a'): self.assertEqual(node_a.parent, node_x) self.assertIsNone(node_a.left) self.assertIsNone(node_a.right) with self.subTest(comment='verify node_b'): self.assertEqual(node_b.parent, node_y) self.assertIsNone(node_b.left) self.assertIsNone(node_b.right) with self.subTest(comment='verify node_c'): self.assertEqual(node_c.parent, node_y) self.assertIsNone(node_c.left) self.assertIsNone(node_c.right)
def test_three_nodes(self): """Search through a tree with three nodes. The nodes are organized as such:: a ┌─┘ b └┐ c """ tree = IntervalTree() node_a = Node(Interval(3, 3)) node_b = Node(Interval(1, 1)) node_c = Node(Interval(2, 2)) tree.insert(node_a) tree.insert(node_b) node_b.right = node_c # force tree to take desired shape node_c.parent = node_b with self.subTest(comment='pass nothing'): self.assertEqual(tree.min(), node_b) with self.subTest(comment='pass node_a'): self.assertEqual(tree.min(node_a), node_b) with self.subTest(comment='pass node_b'): self.assertEqual(tree.min(node_b), node_b) with self.subTest(comment='pass node_c'): self.assertEqual(tree.min(node_c), node_c)
def test_three_nodes(self): """Search through a tree with three nodes. The nodes are organized as such:: a ┌─┘ b └┐ c """ tree = IntervalTree() node_a = Node(Interval(3, 3)) node_b = Node(Interval(1, 1)) node_c = Node(Interval(2, 2)) tree.insert(node_a) tree.insert(node_b) node_b.right = node_c # force tree to take desired shape node_c.parent = node_b with self.subTest(comment='pass nothing'): self.assertEqual(tree.min(), node_b) with self.subTest(comment='pass node_a'): self.assertEqual(tree.min(node_a), node_b) with self.subTest(comment='pass node_b'): self.assertEqual(tree.min(node_b), node_b) with self.subTest(comment='pass node_c'): self.assertEqual(tree.min(node_c), node_c)