430
431
self.assertPathToKey(([u''], u'a'), u'a')
431
432
self.assertPathToKey(([u'a'], u'b'), u'a/b')
432
433
self.assertPathToKey(([u'a', u'b'], u'c'), u'a/b/c')
436
class FindPreviousPathsTests(TestCaseWithTransport):
439
tree = self.make_branch_and_tree('tree')
440
self.build_tree(['tree/b'])
442
revid1 = tree.commit('first')
443
tree1 = tree.branch.repository.revision_tree(revid1)
445
tree0 = tree.branch.repository.revision_tree(revision.NULL_REVISION)
447
self.assertEqual({'b': None}, find_previous_paths(tree1, tree0, ['b']))
449
def test_find_previous_paths(self):
450
tree = self.make_branch_and_tree('tree')
451
self.build_tree(['tree/b'])
453
revid1 = tree.commit('first')
454
tree1 = tree.branch.repository.revision_tree(revid1)
456
tree.rename_one('b', 'c')
457
self.build_tree(['tree/b'])
459
revid2 = tree.commit('second')
460
tree2 = tree.branch.repository.revision_tree(revid2)
462
self.assertEqual({'c': 'b', 'b': None},
463
find_previous_paths(tree2, tree1, ['b', 'c']))