528
591
self.assertContainsRe(diff, "=== modified file 'mod_%s'"%autf8)
529
592
self.assertContainsRe(diff, "=== removed file 'del_%s'"%autf8)
595
class DiffWasIs(DiffPath):
597
def diff(self, file_id, old_path, new_path, old_kind, new_kind):
598
self.to_file.write('was: ')
599
self.to_file.write(self.old_tree.get_file(file_id).read())
600
self.to_file.write('is: ')
601
self.to_file.write(self.new_tree.get_file(file_id).read())
605
class TestDiffTree(TestCaseWithTransport):
608
TestCaseWithTransport.setUp(self)
609
self.old_tree = self.make_branch_and_tree('old-tree')
610
self.old_tree.lock_write()
611
self.addCleanup(self.old_tree.unlock)
612
self.new_tree = self.make_branch_and_tree('new-tree')
613
self.new_tree.lock_write()
614
self.addCleanup(self.new_tree.unlock)
615
self.differ = DiffTree(self.old_tree, self.new_tree, StringIO())
617
def test_diff_text(self):
618
self.build_tree_contents([('old-tree/olddir/',),
619
('old-tree/olddir/oldfile', 'old\n')])
620
self.old_tree.add('olddir')
621
self.old_tree.add('olddir/oldfile', 'file-id')
622
self.build_tree_contents([('new-tree/newdir/',),
623
('new-tree/newdir/newfile', 'new\n')])
624
self.new_tree.add('newdir')
625
self.new_tree.add('newdir/newfile', 'file-id')
626
differ = DiffText(self.old_tree, self.new_tree, StringIO())
627
differ.diff_text('file-id', None, 'old label', 'new label')
629
'--- old label\n+++ new label\n@@ -1,1 +0,0 @@\n-old\n\n',
630
differ.to_file.getvalue())
631
differ.to_file.seek(0)
632
differ.diff_text(None, 'file-id', 'old label', 'new label')
634
'--- old label\n+++ new label\n@@ -0,0 +1,1 @@\n+new\n\n',
635
differ.to_file.getvalue())
636
differ.to_file.seek(0)
637
differ.diff_text('file-id', 'file-id', 'old label', 'new label')
639
'--- old label\n+++ new label\n@@ -1,1 +1,1 @@\n-old\n+new\n\n',
640
differ.to_file.getvalue())
642
def test_diff_deletion(self):
643
self.build_tree_contents([('old-tree/file', 'contents'),
644
('new-tree/file', 'contents')])
645
self.old_tree.add('file', 'file-id')
646
self.new_tree.add('file', 'file-id')
647
os.unlink('new-tree/file')
648
self.differ.show_diff(None)
649
self.assertContainsRe(self.differ.to_file.getvalue(), '-contents')
651
def test_diff_creation(self):
652
self.build_tree_contents([('old-tree/file', 'contents'),
653
('new-tree/file', 'contents')])
654
self.old_tree.add('file', 'file-id')
655
self.new_tree.add('file', 'file-id')
656
os.unlink('old-tree/file')
657
self.differ.show_diff(None)
658
self.assertContainsRe(self.differ.to_file.getvalue(), '\+contents')
660
def test_diff_symlink(self):
661
differ = DiffSymlink(self.old_tree, self.new_tree, StringIO())
662
differ.diff_symlink('old target', None)
663
self.assertEqual("=== target was 'old target'\n",
664
differ.to_file.getvalue())
666
differ = DiffSymlink(self.old_tree, self.new_tree, StringIO())
667
differ.diff_symlink(None, 'new target')
668
self.assertEqual("=== target is 'new target'\n",
669
differ.to_file.getvalue())
671
differ = DiffSymlink(self.old_tree, self.new_tree, StringIO())
672
differ.diff_symlink('old target', 'new target')
673
self.assertEqual("=== target changed 'old target' => 'new target'\n",
674
differ.to_file.getvalue())
677
self.build_tree_contents([('old-tree/olddir/',),
678
('old-tree/olddir/oldfile', 'old\n')])
679
self.old_tree.add('olddir')
680
self.old_tree.add('olddir/oldfile', 'file-id')
681
self.build_tree_contents([('new-tree/newdir/',),
682
('new-tree/newdir/newfile', 'new\n')])
683
self.new_tree.add('newdir')
684
self.new_tree.add('newdir/newfile', 'file-id')
685
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
686
self.assertContainsRe(
687
self.differ.to_file.getvalue(),
688
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
689
' \@\@\n-old\n\+new\n\n')
691
def test_diff_kind_change(self):
692
self.requireFeature(tests.SymlinkFeature)
693
self.build_tree_contents([('old-tree/olddir/',),
694
('old-tree/olddir/oldfile', 'old\n')])
695
self.old_tree.add('olddir')
696
self.old_tree.add('olddir/oldfile', 'file-id')
697
self.build_tree(['new-tree/newdir/'])
698
os.symlink('new', 'new-tree/newdir/newfile')
699
self.new_tree.add('newdir')
700
self.new_tree.add('newdir/newfile', 'file-id')
701
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
702
self.assertContainsRe(
703
self.differ.to_file.getvalue(),
704
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+0,0'
706
self.assertContainsRe(self.differ.to_file.getvalue(),
707
"=== target is u'new'\n")
709
def test_diff_directory(self):
710
self.build_tree(['new-tree/new-dir/'])
711
self.new_tree.add('new-dir', 'new-dir-id')
712
self.differ.diff('new-dir-id', None, 'new-dir')
713
self.assertEqual(self.differ.to_file.getvalue(), '')
715
def create_old_new(self):
716
self.build_tree_contents([('old-tree/olddir/',),
717
('old-tree/olddir/oldfile', 'old\n')])
718
self.old_tree.add('olddir')
719
self.old_tree.add('olddir/oldfile', 'file-id')
720
self.build_tree_contents([('new-tree/newdir/',),
721
('new-tree/newdir/newfile', 'new\n')])
722
self.new_tree.add('newdir')
723
self.new_tree.add('newdir/newfile', 'file-id')
725
def test_register_diff(self):
726
self.create_old_new()
727
old_diff_factories = DiffTree.diff_factories
728
DiffTree.diff_factories=old_diff_factories[:]
729
DiffTree.diff_factories.insert(0, DiffWasIs.from_diff_tree)
731
differ = DiffTree(self.old_tree, self.new_tree, StringIO())
733
DiffTree.diff_factories = old_diff_factories
734
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
735
self.assertNotContainsRe(
736
differ.to_file.getvalue(),
737
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
738
' \@\@\n-old\n\+new\n\n')
739
self.assertContainsRe(differ.to_file.getvalue(),
740
'was: old\nis: new\n')
742
def test_extra_factories(self):
743
self.create_old_new()
744
differ = DiffTree(self.old_tree, self.new_tree, StringIO(),
745
extra_factories=[DiffWasIs.from_diff_tree])
746
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
747
self.assertNotContainsRe(
748
differ.to_file.getvalue(),
749
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
750
' \@\@\n-old\n\+new\n\n')
751
self.assertContainsRe(differ.to_file.getvalue(),
752
'was: old\nis: new\n')
754
def test_alphabetical_order(self):
755
self.build_tree(['new-tree/a-file'])
756
self.new_tree.add('a-file')
757
self.build_tree(['old-tree/b-file'])
758
self.old_tree.add('b-file')
759
self.differ.show_diff(None)
760
self.assertContainsRe(self.differ.to_file.getvalue(),
761
'.*a-file(.|\n)*b-file')
531
764
class TestPatienceDiffLib(TestCase):
767
super(TestPatienceDiffLib, self).setUp()
768
self._unique_lcs = bzrlib._patiencediff_py.unique_lcs_py
769
self._recurse_matches = bzrlib._patiencediff_py.recurse_matches_py
770
self._PatienceSequenceMatcher = \
771
bzrlib._patiencediff_py.PatienceSequenceMatcher_py
773
def test_diff_unicode_string(self):
774
a = ''.join([unichr(i) for i in range(4000, 4500, 3)])
775
b = ''.join([unichr(i) for i in range(4300, 4800, 2)])
776
sm = self._PatienceSequenceMatcher(None, a, b)
777
mb = sm.get_matching_blocks()
778
self.assertEquals(35, len(mb))
533
780
def test_unique_lcs(self):
534
unique_lcs = bzrlib.patiencediff.unique_lcs
781
unique_lcs = self._unique_lcs
535
782
self.assertEquals(unique_lcs('', ''), [])
783
self.assertEquals(unique_lcs('', 'a'), [])
784
self.assertEquals(unique_lcs('a', ''), [])
536
785
self.assertEquals(unique_lcs('a', 'a'), [(0,0)])
537
786
self.assertEquals(unique_lcs('a', 'b'), [])
538
787
self.assertEquals(unique_lcs('ab', 'ab'), [(0,0), (1,1)])
539
788
self.assertEquals(unique_lcs('abcde', 'cdeab'), [(2,0), (3,1), (4,2)])
540
789
self.assertEquals(unique_lcs('cdeab', 'abcde'), [(0,2), (1,3), (2,4)])
541
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
790
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
543
792
self.assertEquals(unique_lcs('acbac', 'abc'), [(2,1)])
545
794
def test_recurse_matches(self):
546
795
def test_one(a, b, matches):
547
796
test_matches = []
548
bzrlib.patiencediff.recurse_matches(a, b, 0, 0, len(a), len(b),
797
self._recurse_matches(
798
a, b, 0, 0, len(a), len(b), test_matches, 10)
550
799
self.assertEquals(test_matches, matches)
552
801
test_one(['a', '', 'b', '', 'c'], ['a', 'a', 'b', 'c', 'c'],
553
802
[(0, 0), (2, 2), (4, 4)])
554
803
test_one(['a', 'c', 'b', 'a', 'c'], ['a', 'b', 'c'],
555
804
[(0, 0), (2, 1), (4, 2)])
805
# Even though 'bc' is not unique globally, and is surrounded by
806
# non-matching lines, we should still match, because they are locally
808
test_one('abcdbce', 'afbcgdbce', [(0,0), (1, 2), (2, 3), (3, 5),
809
(4, 6), (5, 7), (6, 8)])
557
# recurse_matches doesn't match non-unique
811
# recurse_matches doesn't match non-unique
558
812
# lines surrounded by bogus text.
559
813
# The update has been done in patiencediff.SequenceMatcher instead
564
818
# This is what it currently gives:
565
819
test_one('aBccDe', 'abccde', [(0,0), (5,5)])
821
def assertDiffBlocks(self, a, b, expected_blocks):
822
"""Check that the sequence matcher returns the correct blocks.
824
:param a: A sequence to match
825
:param b: Another sequence to match
826
:param expected_blocks: The expected output, not including the final
827
matching block (len(a), len(b), 0)
829
matcher = self._PatienceSequenceMatcher(None, a, b)
830
blocks = matcher.get_matching_blocks()
832
self.assertEqual((len(a), len(b), 0), last)
833
self.assertEqual(expected_blocks, blocks)
567
835
def test_matching_blocks(self):
568
def chk_blocks(a, b, expected_blocks):
569
# difflib always adds a signature of the total
570
# length, with no matching entries at the end
571
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
572
blocks = s.get_matching_blocks()
573
self.assertEquals((len(a), len(b), 0), blocks[-1])
574
self.assertEquals(expected_blocks, blocks[:-1])
576
836
# Some basic matching tests
577
chk_blocks('', '', [])
578
chk_blocks([], [], [])
579
chk_blocks('abcd', 'abcd', [(0, 0, 4)])
580
chk_blocks('abcd', 'abce', [(0, 0, 3)])
581
chk_blocks('eabc', 'abce', [(1, 0, 3)])
582
chk_blocks('eabce', 'abce', [(1, 0, 4)])
583
chk_blocks('abcde', 'abXde', [(0, 0, 2), (3, 3, 2)])
584
chk_blocks('abcde', 'abXYZde', [(0, 0, 2), (3, 5, 2)])
585
chk_blocks('abde', 'abXYZde', [(0, 0, 2), (2, 5, 2)])
586
# This may check too much, but it checks to see that
837
self.assertDiffBlocks('', '', [])
838
self.assertDiffBlocks([], [], [])
839
self.assertDiffBlocks('abc', '', [])
840
self.assertDiffBlocks('', 'abc', [])
841
self.assertDiffBlocks('abcd', 'abcd', [(0, 0, 4)])
842
self.assertDiffBlocks('abcd', 'abce', [(0, 0, 3)])
843
self.assertDiffBlocks('eabc', 'abce', [(1, 0, 3)])
844
self.assertDiffBlocks('eabce', 'abce', [(1, 0, 4)])
845
self.assertDiffBlocks('abcde', 'abXde', [(0, 0, 2), (3, 3, 2)])
846
self.assertDiffBlocks('abcde', 'abXYZde', [(0, 0, 2), (3, 5, 2)])
847
self.assertDiffBlocks('abde', 'abXYZde', [(0, 0, 2), (2, 5, 2)])
848
# This may check too much, but it checks to see that
587
849
# a copied block stays attached to the previous section,
588
850
# not the later one.
589
851
# difflib would tend to grab the trailing longest match
590
852
# which would make the diff not look right
591
chk_blocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
592
[(0, 0, 6), (6, 11, 10)])
853
self.assertDiffBlocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
854
[(0, 0, 6), (6, 11, 10)])
594
856
# make sure it supports passing in lists
857
self.assertDiffBlocks(
596
858
['hello there\n',
598
860
'how are you today?\n'],
603
865
# non unique lines surrounded by non-matching lines
605
chk_blocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
867
self.assertDiffBlocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
607
869
# But they only need to be locally unique
608
chk_blocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
870
self.assertDiffBlocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
610
872
# non unique blocks won't be matched
611
chk_blocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
873
self.assertDiffBlocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
613
875
# but locally unique ones will
614
chk_blocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
876
self.assertDiffBlocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
615
877
(5,4,1), (7,5,2), (10,8,1)])
617
chk_blocks('abbabbXd', 'cabbabxd', [(7,7,1)])
618
chk_blocks('abbabbbb', 'cabbabbc', [])
619
chk_blocks('bbbbbbbb', 'cbbbbbbc', [])
879
self.assertDiffBlocks('abbabbXd', 'cabbabxd', [(7,7,1)])
880
self.assertDiffBlocks('abbabbbb', 'cabbabbc', [])
881
self.assertDiffBlocks('bbbbbbbb', 'cbbbbbbc', [])
883
def test_matching_blocks_tuples(self):
884
# Some basic matching tests
885
self.assertDiffBlocks([], [], [])
886
self.assertDiffBlocks([('a',), ('b',), ('c,')], [], [])
887
self.assertDiffBlocks([], [('a',), ('b',), ('c,')], [])
888
self.assertDiffBlocks([('a',), ('b',), ('c,')],
889
[('a',), ('b',), ('c,')],
891
self.assertDiffBlocks([('a',), ('b',), ('c,')],
892
[('a',), ('b',), ('d,')],
894
self.assertDiffBlocks([('d',), ('b',), ('c,')],
895
[('a',), ('b',), ('c,')],
897
self.assertDiffBlocks([('d',), ('a',), ('b',), ('c,')],
898
[('a',), ('b',), ('c,')],
900
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
901
[('a', 'b'), ('c', 'X'), ('e', 'f')],
902
[(0, 0, 1), (2, 2, 1)])
903
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
904
[('a', 'b'), ('c', 'dX'), ('e', 'f')],
905
[(0, 0, 1), (2, 2, 1)])
621
907
def test_opcodes(self):
622
908
def chk_ops(a, b, expected_codes):
623
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
909
s = self._PatienceSequenceMatcher(None, a, b)
624
910
self.assertEquals(expected_codes, s.get_opcodes())
626
912
chk_ops('', '', [])
627
913
chk_ops([], [], [])
914
chk_ops('abc', '', [('delete', 0,3, 0,0)])
915
chk_ops('', 'abc', [('insert', 0,0, 0,3)])
628
916
chk_ops('abcd', 'abcd', [('equal', 0,4, 0,4)])
629
917
chk_ops('abcd', 'abce', [('equal', 0,3, 0,3),
630
918
('replace', 3,4, 3,4)
692
980
('equal', 10,11, 8,9)
983
def test_grouped_opcodes(self):
984
def chk_ops(a, b, expected_codes, n=3):
985
s = self._PatienceSequenceMatcher(None, a, b)
986
self.assertEquals(expected_codes, list(s.get_grouped_opcodes(n)))
990
chk_ops('abc', '', [[('delete', 0,3, 0,0)]])
991
chk_ops('', 'abc', [[('insert', 0,0, 0,3)]])
992
chk_ops('abcd', 'abcd', [])
993
chk_ops('abcd', 'abce', [[('equal', 0,3, 0,3),
994
('replace', 3,4, 3,4)
996
chk_ops('eabc', 'abce', [[('delete', 0,1, 0,0),
1000
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
1001
[[('equal', 3,6, 3,6),
1002
('insert', 6,6, 6,11),
1003
('equal', 6,9, 11,14)
1005
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
1006
[[('equal', 2,6, 2,6),
1007
('insert', 6,6, 6,11),
1008
('equal', 6,10, 11,15)
1010
chk_ops('Xabcdef', 'abcdef',
1011
[[('delete', 0,1, 0,0),
1014
chk_ops('abcdef', 'abcdefX',
1015
[[('equal', 3,6, 3,6),
1016
('insert', 6,6, 6,7)
695
1020
def test_multiple_ranges(self):
696
1021
# There was an earlier bug where we used a bad set of ranges,
697
1022
# this triggers that specific bug, to make sure it doesn't regress
698
def chk_blocks(a, b, expected_blocks):
699
# difflib always adds a signature of the total
700
# length, with no matching entries at the end
701
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
702
blocks = s.get_matching_blocks()
704
self.assertEquals(x, (len(a), len(b), 0))
705
self.assertEquals(expected_blocks, blocks)
707
chk_blocks('abcdefghijklmnop'
708
, 'abcXghiYZQRSTUVWXYZijklmnop'
709
, [(0, 0, 3), (6, 4, 3), (9, 20, 7)])
711
chk_blocks('ABCd efghIjk L'
712
, 'AxyzBCn mo pqrstuvwI1 2 L'
713
, [(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
1023
self.assertDiffBlocks('abcdefghijklmnop',
1024
'abcXghiYZQRSTUVWXYZijklmnop',
1025
[(0, 0, 3), (6, 4, 3), (9, 20, 7)])
1027
self.assertDiffBlocks('ABCd efghIjk L',
1028
'AxyzBCn mo pqrstuvwI1 2 L',
1029
[(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
715
1031
# These are rot13 code snippets.
1032
self.assertDiffBlocks('''\
717
1033
trg nqqrq jura lbh nqq n svyr va gur qverpgbel.
719
1035
gnxrf_netf = ['svyr*']
720
1036
gnxrf_bcgvbaf = ['ab-erphefr']
722
1038
qrs eha(frys, svyr_yvfg, ab_erphefr=Snyfr):
723
1039
sebz omeyvo.nqq vzcbeg fzneg_nqq, nqq_ercbegre_cevag, nqq_ercbegre_ahyy
878
1246
, list(unified_diff_files('a2', 'b2',
879
1247
sequencematcher=psm)))
1250
class TestPatienceDiffLibFiles_c(TestPatienceDiffLibFiles):
1252
_test_needs_features = [CompiledPatienceDiffFeature]
1255
super(TestPatienceDiffLibFiles_c, self).setUp()
1256
import bzrlib._patiencediff_c
1257
self._PatienceSequenceMatcher = \
1258
bzrlib._patiencediff_c.PatienceSequenceMatcher_c
1261
class TestUsingCompiledIfAvailable(TestCase):
1263
def test_PatienceSequenceMatcher(self):
1264
if CompiledPatienceDiffFeature.available():
1265
from bzrlib._patiencediff_c import PatienceSequenceMatcher_c
1266
self.assertIs(PatienceSequenceMatcher_c,
1267
bzrlib.patiencediff.PatienceSequenceMatcher)
1269
from bzrlib._patiencediff_py import PatienceSequenceMatcher_py
1270
self.assertIs(PatienceSequenceMatcher_py,
1271
bzrlib.patiencediff.PatienceSequenceMatcher)
1273
def test_unique_lcs(self):
1274
if CompiledPatienceDiffFeature.available():
1275
from bzrlib._patiencediff_c import unique_lcs_c
1276
self.assertIs(unique_lcs_c,
1277
bzrlib.patiencediff.unique_lcs)
1279
from bzrlib._patiencediff_py import unique_lcs_py
1280
self.assertIs(unique_lcs_py,
1281
bzrlib.patiencediff.unique_lcs)
1283
def test_recurse_matches(self):
1284
if CompiledPatienceDiffFeature.available():
1285
from bzrlib._patiencediff_c import recurse_matches_c
1286
self.assertIs(recurse_matches_c,
1287
bzrlib.patiencediff.recurse_matches)
1289
from bzrlib._patiencediff_py import recurse_matches_py
1290
self.assertIs(recurse_matches_py,
1291
bzrlib.patiencediff.recurse_matches)
1294
class TestDiffFromTool(TestCaseWithTransport):
1296
def test_from_string(self):
1297
diff_obj = DiffFromTool.from_string('diff', None, None, None)
1298
self.addCleanup(diff_obj.finish)
1299
self.assertEqual(['diff', '%(old_path)s', '%(new_path)s'],
1300
diff_obj.command_template)
1302
def test_from_string_u5(self):
1303
diff_obj = DiffFromTool.from_string('diff -u\\ 5', None, None, None)
1304
self.addCleanup(diff_obj.finish)
1305
self.assertEqual(['diff', '-u 5', '%(old_path)s', '%(new_path)s'],
1306
diff_obj.command_template)
1307
self.assertEqual(['diff', '-u 5', 'old-path', 'new-path'],
1308
diff_obj._get_command('old-path', 'new-path'))
1310
def test_execute(self):
1312
diff_obj = DiffFromTool(['python', '-c',
1313
'print "%(old_path)s %(new_path)s"'],
1315
self.addCleanup(diff_obj.finish)
1316
diff_obj._execute('old', 'new')
1317
self.assertEqual(output.getvalue().rstrip(), 'old new')
1319
def test_excute_missing(self):
1320
diff_obj = DiffFromTool(['a-tool-which-is-unlikely-to-exist'],
1322
self.addCleanup(diff_obj.finish)
1323
e = self.assertRaises(ExecutableMissing, diff_obj._execute, 'old',
1325
self.assertEqual('a-tool-which-is-unlikely-to-exist could not be found'
1326
' on this machine', str(e))
1328
def test_prepare_files_creates_paths_readable_by_windows_tool(self):
1329
self.requireFeature(AttribFeature)
1331
tree = self.make_branch_and_tree('tree')
1332
self.build_tree_contents([('tree/file', 'content')])
1333
tree.add('file', 'file-id')
1334
tree.commit('old tree')
1336
self.addCleanup(tree.unlock)
1337
diff_obj = DiffFromTool(['python', '-c',
1338
'print "%(old_path)s %(new_path)s"'],
1340
diff_obj._prepare_files('file-id', 'file', 'file')
1341
self.assertReadableByAttrib(diff_obj._root, 'old\\file', r'old\\file')
1342
self.assertReadableByAttrib(diff_obj._root, 'new\\file', r'new\\file')
1344
def assertReadableByAttrib(self, cwd, relpath, regex):
1345
proc = subprocess.Popen(['attrib', relpath],
1346
stdout=subprocess.PIPE,
1349
result = proc.stdout.read()
1350
self.assertContainsRe(result, regex)
1352
def test_prepare_files(self):
1354
tree = self.make_branch_and_tree('tree')
1355
self.build_tree_contents([('tree/oldname', 'oldcontent')])
1356
self.build_tree_contents([('tree/oldname2', 'oldcontent2')])
1357
tree.add('oldname', 'file-id')
1358
tree.add('oldname2', 'file2-id')
1359
tree.commit('old tree', timestamp=0)
1360
tree.rename_one('oldname', 'newname')
1361
tree.rename_one('oldname2', 'newname2')
1362
self.build_tree_contents([('tree/newname', 'newcontent')])
1363
self.build_tree_contents([('tree/newname2', 'newcontent2')])
1364
old_tree = tree.basis_tree()
1365
old_tree.lock_read()
1366
self.addCleanup(old_tree.unlock)
1368
self.addCleanup(tree.unlock)
1369
diff_obj = DiffFromTool(['python', '-c',
1370
'print "%(old_path)s %(new_path)s"'],
1371
old_tree, tree, output)
1372
self.addCleanup(diff_obj.finish)
1373
self.assertContainsRe(diff_obj._root, 'bzr-diff-[^/]*')
1374
old_path, new_path = diff_obj._prepare_files('file-id', 'oldname',
1376
self.assertContainsRe(old_path, 'old/oldname$')
1377
self.assertEqual(0, os.stat(old_path).st_mtime)
1378
self.assertContainsRe(new_path, 'new/newname$')
1379
self.assertFileEqual('oldcontent', old_path)
1380
self.assertFileEqual('newcontent', new_path)
1381
if osutils.host_os_dereferences_symlinks():
1382
self.assertTrue(os.path.samefile('tree/newname', new_path))
1383
# make sure we can create files with the same parent directories
1384
diff_obj._prepare_files('file2-id', 'oldname2', 'newname2')