215
215
rn.add_file_edge_hashes(basis, missing_files)
217
217
matches = rn.file_match(tree, candidate_files)
224
228
reversed = dict((v, k) for k, v in matches.iteritems())
225
229
child_to_parent = sorted(
226
230
matches.values(), key=lambda x: reversed[x], reverse=True)