def test_move_sub_tree_prepend(self): insert(self.subtree, parent=find('A')) Menu.relocate(find('A'), relative_to=find('D'), mode=APPEND) expected = [[x,] for x in 'B,C,D,A,E,F'.split(',')] for i in range(len(expected)): if expected[i][0] == 'A': expected[i].append([[x,] for x in 'a,b,c,d,e,f'.split(',')]) break self.assertEqualTree(expected)
def test_move_one_up_last_append(self): parent = 'A,B,C,D,E'.split(',')[randint(0,4)] insert(self.subtree, parent=find(parent)) Menu.relocate(find('F'), relative_to=find('f'), mode=APPEND) expected = [[x,] for x in 'A,B,C,D,E'.split(',')] for i in range(len(expected)): if expected[i][0] == parent: expected[i].append([[x,] for x in 'a,b,c,d,e,f,F'.split(',')]) break self.assertEqualTree(expected)
def test_move_one_up_middle_prepend(self): parent = 'B,C,D,E,F'.split(',')[randint(0,4)] insert(self.subtree, parent=find(parent)) Menu.relocate(find('A'), relative_to=find('d')) expected = [[x,] for x in 'B,C,D,E,F'.split(',')] for i in range(len(expected)): if expected[i][0] == parent: expected[i].append([[x,] for x in 'a,b,c,A,d,e,f'.split(',')]) break self.assertEqualTree(expected)
def test_append_to_node(self): Menu.relocate(find('F'), relative_to=find('E'), mode=SUBTREE) expected = [['A',],['B',],['C',],['D',],['E',['F',]],] self.assertEqualTree(expected) Menu.relocate(find('B'), relative_to=find('A'), mode=SUBTREE) expected = [['A',['B',]],['C',],['D',],['E',['F',]],] self.assertEqualTree(expected) Menu.relocate(find('D'), relative_to=find('C'), mode=SUBTREE) expected = [['A',['B',]],['C',['D',]],['E',['F',]],] self.assertEqualTree(expected) Menu.relocate(find('C'), relative_to=find('A'), mode=SUBTREE) expected = [['A',[['B',],['C',['D',]]]],['E',['F',]],] self.assertEqualTree(expected) Menu.relocate(find('A'), relative_to=find('F'), mode=SUBTREE) expected = (('E',(('F',(('A',(('B',),('C',('D',)),)),)),)),) self.assertEqualTree(expected) Menu.relocate(find('C'), relative_to=find('B'), mode=SUBTREE) expected = (('E',(('F',(('A',(('B',(('C',('D',)),)),)),)),)),) self.assertEqualTree(expected) Menu.relocate(find('B'), relative_to=find('E'), mode=APPEND) Menu.relocate(find('F'), relative_to=find('E'), mode=APPEND) Menu.relocate(find('C'), relative_to=find('E'), mode=APPEND) Menu.relocate(find('A'), relative_to=find('E'), mode=APPEND) Menu.relocate(find('D'), relative_to=find('E')) expected = ((x,) for x in 'D,E,A,C,F,B'.split(',')) self.assertEqualTree(expected)
def test_move_last_append(self): Menu.relocate(find('E'), relative_to=find('F'), mode=APPEND) expected = ((x,) for x in 'A,B,C,D,F,E'.split(',')) self.assertEqualTree(expected)
def test_move_last_prepend(self): Menu.relocate(find('E'), relative_to=find('F')) expected = ((x,) for x in 'A,B,C,D,E,F'.split(',')) self.assertEqualTree(expected)
def test_move_middle_append(self): Menu.relocate(find('C'), relative_to=find('D'), mode=APPEND) expected = ((x,) for x in 'A,B,D,C,E,F'.split(',')) self.assertEqualTree(expected)
def test_move_first_prepend(self): Menu.relocate(find('B'), relative_to=find('A')) expected = ((x,) for x in 'B,A,C,D,E,F'.split(',')) self.assertEqualTree(expected)