def test_drop_sub(self):
insert(self.subtree, parent=find('C'))
Menu.drop(find('c'))
expected = [[x,] for x in 'A,B,C,D,E,F'.split(',')]
for i in range(len(expected)):
if expected[i][0] == 'C':
expected[i].append([[x,] for x in 'a,b,d,e,f'.split(',')])
self.assertEqualTree(expected)
def test_drop_cascade(self):
insert(self.subtree, parent=find('C'))
Menu.drop(find('C'), cascade=True)
expected = [[x,] for x in 'A,B,D,E,F'.split(',')]
self.assertEqualTree(expected)
def test_drop_noncascade(self):
insert(self.subtree, parent=find('C'))
Menu.drop(find('C'))
expected = [[x,] for x in 'A,B,a,b,c,d,e,f,D,E,F'.split(',')]
self.assertEqualTree(expected)
def test_drop(self):
Menu.drop(find('C'))
expected = [[x,] for x in 'A,B,D,E,F'.split(',')]
debug_list('test_drop C post')
self.assertEqualTree(expected)
