forked from adamm/git-importer
Create a flat list of commits to do from the tree
Walk the node tree and record the parents, then reverse the tree so we can have the exact order in which to create git commits
This commit is contained in:
@@ -38,7 +38,7 @@ class TreeNode:
|
||||
if node.merged:
|
||||
source_node = node.merged
|
||||
while source_node:
|
||||
walker.call(node, True)
|
||||
walker.call(source_node, True)
|
||||
source_node = source_node.parent
|
||||
if source_node and source_node.merged_into:
|
||||
break
|
||||
|
Reference in New Issue
Block a user