def test_node_search_leaf(): node = Node(t=2) node.keys = [3, 9, 15] eq_(node.search(-10), None) eq_(node.search(3), (3, 0)) eq_(node.search(15), (15, 2)) eq_(node.search(17), None)
def test_node_search_leaf(): node = Node(t=2) node.keys = [3, 9, 15] eq_(node.search(-10), None) eq_(node.search(3), (3, 0)) eq_(node.search(15), (15, 2)) eq_(node.search(17), None)
def test_find_proper_child_index(): node = Node(t=2) node.keys = [3, 9, 15] eq_(node.find_proper_child_index(-10), 0) eq_(node.find_proper_child_index(3), 0) eq_(node.find_proper_child_index(5), 1) eq_(node.find_proper_child_index(9), 1) eq_(node.find_proper_child_index(15), 2) eq_(node.find_proper_child_index(16), 3)
def test_find_proper_child_index(): node = Node(t=2) node.keys = [3, 9, 15] eq_(node.find_proper_child_index(-10), 0) eq_(node.find_proper_child_index(3), 0) eq_(node.find_proper_child_index(5), 1) eq_(node.find_proper_child_index(9), 1) eq_(node.find_proper_child_index(15), 2) eq_(node.find_proper_child_index(16), 3)