541
489
tree.add([alpha], ['file-id'])
542
490
tree.add([omega], ['file-id-2'])
543
491
diff_content = StringIO()
544
diff.show_diff_trees(tree.basis_tree(), tree, diff_content)
545
d = diff_content.getvalue()
546
self.assertContainsRe(d, r"=== added file '%s'" % alpha_utf8)
547
self.assertContainsRe(d, "Binary files a/%s.*and b/%s.* differ\n"
548
% (alpha_utf8, alpha_utf8))
549
self.assertContainsRe(d, r"=== added file '%s'" % omega_utf8)
550
self.assertContainsRe(d, r"--- a/%s" % (omega_utf8,))
551
self.assertContainsRe(d, r"\+\+\+ b/%s" % (omega_utf8,))
553
def test_unicode_filename(self):
554
"""Test when the filename are unicode."""
555
self.requireFeature(tests.UnicodeFilenameFeature)
557
alpha, omega = u'\u03b1', u'\u03c9'
558
autf8, outf8 = alpha.encode('utf8'), omega.encode('utf8')
560
tree = self.make_branch_and_tree('tree')
561
self.build_tree_contents([('tree/ren_'+alpha, 'contents\n')])
562
tree.add(['ren_'+alpha], ['file-id-2'])
563
self.build_tree_contents([('tree/del_'+alpha, 'contents\n')])
564
tree.add(['del_'+alpha], ['file-id-3'])
565
self.build_tree_contents([('tree/mod_'+alpha, 'contents\n')])
566
tree.add(['mod_'+alpha], ['file-id-4'])
568
tree.commit('one', rev_id='rev-1')
570
tree.rename_one('ren_'+alpha, 'ren_'+omega)
571
tree.remove('del_'+alpha)
572
self.build_tree_contents([('tree/add_'+alpha, 'contents\n')])
573
tree.add(['add_'+alpha], ['file-id'])
574
self.build_tree_contents([('tree/mod_'+alpha, 'contents_mod\n')])
576
d = self.get_diff(tree.basis_tree(), tree)
577
self.assertContainsRe(d,
578
"=== renamed file 'ren_%s' => 'ren_%s'\n"%(autf8, outf8))
579
self.assertContainsRe(d, "=== added file 'add_%s'"%autf8)
580
self.assertContainsRe(d, "=== modified file 'mod_%s'"%autf8)
581
self.assertContainsRe(d, "=== removed file 'del_%s'"%autf8)
583
def test_unicode_filename_path_encoding(self):
584
"""Test for bug #382699: unicode filenames on Windows should be shown
587
self.requireFeature(tests.UnicodeFilenameFeature)
588
# The word 'test' in Russian
589
_russian_test = u'\u0422\u0435\u0441\u0442'
590
directory = _russian_test + u'/'
591
test_txt = _russian_test + u'.txt'
592
u1234 = u'\u1234.txt'
594
tree = self.make_branch_and_tree('.')
595
self.build_tree_contents([
600
tree.add([test_txt, u1234, directory])
603
diff.show_diff_trees(tree.basis_tree(), tree, sio,
604
path_encoding='cp1251')
606
output = subst_dates(sio.getvalue())
608
=== added directory '%(directory)s'
609
=== added file '%(test_txt)s'
610
--- a/%(test_txt)s\tYYYY-MM-DD HH:MM:SS +ZZZZ
611
+++ b/%(test_txt)s\tYYYY-MM-DD HH:MM:SS +ZZZZ
615
=== added file '?.txt'
616
--- a/?.txt\tYYYY-MM-DD HH:MM:SS +ZZZZ
617
+++ b/?.txt\tYYYY-MM-DD HH:MM:SS +ZZZZ
621
''' % {'directory': _russian_test.encode('cp1251'),
622
'test_txt': test_txt.encode('cp1251'),
624
self.assertEqualDiff(output, shouldbe)
627
class DiffWasIs(diff.DiffPath):
629
def diff(self, file_id, old_path, new_path, old_kind, new_kind):
630
self.to_file.write('was: ')
631
self.to_file.write(self.old_tree.get_file(file_id).read())
632
self.to_file.write('is: ')
633
self.to_file.write(self.new_tree.get_file(file_id).read())
637
class TestDiffTree(tests.TestCaseWithTransport):
640
super(TestDiffTree, self).setUp()
641
self.old_tree = self.make_branch_and_tree('old-tree')
642
self.old_tree.lock_write()
643
self.addCleanup(self.old_tree.unlock)
644
self.new_tree = self.make_branch_and_tree('new-tree')
645
self.new_tree.lock_write()
646
self.addCleanup(self.new_tree.unlock)
647
self.differ = diff.DiffTree(self.old_tree, self.new_tree, StringIO())
649
def test_diff_text(self):
650
self.build_tree_contents([('old-tree/olddir/',),
651
('old-tree/olddir/oldfile', 'old\n')])
652
self.old_tree.add('olddir')
653
self.old_tree.add('olddir/oldfile', 'file-id')
654
self.build_tree_contents([('new-tree/newdir/',),
655
('new-tree/newdir/newfile', 'new\n')])
656
self.new_tree.add('newdir')
657
self.new_tree.add('newdir/newfile', 'file-id')
658
differ = diff.DiffText(self.old_tree, self.new_tree, StringIO())
659
differ.diff_text('file-id', None, 'old label', 'new label')
661
'--- old label\n+++ new label\n@@ -1,1 +0,0 @@\n-old\n\n',
662
differ.to_file.getvalue())
663
differ.to_file.seek(0)
664
differ.diff_text(None, 'file-id', 'old label', 'new label')
666
'--- old label\n+++ new label\n@@ -0,0 +1,1 @@\n+new\n\n',
667
differ.to_file.getvalue())
668
differ.to_file.seek(0)
669
differ.diff_text('file-id', 'file-id', 'old label', 'new label')
671
'--- old label\n+++ new label\n@@ -1,1 +1,1 @@\n-old\n+new\n\n',
672
differ.to_file.getvalue())
674
def test_diff_deletion(self):
675
self.build_tree_contents([('old-tree/file', 'contents'),
676
('new-tree/file', 'contents')])
677
self.old_tree.add('file', 'file-id')
678
self.new_tree.add('file', 'file-id')
679
os.unlink('new-tree/file')
680
self.differ.show_diff(None)
681
self.assertContainsRe(self.differ.to_file.getvalue(), '-contents')
683
def test_diff_creation(self):
684
self.build_tree_contents([('old-tree/file', 'contents'),
685
('new-tree/file', 'contents')])
686
self.old_tree.add('file', 'file-id')
687
self.new_tree.add('file', 'file-id')
688
os.unlink('old-tree/file')
689
self.differ.show_diff(None)
690
self.assertContainsRe(self.differ.to_file.getvalue(), '\+contents')
692
def test_diff_symlink(self):
693
differ = diff.DiffSymlink(self.old_tree, self.new_tree, StringIO())
694
differ.diff_symlink('old target', None)
695
self.assertEqual("=== target was 'old target'\n",
696
differ.to_file.getvalue())
698
differ = diff.DiffSymlink(self.old_tree, self.new_tree, StringIO())
699
differ.diff_symlink(None, 'new target')
700
self.assertEqual("=== target is 'new target'\n",
701
differ.to_file.getvalue())
703
differ = diff.DiffSymlink(self.old_tree, self.new_tree, StringIO())
704
differ.diff_symlink('old target', 'new target')
705
self.assertEqual("=== target changed 'old target' => 'new target'\n",
706
differ.to_file.getvalue())
709
self.build_tree_contents([('old-tree/olddir/',),
710
('old-tree/olddir/oldfile', 'old\n')])
711
self.old_tree.add('olddir')
712
self.old_tree.add('olddir/oldfile', 'file-id')
713
self.build_tree_contents([('new-tree/newdir/',),
714
('new-tree/newdir/newfile', 'new\n')])
715
self.new_tree.add('newdir')
716
self.new_tree.add('newdir/newfile', 'file-id')
717
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
718
self.assertContainsRe(
719
self.differ.to_file.getvalue(),
720
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
721
' \@\@\n-old\n\+new\n\n')
723
def test_diff_kind_change(self):
724
self.requireFeature(tests.SymlinkFeature)
725
self.build_tree_contents([('old-tree/olddir/',),
726
('old-tree/olddir/oldfile', 'old\n')])
727
self.old_tree.add('olddir')
728
self.old_tree.add('olddir/oldfile', 'file-id')
729
self.build_tree(['new-tree/newdir/'])
730
os.symlink('new', 'new-tree/newdir/newfile')
731
self.new_tree.add('newdir')
732
self.new_tree.add('newdir/newfile', 'file-id')
733
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
734
self.assertContainsRe(
735
self.differ.to_file.getvalue(),
736
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+0,0'
738
self.assertContainsRe(self.differ.to_file.getvalue(),
739
"=== target is u'new'\n")
741
def test_diff_directory(self):
742
self.build_tree(['new-tree/new-dir/'])
743
self.new_tree.add('new-dir', 'new-dir-id')
744
self.differ.diff('new-dir-id', None, 'new-dir')
745
self.assertEqual(self.differ.to_file.getvalue(), '')
747
def create_old_new(self):
748
self.build_tree_contents([('old-tree/olddir/',),
749
('old-tree/olddir/oldfile', 'old\n')])
750
self.old_tree.add('olddir')
751
self.old_tree.add('olddir/oldfile', 'file-id')
752
self.build_tree_contents([('new-tree/newdir/',),
753
('new-tree/newdir/newfile', 'new\n')])
754
self.new_tree.add('newdir')
755
self.new_tree.add('newdir/newfile', 'file-id')
757
def test_register_diff(self):
758
self.create_old_new()
759
old_diff_factories = diff.DiffTree.diff_factories
760
diff.DiffTree.diff_factories=old_diff_factories[:]
761
diff.DiffTree.diff_factories.insert(0, DiffWasIs.from_diff_tree)
763
differ = diff.DiffTree(self.old_tree, self.new_tree, StringIO())
765
diff.DiffTree.diff_factories = old_diff_factories
766
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
767
self.assertNotContainsRe(
768
differ.to_file.getvalue(),
769
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
770
' \@\@\n-old\n\+new\n\n')
771
self.assertContainsRe(differ.to_file.getvalue(),
772
'was: old\nis: new\n')
774
def test_extra_factories(self):
775
self.create_old_new()
776
differ = diff.DiffTree(self.old_tree, self.new_tree, StringIO(),
777
extra_factories=[DiffWasIs.from_diff_tree])
778
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
779
self.assertNotContainsRe(
780
differ.to_file.getvalue(),
781
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
782
' \@\@\n-old\n\+new\n\n')
783
self.assertContainsRe(differ.to_file.getvalue(),
784
'was: old\nis: new\n')
786
def test_alphabetical_order(self):
787
self.build_tree(['new-tree/a-file'])
788
self.new_tree.add('a-file')
789
self.build_tree(['old-tree/b-file'])
790
self.old_tree.add('b-file')
791
self.differ.show_diff(None)
792
self.assertContainsRe(self.differ.to_file.getvalue(),
793
'.*a-file(.|\n)*b-file')
796
class TestPatienceDiffLib(tests.TestCase):
799
super(TestPatienceDiffLib, self).setUp()
800
self._unique_lcs = _patiencediff_py.unique_lcs_py
801
self._recurse_matches = _patiencediff_py.recurse_matches_py
802
self._PatienceSequenceMatcher = \
803
_patiencediff_py.PatienceSequenceMatcher_py
805
def test_diff_unicode_string(self):
806
a = ''.join([unichr(i) for i in range(4000, 4500, 3)])
807
b = ''.join([unichr(i) for i in range(4300, 4800, 2)])
808
sm = self._PatienceSequenceMatcher(None, a, b)
809
mb = sm.get_matching_blocks()
810
self.assertEquals(35, len(mb))
492
show_diff_trees(tree.basis_tree(), tree, diff_content)
493
diff = diff_content.getvalue()
494
self.assertContainsRe(diff, r"=== added file '%s'" % alpha_utf8)
495
self.assertContainsRe(
496
diff, "Binary files a/%s.*and b/%s.* differ\n" % (alpha_utf8, alpha_utf8))
497
self.assertContainsRe(diff, r"=== added file '%s'" % omega_utf8)
498
self.assertContainsRe(diff, r"--- a/%s" % (omega_utf8,))
499
self.assertContainsRe(diff, r"\+\+\+ b/%s" % (omega_utf8,))
502
class TestPatienceDiffLib(TestCase):
812
504
def test_unique_lcs(self):
813
unique_lcs = self._unique_lcs
505
unique_lcs = bzrlib.patiencediff.unique_lcs
814
506
self.assertEquals(unique_lcs('', ''), [])
815
self.assertEquals(unique_lcs('', 'a'), [])
816
self.assertEquals(unique_lcs('a', ''), [])
817
507
self.assertEquals(unique_lcs('a', 'a'), [(0,0)])
818
508
self.assertEquals(unique_lcs('a', 'b'), [])
819
509
self.assertEquals(unique_lcs('ab', 'ab'), [(0,0), (1,1)])
820
510
self.assertEquals(unique_lcs('abcde', 'cdeab'), [(2,0), (3,1), (4,2)])
821
511
self.assertEquals(unique_lcs('cdeab', 'abcde'), [(0,2), (1,3), (2,4)])
822
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
512
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
824
514
self.assertEquals(unique_lcs('acbac', 'abc'), [(2,1)])
826
516
def test_recurse_matches(self):
827
517
def test_one(a, b, matches):
828
518
test_matches = []
829
self._recurse_matches(
830
a, b, 0, 0, len(a), len(b), test_matches, 10)
519
bzrlib.patiencediff.recurse_matches(a, b, 0, 0, len(a), len(b),
831
521
self.assertEquals(test_matches, matches)
833
523
test_one(['a', '', 'b', '', 'c'], ['a', 'a', 'b', 'c', 'c'],
834
524
[(0, 0), (2, 2), (4, 4)])
835
525
test_one(['a', 'c', 'b', 'a', 'c'], ['a', 'b', 'c'],
836
526
[(0, 0), (2, 1), (4, 2)])
837
# Even though 'bc' is not unique globally, and is surrounded by
838
# non-matching lines, we should still match, because they are locally
840
test_one('abcdbce', 'afbcgdbce', [(0,0), (1, 2), (2, 3), (3, 5),
841
(4, 6), (5, 7), (6, 8)])
843
# recurse_matches doesn't match non-unique
528
# recurse_matches doesn't match non-unique
844
529
# lines surrounded by bogus text.
845
530
# The update has been done in patiencediff.SequenceMatcher instead
850
535
# This is what it currently gives:
851
536
test_one('aBccDe', 'abccde', [(0,0), (5,5)])
853
def assertDiffBlocks(self, a, b, expected_blocks):
854
"""Check that the sequence matcher returns the correct blocks.
856
:param a: A sequence to match
857
:param b: Another sequence to match
858
:param expected_blocks: The expected output, not including the final
859
matching block (len(a), len(b), 0)
861
matcher = self._PatienceSequenceMatcher(None, a, b)
862
blocks = matcher.get_matching_blocks()
864
self.assertEqual((len(a), len(b), 0), last)
865
self.assertEqual(expected_blocks, blocks)
867
538
def test_matching_blocks(self):
539
def chk_blocks(a, b, expected_blocks):
540
# difflib always adds a signature of the total
541
# length, with no matching entries at the end
542
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
543
blocks = s.get_matching_blocks()
544
self.assertEquals((len(a), len(b), 0), blocks[-1])
545
self.assertEquals(expected_blocks, blocks[:-1])
868
547
# Some basic matching tests
869
self.assertDiffBlocks('', '', [])
870
self.assertDiffBlocks([], [], [])
871
self.assertDiffBlocks('abc', '', [])
872
self.assertDiffBlocks('', 'abc', [])
873
self.assertDiffBlocks('abcd', 'abcd', [(0, 0, 4)])
874
self.assertDiffBlocks('abcd', 'abce', [(0, 0, 3)])
875
self.assertDiffBlocks('eabc', 'abce', [(1, 0, 3)])
876
self.assertDiffBlocks('eabce', 'abce', [(1, 0, 4)])
877
self.assertDiffBlocks('abcde', 'abXde', [(0, 0, 2), (3, 3, 2)])
878
self.assertDiffBlocks('abcde', 'abXYZde', [(0, 0, 2), (3, 5, 2)])
879
self.assertDiffBlocks('abde', 'abXYZde', [(0, 0, 2), (2, 5, 2)])
880
# This may check too much, but it checks to see that
548
chk_blocks('', '', [])
549
chk_blocks([], [], [])
550
chk_blocks('abcd', 'abcd', [(0, 0, 4)])
551
chk_blocks('abcd', 'abce', [(0, 0, 3)])
552
chk_blocks('eabc', 'abce', [(1, 0, 3)])
553
chk_blocks('eabce', 'abce', [(1, 0, 4)])
554
chk_blocks('abcde', 'abXde', [(0, 0, 2), (3, 3, 2)])
555
chk_blocks('abcde', 'abXYZde', [(0, 0, 2), (3, 5, 2)])
556
chk_blocks('abde', 'abXYZde', [(0, 0, 2), (2, 5, 2)])
557
# This may check too much, but it checks to see that
881
558
# a copied block stays attached to the previous section,
882
559
# not the later one.
883
560
# difflib would tend to grab the trailing longest match
884
561
# which would make the diff not look right
885
self.assertDiffBlocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
886
[(0, 0, 6), (6, 11, 10)])
562
chk_blocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
563
[(0, 0, 6), (6, 11, 10)])
888
565
# make sure it supports passing in lists
889
self.assertDiffBlocks(
890
567
['hello there\n',
892
569
'how are you today?\n'],
897
574
# non unique lines surrounded by non-matching lines
899
self.assertDiffBlocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
576
chk_blocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
901
578
# But they only need to be locally unique
902
self.assertDiffBlocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
579
chk_blocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
904
581
# non unique blocks won't be matched
905
self.assertDiffBlocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
582
chk_blocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
907
584
# but locally unique ones will
908
self.assertDiffBlocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
585
chk_blocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
909
586
(5,4,1), (7,5,2), (10,8,1)])
911
self.assertDiffBlocks('abbabbXd', 'cabbabxd', [(7,7,1)])
912
self.assertDiffBlocks('abbabbbb', 'cabbabbc', [])
913
self.assertDiffBlocks('bbbbbbbb', 'cbbbbbbc', [])
915
def test_matching_blocks_tuples(self):
916
# Some basic matching tests
917
self.assertDiffBlocks([], [], [])
918
self.assertDiffBlocks([('a',), ('b',), ('c,')], [], [])
919
self.assertDiffBlocks([], [('a',), ('b',), ('c,')], [])
920
self.assertDiffBlocks([('a',), ('b',), ('c,')],
921
[('a',), ('b',), ('c,')],
923
self.assertDiffBlocks([('a',), ('b',), ('c,')],
924
[('a',), ('b',), ('d,')],
926
self.assertDiffBlocks([('d',), ('b',), ('c,')],
927
[('a',), ('b',), ('c,')],
929
self.assertDiffBlocks([('d',), ('a',), ('b',), ('c,')],
930
[('a',), ('b',), ('c,')],
932
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
933
[('a', 'b'), ('c', 'X'), ('e', 'f')],
934
[(0, 0, 1), (2, 2, 1)])
935
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
936
[('a', 'b'), ('c', 'dX'), ('e', 'f')],
937
[(0, 0, 1), (2, 2, 1)])
588
chk_blocks('abbabbXd', 'cabbabxd', [(7,7,1)])
589
chk_blocks('abbabbbb', 'cabbabbc', [])
590
chk_blocks('bbbbbbbb', 'cbbbbbbc', [])
939
592
def test_opcodes(self):
940
593
def chk_ops(a, b, expected_codes):
941
s = self._PatienceSequenceMatcher(None, a, b)
594
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
942
595
self.assertEquals(expected_codes, s.get_opcodes())
944
597
chk_ops('', '', [])
945
598
chk_ops([], [], [])
946
chk_ops('abc', '', [('delete', 0,3, 0,0)])
947
chk_ops('', 'abc', [('insert', 0,0, 0,3)])
948
599
chk_ops('abcd', 'abcd', [('equal', 0,4, 0,4)])
949
600
chk_ops('abcd', 'abce', [('equal', 0,3, 0,3),
950
601
('replace', 3,4, 3,4)
1012
663
('equal', 10,11, 8,9)
1015
def test_grouped_opcodes(self):
1016
def chk_ops(a, b, expected_codes, n=3):
1017
s = self._PatienceSequenceMatcher(None, a, b)
1018
self.assertEquals(expected_codes, list(s.get_grouped_opcodes(n)))
1022
chk_ops('abc', '', [[('delete', 0,3, 0,0)]])
1023
chk_ops('', 'abc', [[('insert', 0,0, 0,3)]])
1024
chk_ops('abcd', 'abcd', [])
1025
chk_ops('abcd', 'abce', [[('equal', 0,3, 0,3),
1026
('replace', 3,4, 3,4)
1028
chk_ops('eabc', 'abce', [[('delete', 0,1, 0,0),
1029
('equal', 1,4, 0,3),
1030
('insert', 4,4, 3,4)
1032
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
1033
[[('equal', 3,6, 3,6),
1034
('insert', 6,6, 6,11),
1035
('equal', 6,9, 11,14)
1037
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
1038
[[('equal', 2,6, 2,6),
1039
('insert', 6,6, 6,11),
1040
('equal', 6,10, 11,15)
1042
chk_ops('Xabcdef', 'abcdef',
1043
[[('delete', 0,1, 0,0),
1046
chk_ops('abcdef', 'abcdefX',
1047
[[('equal', 3,6, 3,6),
1048
('insert', 6,6, 6,7)
1052
666
def test_multiple_ranges(self):
1053
667
# There was an earlier bug where we used a bad set of ranges,
1054
668
# this triggers that specific bug, to make sure it doesn't regress
1055
self.assertDiffBlocks('abcdefghijklmnop',
1056
'abcXghiYZQRSTUVWXYZijklmnop',
1057
[(0, 0, 3), (6, 4, 3), (9, 20, 7)])
1059
self.assertDiffBlocks('ABCd efghIjk L',
1060
'AxyzBCn mo pqrstuvwI1 2 L',
1061
[(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
669
def chk_blocks(a, b, expected_blocks):
670
# difflib always adds a signature of the total
671
# length, with no matching entries at the end
672
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
673
blocks = s.get_matching_blocks()
675
self.assertEquals(x, (len(a), len(b), 0))
676
self.assertEquals(expected_blocks, blocks)
678
chk_blocks('abcdefghijklmnop'
679
, 'abcXghiYZQRSTUVWXYZijklmnop'
680
, [(0, 0, 3), (6, 4, 3), (9, 20, 7)])
682
chk_blocks('ABCd efghIjk L'
683
, 'AxyzBCn mo pqrstuvwI1 2 L'
684
, [(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
1063
686
# These are rot13 code snippets.
1064
self.assertDiffBlocks('''\
1065
688
trg nqqrq jura lbh nqq n svyr va gur qverpgbel.
1067
690
gnxrf_netf = ['svyr*']
1068
691
gnxrf_bcgvbaf = ['ab-erphefr']
1070
693
qrs eha(frys, svyr_yvfg, ab_erphefr=Snyfr):
1071
694
sebz omeyvo.nqq vzcbeg fzneg_nqq, nqq_ercbegre_cevag, nqq_ercbegre_ahyy
1278
849
, list(unified_diff_files('a2', 'b2',
1279
850
sequencematcher=psm)))
1282
class TestPatienceDiffLibFiles_c(TestPatienceDiffLibFiles):
1284
_test_needs_features = [compiled_patiencediff_feature]
1287
super(TestPatienceDiffLibFiles_c, self).setUp()
1288
from bzrlib import _patiencediff_c
1289
self._PatienceSequenceMatcher = \
1290
_patiencediff_c.PatienceSequenceMatcher_c
1293
class TestUsingCompiledIfAvailable(tests.TestCase):
1295
def test_PatienceSequenceMatcher(self):
1296
if compiled_patiencediff_feature.available():
1297
from bzrlib._patiencediff_c import PatienceSequenceMatcher_c
1298
self.assertIs(PatienceSequenceMatcher_c,
1299
patiencediff.PatienceSequenceMatcher)
1301
from bzrlib._patiencediff_py import PatienceSequenceMatcher_py
1302
self.assertIs(PatienceSequenceMatcher_py,
1303
patiencediff.PatienceSequenceMatcher)
1305
def test_unique_lcs(self):
1306
if compiled_patiencediff_feature.available():
1307
from bzrlib._patiencediff_c import unique_lcs_c
1308
self.assertIs(unique_lcs_c,
1309
patiencediff.unique_lcs)
1311
from bzrlib._patiencediff_py import unique_lcs_py
1312
self.assertIs(unique_lcs_py,
1313
patiencediff.unique_lcs)
1315
def test_recurse_matches(self):
1316
if compiled_patiencediff_feature.available():
1317
from bzrlib._patiencediff_c import recurse_matches_c
1318
self.assertIs(recurse_matches_c,
1319
patiencediff.recurse_matches)
1321
from bzrlib._patiencediff_py import recurse_matches_py
1322
self.assertIs(recurse_matches_py,
1323
patiencediff.recurse_matches)
1326
class TestDiffFromTool(tests.TestCaseWithTransport):
1328
def test_from_string(self):
1329
diff_obj = diff.DiffFromTool.from_string('diff', None, None, None)
1330
self.addCleanup(diff_obj.finish)
1331
self.assertEqual(['diff', '@old_path', '@new_path'],
1332
diff_obj.command_template)
1334
def test_from_string_u5(self):
1335
diff_obj = diff.DiffFromTool.from_string('diff "-u 5"',
1337
self.addCleanup(diff_obj.finish)
1338
self.assertEqual(['diff', '-u 5', '@old_path', '@new_path'],
1339
diff_obj.command_template)
1340
self.assertEqual(['diff', '-u 5', 'old-path', 'new-path'],
1341
diff_obj._get_command('old-path', 'new-path'))
1343
def test_from_string_path_with_backslashes(self):
1344
self.requireFeature(features.backslashdir_feature)
1345
tool = 'C:\\Tools\\Diff.exe'
1346
diff_obj = diff.DiffFromTool.from_string(tool, None, None, None)
1347
self.addCleanup(diff_obj.finish)
1348
self.assertEqual(['C:\\Tools\\Diff.exe', '@old_path', '@new_path'],
1349
diff_obj.command_template)
1350
self.assertEqual(['C:\\Tools\\Diff.exe', 'old-path', 'new-path'],
1351
diff_obj._get_command('old-path', 'new-path'))
1353
def test_execute(self):
1355
diff_obj = diff.DiffFromTool(['python', '-c',
1356
'print "@old_path @new_path"'],
1358
self.addCleanup(diff_obj.finish)
1359
diff_obj._execute('old', 'new')
1360
self.assertEqual(output.getvalue().rstrip(), 'old new')
1362
def test_excute_missing(self):
1363
diff_obj = diff.DiffFromTool(['a-tool-which-is-unlikely-to-exist'],
1365
self.addCleanup(diff_obj.finish)
1366
e = self.assertRaises(errors.ExecutableMissing, diff_obj._execute,
1368
self.assertEqual('a-tool-which-is-unlikely-to-exist could not be found'
1369
' on this machine', str(e))
1371
def test_prepare_files_creates_paths_readable_by_windows_tool(self):
1372
self.requireFeature(AttribFeature)
1374
tree = self.make_branch_and_tree('tree')
1375
self.build_tree_contents([('tree/file', 'content')])
1376
tree.add('file', 'file-id')
1377
tree.commit('old tree')
1379
self.addCleanup(tree.unlock)
1380
basis_tree = tree.basis_tree()
1381
basis_tree.lock_read()
1382
self.addCleanup(basis_tree.unlock)
1383
diff_obj = diff.DiffFromTool(['python', '-c',
1384
'print "@old_path @new_path"'],
1385
basis_tree, tree, output)
1386
diff_obj._prepare_files('file-id', 'file', 'file')
1387
# The old content should be readonly
1388
self.assertReadableByAttrib(diff_obj._root, 'old\\file',
1390
# The new content should use the tree object, not a 'new' file anymore
1391
self.assertEndsWith(tree.basedir, 'work/tree')
1392
self.assertReadableByAttrib(tree.basedir, 'file', r'work\\tree\\file$')
1394
def assertReadableByAttrib(self, cwd, relpath, regex):
1395
proc = subprocess.Popen(['attrib', relpath],
1396
stdout=subprocess.PIPE,
1398
(result, err) = proc.communicate()
1399
self.assertContainsRe(result.replace('\r\n', '\n'), regex)
1401
def test_prepare_files(self):
1403
tree = self.make_branch_and_tree('tree')
1404
self.build_tree_contents([('tree/oldname', 'oldcontent')])
1405
self.build_tree_contents([('tree/oldname2', 'oldcontent2')])
1406
tree.add('oldname', 'file-id')
1407
tree.add('oldname2', 'file2-id')
1408
# Earliest allowable date on FAT32 filesystems is 1980-01-01
1409
tree.commit('old tree', timestamp=315532800)
1410
tree.rename_one('oldname', 'newname')
1411
tree.rename_one('oldname2', 'newname2')
1412
self.build_tree_contents([('tree/newname', 'newcontent')])
1413
self.build_tree_contents([('tree/newname2', 'newcontent2')])
1414
old_tree = tree.basis_tree()
1415
old_tree.lock_read()
1416
self.addCleanup(old_tree.unlock)
1418
self.addCleanup(tree.unlock)
1419
diff_obj = diff.DiffFromTool(['python', '-c',
1420
'print "@old_path @new_path"'],
1421
old_tree, tree, output)
1422
self.addCleanup(diff_obj.finish)
1423
self.assertContainsRe(diff_obj._root, 'bzr-diff-[^/]*')
1424
old_path, new_path = diff_obj._prepare_files('file-id', 'oldname',
1426
self.assertContainsRe(old_path, 'old/oldname$')
1427
self.assertEqual(315532800, os.stat(old_path).st_mtime)
1428
self.assertContainsRe(new_path, 'tree/newname$')
1429
self.assertFileEqual('oldcontent', old_path)
1430
self.assertFileEqual('newcontent', new_path)
1431
if osutils.host_os_dereferences_symlinks():
1432
self.assertTrue(os.path.samefile('tree/newname', new_path))
1433
# make sure we can create files with the same parent directories
1434
diff_obj._prepare_files('file2-id', 'oldname2', 'newname2')
1437
class TestGetTreesAndBranchesToDiffLocked(tests.TestCaseWithTransport):
1439
def call_gtabtd(self, path_list, revision_specs, old_url, new_url):
1440
"""Call get_trees_and_branches_to_diff_locked. Overridden by
1441
TestGetTreesAndBranchesToDiff.
1443
return diff.get_trees_and_branches_to_diff_locked(
1444
path_list, revision_specs, old_url, new_url, self.addCleanup)
1446
def test_basic(self):
1447
tree = self.make_branch_and_tree('tree')
1448
(old_tree, new_tree,
1449
old_branch, new_branch,
1450
specific_files, extra_trees) = self.call_gtabtd(
1451
['tree'], None, None, None)
1453
self.assertIsInstance(old_tree, revisiontree.RevisionTree)
1454
self.assertEqual(_mod_revision.NULL_REVISION,
1455
old_tree.get_revision_id())
1456
self.assertEqual(tree.basedir, new_tree.basedir)
1457
self.assertEqual(tree.branch.base, old_branch.base)
1458
self.assertEqual(tree.branch.base, new_branch.base)
1459
self.assertIs(None, specific_files)
1460
self.assertIs(None, extra_trees)
1462
def test_with_rev_specs(self):
1463
tree = self.make_branch_and_tree('tree')
1464
self.build_tree_contents([('tree/file', 'oldcontent')])
1465
tree.add('file', 'file-id')
1466
tree.commit('old tree', timestamp=0, rev_id="old-id")
1467
self.build_tree_contents([('tree/file', 'newcontent')])
1468
tree.commit('new tree', timestamp=0, rev_id="new-id")
1470
revisions = [revisionspec.RevisionSpec.from_string('1'),
1471
revisionspec.RevisionSpec.from_string('2')]
1472
(old_tree, new_tree,
1473
old_branch, new_branch,
1474
specific_files, extra_trees) = self.call_gtabtd(
1475
['tree'], revisions, None, None)
1477
self.assertIsInstance(old_tree, revisiontree.RevisionTree)
1478
self.assertEqual("old-id", old_tree.get_revision_id())
1479
self.assertIsInstance(new_tree, revisiontree.RevisionTree)
1480
self.assertEqual("new-id", new_tree.get_revision_id())
1481
self.assertEqual(tree.branch.base, old_branch.base)
1482
self.assertEqual(tree.branch.base, new_branch.base)
1483
self.assertIs(None, specific_files)
1484
self.assertEqual(tree.basedir, extra_trees[0].basedir)
1487
class TestGetTreesAndBranchesToDiff(TestGetTreesAndBranchesToDiffLocked):
1488
"""Apply the tests for get_trees_and_branches_to_diff_locked to the
1489
deprecated get_trees_and_branches_to_diff function.
1492
def call_gtabtd(self, path_list, revision_specs, old_url, new_url):
1493
return self.applyDeprecated(
1494
deprecated_in((2, 2, 0)), diff.get_trees_and_branches_to_diff,
1495
path_list, revision_specs, old_url, new_url)