def test_move_node(self):
"""
test if a node can be successfully moved to another node in the graph
"""
# test moving a single node to another branch
# this node should be grouped with it's new parent nodegroup
graph = Graph(self.rootNode)
branch_one = graph.append_branch('P1', graphid=self.NODE_NODETYPE_GRAPHID)
branch_two = graph.append_branch('P1', graphid=self.NODE_NODETYPE_GRAPHID)
branch_three = graph.append_branch('P1', graphid=self.SINGLE_NODE_GRAPHID)
branch_three_nodeid = branch_three.nodes.iterkeys().next()
branch_one_rootnodeid = branch_one.root.nodeid
graph.move_node(branch_three_nodeid, 'P1', branch_one_rootnodeid)
new_parent_nodegroup = None
moved_branch_nodegroup = None
for node_id, node in graph.nodes.iteritems():
if node_id == branch_one_rootnodeid:
new_parent_nodegroup = node.nodegroup
if node_id == branch_three_nodeid:
moved_branch_nodegroup = node.nodegroup
self.assertIsNotNone(new_parent_nodegroup)
self.assertIsNotNone(moved_branch_nodegroup)
self.assertEqual(new_parent_nodegroup, moved_branch_nodegroup)
# test moving a branch to another branch
# this branch should NOT be grouped with it's new parent nodegroup
branch_two_rootnodeid = branch_two.root.nodeid
graph.move_node(branch_one_rootnodeid, 'P1', branch_two_rootnodeid)
new_parent_nodegroup = None
moved_branch_nodegroup = None
for node_id, node in graph.nodes.iteritems():
if node_id == branch_two_rootnodeid:
new_parent_nodegroup = node.nodegroup
if node_id == branch_one_rootnodeid:
moved_branch_nodegroup = node.nodegroup
self.assertIsNotNone(new_parent_nodegroup)
self.assertIsNotNone(moved_branch_nodegroup)
self.assertNotEqual(new_parent_nodegroup, moved_branch_nodegroup)
updated_edge = None
for edge_id, edge in graph.edges.iteritems():
if (edge.domainnode_id == branch_two_rootnodeid and
edge.rangenode_id == branch_one_rootnodeid):
updated_edge = edge
self.assertIsNotNone(updated_edge)
# save and retrieve the graph from the database and confirm that
# the graph shape has been saved properly
graph.save()
graph = Graph(self.rootNode)
tree = graph.get_tree()
self.assertEqual(len(tree['children']), 1)
level_one_node = tree['children'][0]
self.assertEqual(branch_two_rootnodeid, level_one_node['node'].nodeid)
self.assertEqual(len(level_one_node['children']), 2)
for child in level_one_node['children']:
if child['node'].nodeid == branch_one_rootnodeid:
self.assertEqual(len(child['children']), 2)
found_branch_three = False
for child in child['children']:
if child['node'].nodeid == branch_three_nodeid:
found_branch_three = True
self.assertTrue(found_branch_three)
else:
self.assertEqual(len(child['children']), 0)
