def test_insert_sub(self): k = 'A,B,C,D,E,F'.split(',')[randint(0,5)] Menu.insert(name='G', parent=find(k)) expected = [[x,] for x in 'A,B,C,D,E,F'.split(',')] for i in range(len(expected)): if expected[i][0] == k: expected[i].append(['G',]) self.assertEqualTree(expected)
def insert(data, parent=None): for d in data: if len(d) > 1: node, tree = d else: node = d[0] tree = None Menu.insert(name=node, parent=parent) if tree: insert(tree, find(node))
def test_insert_first(self): Menu.insert(name='G', before=find('A')) expected = (('G',),('A',),('B',),('C',),('D',),('E',),('F',)) self.assertEqualTree(expected)
def test_insert_last(self): Menu.insert(name='G') expected = (('A',),('B',),('C',),('D',),('E',),('F',),('G',)) self.assertEqualTree(expected)