def build_graph_from_subsequent_revisions(self, left_nodes, right: [str], revision_number):
ptr_left = 0
ptr_right = 0
right_nodes = []
while True:
# if no more to process on the right side and the left side
if ptr_left >= len(left_nodes) and ptr_right >= len(right):
break
# if no more to process on the left side, but more on the right side
# Iterate through the right nodes, and add all of them (added) as the right nodes array and the graph
if ptr_left >= len(left_nodes) and ptr_right < len(right):
for i in range(ptr_right, len(right)):
new_right_node = Node("a", ptr_right + 1, right[ptr_right], revision_number + 1)
right_nodes.append(new_right_node)
self.graph.add_node(new_right_node, node_id=new_right_node.get_node_id())
break
# If more to process on the left side and no more to process on the right side,
# Iterate through the left nodes, and mark all of them as (deleted) the left nodes array.
# Find the left node on the graph. Change its label.
if ptr_left < len(left_nodes) and ptr_right >= len(right):
for i in range(ptr_left, len(left_nodes)):
if self.graph.out_degree(left_nodes[i]) > 0:
continue
graph_node = self.get_node_from_graph(left_nodes, ptr_left)
# graph_node = list(self.G.nodes)[int(self.G.nodes[left_nodes[i]]['id']) - 1]
graph_node.label = "d"
break
left_node = left_nodes[ptr_left]
if self.mapper.get_mapping(left_node.line_number, ptr_right + 1, left_node.revision_number) == 'u':
new_right_node = Node("u", ptr_right + 1, right[ptr_right], revision_number + 1)
self.graph.add_node(new_right_node, node_id=new_right_node.get_node_id())
self.graph.add_edge(left_node, new_right_node)
right_nodes.append(new_right_node)
ptr_left = ptr_left + 1
ptr_right = ptr_right + 1
continue
if self.mapper.get_mapping(left_node.line_number, ptr_right + 1, left_node.revision_number) == 'c':
new_right_node = Node("c", ptr_right + 1, right[ptr_right], revision_number + 1)
self.graph.add_node(new_right_node, node_id=new_right_node.get_node_id())
self.graph.add_edge(left_node, new_right_node)
right_nodes.append(new_right_node)
ptr_right = ptr_right + 1
continue
# Unmatched
if self.graph.out_degree(left_node) > 0:
ptr_left = ptr_left + 1
continue
ptr_left, ptr_right = self.handle_unmatched(ptr_left, ptr_right, left_nodes, right, right_nodes)
return right_nodes
def handle_unmatched(self, ptr_left: int, ptr_right: int,
left_nodes: [Node], right, right_nodes: [Node]):
left_revision_number = left_nodes[ptr_left].revision_number
right_revision_number = left_revision_number + 1
# Increment the left ptr
ptr_left = ptr_left + 1
# If left_ptr out of bounds
if ptr_left >= len(left_nodes):
ptr_left = ptr_left - 1
# right is an "a" add to graph
new_right_node = Node("a", ptr_right + 1, right[ptr_right],
right_revision_number)
self.graph.add_node(new_right_node,
node_id=new_right_node.get_node_id())
right_nodes.append(new_right_node)
# move right ptr by 1
ptr_right = ptr_right + 1
return ptr_left, ptr_right
# Compare left_ptr and right
left_node = left_nodes[ptr_left]
match_status = self.matcher.evaluate_match(left_node.content,
right[ptr_right])
if "unmatched" in match_status:
# Unmatched
# Create right node as "a" and add to the graph
# Add to the right_nodes list
# left_node_to_be_changed = self.get_node_from_graph(left_nodes, ptr_left - 1)
# left_node_to_be_changed.label = "d"
new_right_node = Node("a", ptr_right + 1, right[ptr_right],
right_revision_number)
self.graph.add_node(new_right_node,
node_id=new_right_node.get_node_id())
right_nodes.append(new_right_node)
ptr_right = ptr_right + 1
ptr_left = ptr_left - 1
return ptr_left, ptr_right
else:
# Mark left_ptr - 1 as "d"
left_node_to_be_changed = self.get_node_from_graph(
left_nodes, ptr_left - 1)
left_node_to_be_changed.label = "d"
# Create right node as "u" and add to the graph
new_right_node = Node(match_status, ptr_right + 1,
right[ptr_right], right_revision_number)
self.graph.add_node(new_right_node,
node_id=new_right_node.get_node_id())
# Add to the right_nodes list
right_nodes.append(new_right_node)
# Add an edge between left_ptr and right_ptr + 1
self.graph.add_edge(left_node, new_right_node)
# Increment left_ptr and right_ptr by 1
ptr_right = ptr_right + 1
ptr_left = ptr_left + 1
return ptr_left, ptr_right
def initialize_first_revision(self, first_revision):
nodes = []
line_number = 1
# noinspection PyPackageRequirements
for line_content in first_revision:
new_node = Node('a', line_number, line_content, 1)
nodes.append(new_node)
line_number = line_number + 1
self.graph.add_node(new_node, node_id=new_node.get_node_id())
return nodes
def handle_predecessors(self, pred_node: Node, nodes_dict: dict,
content_dict: dict, ending_revision: int):
for p in self.G.predecessors(pred_node):
p_index = p.get_node_id()
content_dict[p_index] = []
content_dict[p_index].append(pred_node.get_node_id())
nodes_dict[p] = []
nodes_dict[p].append(pred_node)
current_revision = int(p.get_node_id().split(".")[0])
if current_revision < ending_revision:
break
self.handle_predecessors(p, nodes_dict, content_dict,
ending_revision)
def handle_successors(self, succ_node: Node, nodes_dict: dict,
content_dict: dict, ending_revision: int):
for s in self.G.successors(succ_node):
nodes_dict[succ_node].append(s)
s_index = s.get_node_id()
content_dict[succ_node.get_node_id()].append(s_index)
current_revision = int(s.get_node_id().split(".")[0])
if current_revision >= ending_revision:
break
nodes_dict[s] = []
content_dict[s_index] = []
self.handle_successors(s, nodes_dict, content_dict,
ending_revision)