479
464
tree.rename_one('file', 'newname')
480
465
self.build_tree_contents([('tree/newname', 'new contents\n')])
481
d = self.get_diff(tree.basis_tree(), tree)
482
self.assertContainsRe(d, "=== renamed file 'file' => 'newname'\n")
483
self.assertContainsRe(d, '--- old/file\t')
484
self.assertContainsRe(d, '\\+\\+\\+ new/newname\t')
485
self.assertContainsRe(d, '-contents\n'
489
def test_internal_diff_exec_property(self):
490
tree = self.make_branch_and_tree('tree')
492
tt = transform.TreeTransform(tree)
493
tt.new_file('a', tt.root, 'contents\n', 'a-id', True)
494
tt.new_file('b', tt.root, 'contents\n', 'b-id', False)
495
tt.new_file('c', tt.root, 'contents\n', 'c-id', True)
496
tt.new_file('d', tt.root, 'contents\n', 'd-id', False)
497
tt.new_file('e', tt.root, 'contents\n', 'control-e-id', True)
498
tt.new_file('f', tt.root, 'contents\n', 'control-f-id', False)
500
tree.commit('one', rev_id='rev-1')
502
tt = transform.TreeTransform(tree)
503
tt.set_executability(False, tt.trans_id_file_id('a-id'))
504
tt.set_executability(True, tt.trans_id_file_id('b-id'))
505
tt.set_executability(False, tt.trans_id_file_id('c-id'))
506
tt.set_executability(True, tt.trans_id_file_id('d-id'))
508
tree.rename_one('c', 'new-c')
509
tree.rename_one('d', 'new-d')
511
d = self.get_diff(tree.basis_tree(), tree)
513
self.assertContainsRe(d, r"file 'a'.*\(properties changed:"
515
self.assertContainsRe(d, r"file 'b'.*\(properties changed:"
517
self.assertContainsRe(d, r"file 'c'.*\(properties changed:"
519
self.assertContainsRe(d, r"file 'd'.*\(properties changed:"
521
self.assertNotContainsRe(d, r"file 'e'")
522
self.assertNotContainsRe(d, r"file 'f'")
466
diff = self.get_diff(tree.basis_tree(), tree)
467
self.assertContainsRe(diff, "=== renamed file 'file' => 'newname'\n")
468
self.assertContainsRe(diff, '--- old/file\t')
469
self.assertContainsRe(diff, '\\+\\+\\+ new/newname\t')
470
self.assertContainsRe(diff, '-contents\n'
525
473
def test_binary_unicode_filenames(self):
526
474
"""Test that contents of files are *not* encoded in UTF-8 when there
527
475
is a binary file in the diff.
529
477
# See https://bugs.launchpad.net/bugs/110092.
530
self.requireFeature(tests.UnicodeFilenameFeature)
478
self.requireFeature(UnicodeFilename)
532
480
# This bug isn't triggered with cStringIO.
533
481
from StringIO import StringIO
573
521
tree.add(['add_'+alpha], ['file-id'])
574
522
self.build_tree_contents([('tree/mod_'+alpha, 'contents_mod\n')])
576
d = self.get_diff(tree.basis_tree(), tree)
577
self.assertContainsRe(d,
524
diff = self.get_diff(tree.basis_tree(), tree)
525
self.assertContainsRe(diff,
578
526
"=== 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)
584
class DiffWasIs(diff.DiffPath):
586
def diff(self, file_id, old_path, new_path, old_kind, new_kind):
587
self.to_file.write('was: ')
588
self.to_file.write(self.old_tree.get_file(file_id).read())
589
self.to_file.write('is: ')
590
self.to_file.write(self.new_tree.get_file(file_id).read())
594
class TestDiffTree(tests.TestCaseWithTransport):
597
super(TestDiffTree, self).setUp()
598
self.old_tree = self.make_branch_and_tree('old-tree')
599
self.old_tree.lock_write()
600
self.addCleanup(self.old_tree.unlock)
601
self.new_tree = self.make_branch_and_tree('new-tree')
602
self.new_tree.lock_write()
603
self.addCleanup(self.new_tree.unlock)
604
self.differ = diff.DiffTree(self.old_tree, self.new_tree, StringIO())
606
def test_diff_text(self):
607
self.build_tree_contents([('old-tree/olddir/',),
608
('old-tree/olddir/oldfile', 'old\n')])
609
self.old_tree.add('olddir')
610
self.old_tree.add('olddir/oldfile', 'file-id')
611
self.build_tree_contents([('new-tree/newdir/',),
612
('new-tree/newdir/newfile', 'new\n')])
613
self.new_tree.add('newdir')
614
self.new_tree.add('newdir/newfile', 'file-id')
615
differ = diff.DiffText(self.old_tree, self.new_tree, StringIO())
616
differ.diff_text('file-id', None, 'old label', 'new label')
618
'--- old label\n+++ new label\n@@ -1,1 +0,0 @@\n-old\n\n',
619
differ.to_file.getvalue())
620
differ.to_file.seek(0)
621
differ.diff_text(None, 'file-id', 'old label', 'new label')
623
'--- old label\n+++ new label\n@@ -0,0 +1,1 @@\n+new\n\n',
624
differ.to_file.getvalue())
625
differ.to_file.seek(0)
626
differ.diff_text('file-id', 'file-id', 'old label', 'new label')
628
'--- old label\n+++ new label\n@@ -1,1 +1,1 @@\n-old\n+new\n\n',
629
differ.to_file.getvalue())
631
def test_diff_deletion(self):
632
self.build_tree_contents([('old-tree/file', 'contents'),
633
('new-tree/file', 'contents')])
634
self.old_tree.add('file', 'file-id')
635
self.new_tree.add('file', 'file-id')
636
os.unlink('new-tree/file')
637
self.differ.show_diff(None)
638
self.assertContainsRe(self.differ.to_file.getvalue(), '-contents')
640
def test_diff_creation(self):
641
self.build_tree_contents([('old-tree/file', 'contents'),
642
('new-tree/file', 'contents')])
643
self.old_tree.add('file', 'file-id')
644
self.new_tree.add('file', 'file-id')
645
os.unlink('old-tree/file')
646
self.differ.show_diff(None)
647
self.assertContainsRe(self.differ.to_file.getvalue(), '\+contents')
649
def test_diff_symlink(self):
650
differ = diff.DiffSymlink(self.old_tree, self.new_tree, StringIO())
651
differ.diff_symlink('old target', None)
652
self.assertEqual("=== target was 'old target'\n",
653
differ.to_file.getvalue())
655
differ = diff.DiffSymlink(self.old_tree, self.new_tree, StringIO())
656
differ.diff_symlink(None, 'new target')
657
self.assertEqual("=== target is 'new target'\n",
658
differ.to_file.getvalue())
660
differ = diff.DiffSymlink(self.old_tree, self.new_tree, StringIO())
661
differ.diff_symlink('old target', 'new target')
662
self.assertEqual("=== target changed 'old target' => 'new target'\n",
663
differ.to_file.getvalue())
666
self.build_tree_contents([('old-tree/olddir/',),
667
('old-tree/olddir/oldfile', 'old\n')])
668
self.old_tree.add('olddir')
669
self.old_tree.add('olddir/oldfile', 'file-id')
670
self.build_tree_contents([('new-tree/newdir/',),
671
('new-tree/newdir/newfile', 'new\n')])
672
self.new_tree.add('newdir')
673
self.new_tree.add('newdir/newfile', 'file-id')
674
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
675
self.assertContainsRe(
676
self.differ.to_file.getvalue(),
677
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
678
' \@\@\n-old\n\+new\n\n')
680
def test_diff_kind_change(self):
681
self.requireFeature(tests.SymlinkFeature)
682
self.build_tree_contents([('old-tree/olddir/',),
683
('old-tree/olddir/oldfile', 'old\n')])
684
self.old_tree.add('olddir')
685
self.old_tree.add('olddir/oldfile', 'file-id')
686
self.build_tree(['new-tree/newdir/'])
687
os.symlink('new', 'new-tree/newdir/newfile')
688
self.new_tree.add('newdir')
689
self.new_tree.add('newdir/newfile', 'file-id')
690
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
691
self.assertContainsRe(
692
self.differ.to_file.getvalue(),
693
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+0,0'
695
self.assertContainsRe(self.differ.to_file.getvalue(),
696
"=== target is u'new'\n")
698
def test_diff_directory(self):
699
self.build_tree(['new-tree/new-dir/'])
700
self.new_tree.add('new-dir', 'new-dir-id')
701
self.differ.diff('new-dir-id', None, 'new-dir')
702
self.assertEqual(self.differ.to_file.getvalue(), '')
704
def create_old_new(self):
705
self.build_tree_contents([('old-tree/olddir/',),
706
('old-tree/olddir/oldfile', 'old\n')])
707
self.old_tree.add('olddir')
708
self.old_tree.add('olddir/oldfile', 'file-id')
709
self.build_tree_contents([('new-tree/newdir/',),
710
('new-tree/newdir/newfile', 'new\n')])
711
self.new_tree.add('newdir')
712
self.new_tree.add('newdir/newfile', 'file-id')
714
def test_register_diff(self):
715
self.create_old_new()
716
old_diff_factories = diff.DiffTree.diff_factories
717
diff.DiffTree.diff_factories=old_diff_factories[:]
718
diff.DiffTree.diff_factories.insert(0, DiffWasIs.from_diff_tree)
720
differ = diff.DiffTree(self.old_tree, self.new_tree, StringIO())
722
diff.DiffTree.diff_factories = old_diff_factories
723
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
724
self.assertNotContainsRe(
725
differ.to_file.getvalue(),
726
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
727
' \@\@\n-old\n\+new\n\n')
728
self.assertContainsRe(differ.to_file.getvalue(),
729
'was: old\nis: new\n')
731
def test_extra_factories(self):
732
self.create_old_new()
733
differ = diff.DiffTree(self.old_tree, self.new_tree, StringIO(),
734
extra_factories=[DiffWasIs.from_diff_tree])
735
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
736
self.assertNotContainsRe(
737
differ.to_file.getvalue(),
738
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
739
' \@\@\n-old\n\+new\n\n')
740
self.assertContainsRe(differ.to_file.getvalue(),
741
'was: old\nis: new\n')
743
def test_alphabetical_order(self):
744
self.build_tree(['new-tree/a-file'])
745
self.new_tree.add('a-file')
746
self.build_tree(['old-tree/b-file'])
747
self.old_tree.add('b-file')
748
self.differ.show_diff(None)
749
self.assertContainsRe(self.differ.to_file.getvalue(),
750
'.*a-file(.|\n)*b-file')
753
class TestPatienceDiffLib(tests.TestCase):
756
super(TestPatienceDiffLib, self).setUp()
757
self._unique_lcs = _patiencediff_py.unique_lcs_py
758
self._recurse_matches = _patiencediff_py.recurse_matches_py
759
self._PatienceSequenceMatcher = \
760
_patiencediff_py.PatienceSequenceMatcher_py
762
def test_diff_unicode_string(self):
763
a = ''.join([unichr(i) for i in range(4000, 4500, 3)])
764
b = ''.join([unichr(i) for i in range(4300, 4800, 2)])
765
sm = self._PatienceSequenceMatcher(None, a, b)
766
mb = sm.get_matching_blocks()
767
self.assertEquals(35, len(mb))
527
self.assertContainsRe(diff, "=== added file 'add_%s'"%autf8)
528
self.assertContainsRe(diff, "=== modified file 'mod_%s'"%autf8)
529
self.assertContainsRe(diff, "=== removed file 'del_%s'"%autf8)
531
class TestPatienceDiffLib(TestCase):
769
533
def test_unique_lcs(self):
770
unique_lcs = self._unique_lcs
534
unique_lcs = bzrlib.patiencediff.unique_lcs
771
535
self.assertEquals(unique_lcs('', ''), [])
772
self.assertEquals(unique_lcs('', 'a'), [])
773
self.assertEquals(unique_lcs('a', ''), [])
774
536
self.assertEquals(unique_lcs('a', 'a'), [(0,0)])
775
537
self.assertEquals(unique_lcs('a', 'b'), [])
776
538
self.assertEquals(unique_lcs('ab', 'ab'), [(0,0), (1,1)])
777
539
self.assertEquals(unique_lcs('abcde', 'cdeab'), [(2,0), (3,1), (4,2)])
778
540
self.assertEquals(unique_lcs('cdeab', 'abcde'), [(0,2), (1,3), (2,4)])
779
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
541
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
781
543
self.assertEquals(unique_lcs('acbac', 'abc'), [(2,1)])
783
545
def test_recurse_matches(self):
784
546
def test_one(a, b, matches):
785
547
test_matches = []
786
self._recurse_matches(
787
a, b, 0, 0, len(a), len(b), test_matches, 10)
548
bzrlib.patiencediff.recurse_matches(a, b, 0, 0, len(a), len(b),
788
550
self.assertEquals(test_matches, matches)
790
552
test_one(['a', '', 'b', '', 'c'], ['a', 'a', 'b', 'c', 'c'],
791
553
[(0, 0), (2, 2), (4, 4)])
792
554
test_one(['a', 'c', 'b', 'a', 'c'], ['a', 'b', 'c'],
793
555
[(0, 0), (2, 1), (4, 2)])
794
# Even though 'bc' is not unique globally, and is surrounded by
795
# non-matching lines, we should still match, because they are locally
797
test_one('abcdbce', 'afbcgdbce', [(0,0), (1, 2), (2, 3), (3, 5),
798
(4, 6), (5, 7), (6, 8)])
800
# recurse_matches doesn't match non-unique
557
# recurse_matches doesn't match non-unique
801
558
# lines surrounded by bogus text.
802
559
# The update has been done in patiencediff.SequenceMatcher instead
807
564
# This is what it currently gives:
808
565
test_one('aBccDe', 'abccde', [(0,0), (5,5)])
810
def assertDiffBlocks(self, a, b, expected_blocks):
811
"""Check that the sequence matcher returns the correct blocks.
813
:param a: A sequence to match
814
:param b: Another sequence to match
815
:param expected_blocks: The expected output, not including the final
816
matching block (len(a), len(b), 0)
818
matcher = self._PatienceSequenceMatcher(None, a, b)
819
blocks = matcher.get_matching_blocks()
821
self.assertEqual((len(a), len(b), 0), last)
822
self.assertEqual(expected_blocks, blocks)
824
567
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])
825
576
# Some basic matching tests
826
self.assertDiffBlocks('', '', [])
827
self.assertDiffBlocks([], [], [])
828
self.assertDiffBlocks('abc', '', [])
829
self.assertDiffBlocks('', 'abc', [])
830
self.assertDiffBlocks('abcd', 'abcd', [(0, 0, 4)])
831
self.assertDiffBlocks('abcd', 'abce', [(0, 0, 3)])
832
self.assertDiffBlocks('eabc', 'abce', [(1, 0, 3)])
833
self.assertDiffBlocks('eabce', 'abce', [(1, 0, 4)])
834
self.assertDiffBlocks('abcde', 'abXde', [(0, 0, 2), (3, 3, 2)])
835
self.assertDiffBlocks('abcde', 'abXYZde', [(0, 0, 2), (3, 5, 2)])
836
self.assertDiffBlocks('abde', 'abXYZde', [(0, 0, 2), (2, 5, 2)])
837
# This may check too much, but it checks to see that
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
838
587
# a copied block stays attached to the previous section,
839
588
# not the later one.
840
589
# difflib would tend to grab the trailing longest match
841
590
# which would make the diff not look right
842
self.assertDiffBlocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
843
[(0, 0, 6), (6, 11, 10)])
591
chk_blocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
592
[(0, 0, 6), (6, 11, 10)])
845
594
# make sure it supports passing in lists
846
self.assertDiffBlocks(
847
596
['hello there\n',
849
598
'how are you today?\n'],
854
603
# non unique lines surrounded by non-matching lines
856
self.assertDiffBlocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
605
chk_blocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
858
607
# But they only need to be locally unique
859
self.assertDiffBlocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
608
chk_blocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
861
610
# non unique blocks won't be matched
862
self.assertDiffBlocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
611
chk_blocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
864
613
# but locally unique ones will
865
self.assertDiffBlocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
614
chk_blocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
866
615
(5,4,1), (7,5,2), (10,8,1)])
868
self.assertDiffBlocks('abbabbXd', 'cabbabxd', [(7,7,1)])
869
self.assertDiffBlocks('abbabbbb', 'cabbabbc', [])
870
self.assertDiffBlocks('bbbbbbbb', 'cbbbbbbc', [])
872
def test_matching_blocks_tuples(self):
873
# Some basic matching tests
874
self.assertDiffBlocks([], [], [])
875
self.assertDiffBlocks([('a',), ('b',), ('c,')], [], [])
876
self.assertDiffBlocks([], [('a',), ('b',), ('c,')], [])
877
self.assertDiffBlocks([('a',), ('b',), ('c,')],
878
[('a',), ('b',), ('c,')],
880
self.assertDiffBlocks([('a',), ('b',), ('c,')],
881
[('a',), ('b',), ('d,')],
883
self.assertDiffBlocks([('d',), ('b',), ('c,')],
884
[('a',), ('b',), ('c,')],
886
self.assertDiffBlocks([('d',), ('a',), ('b',), ('c,')],
887
[('a',), ('b',), ('c,')],
889
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
890
[('a', 'b'), ('c', 'X'), ('e', 'f')],
891
[(0, 0, 1), (2, 2, 1)])
892
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
893
[('a', 'b'), ('c', 'dX'), ('e', 'f')],
894
[(0, 0, 1), (2, 2, 1)])
617
chk_blocks('abbabbXd', 'cabbabxd', [(7,7,1)])
618
chk_blocks('abbabbbb', 'cabbabbc', [])
619
chk_blocks('bbbbbbbb', 'cbbbbbbc', [])
896
621
def test_opcodes(self):
897
622
def chk_ops(a, b, expected_codes):
898
s = self._PatienceSequenceMatcher(None, a, b)
623
s = bzrlib.patiencediff.PatienceSequenceMatcher(None, a, b)
899
624
self.assertEquals(expected_codes, s.get_opcodes())
901
626
chk_ops('', '', [])
902
627
chk_ops([], [], [])
903
chk_ops('abc', '', [('delete', 0,3, 0,0)])
904
chk_ops('', 'abc', [('insert', 0,0, 0,3)])
905
628
chk_ops('abcd', 'abcd', [('equal', 0,4, 0,4)])
906
629
chk_ops('abcd', 'abce', [('equal', 0,3, 0,3),
907
630
('replace', 3,4, 3,4)
969
692
('equal', 10,11, 8,9)
972
def test_grouped_opcodes(self):
973
def chk_ops(a, b, expected_codes, n=3):
974
s = self._PatienceSequenceMatcher(None, a, b)
975
self.assertEquals(expected_codes, list(s.get_grouped_opcodes(n)))
979
chk_ops('abc', '', [[('delete', 0,3, 0,0)]])
980
chk_ops('', 'abc', [[('insert', 0,0, 0,3)]])
981
chk_ops('abcd', 'abcd', [])
982
chk_ops('abcd', 'abce', [[('equal', 0,3, 0,3),
983
('replace', 3,4, 3,4)
985
chk_ops('eabc', 'abce', [[('delete', 0,1, 0,0),
989
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
990
[[('equal', 3,6, 3,6),
991
('insert', 6,6, 6,11),
992
('equal', 6,9, 11,14)
994
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
995
[[('equal', 2,6, 2,6),
996
('insert', 6,6, 6,11),
997
('equal', 6,10, 11,15)
999
chk_ops('Xabcdef', 'abcdef',
1000
[[('delete', 0,1, 0,0),
1003
chk_ops('abcdef', 'abcdefX',
1004
[[('equal', 3,6, 3,6),
1005
('insert', 6,6, 6,7)
1009
695
def test_multiple_ranges(self):
1010
696
# There was an earlier bug where we used a bad set of ranges,
1011
697
# this triggers that specific bug, to make sure it doesn't regress
1012
self.assertDiffBlocks('abcdefghijklmnop',
1013
'abcXghiYZQRSTUVWXYZijklmnop',
1014
[(0, 0, 3), (6, 4, 3), (9, 20, 7)])
1016
self.assertDiffBlocks('ABCd efghIjk L',
1017
'AxyzBCn mo pqrstuvwI1 2 L',
1018
[(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
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)])
1020
715
# These are rot13 code snippets.
1021
self.assertDiffBlocks('''\
1022
717
trg nqqrq jura lbh nqq n svyr va gur qverpgbel.
1024
719
gnxrf_netf = ['svyr*']
1025
720
gnxrf_bcgvbaf = ['ab-erphefr']
1027
722
qrs eha(frys, svyr_yvfg, ab_erphefr=Snyfr):
1028
723
sebz omeyvo.nqq vzcbeg fzneg_nqq, nqq_ercbegre_cevag, nqq_ercbegre_ahyy
1235
878
, list(unified_diff_files('a2', 'b2',
1236
879
sequencematcher=psm)))
1239
class TestPatienceDiffLibFiles_c(TestPatienceDiffLibFiles):
1241
_test_needs_features = [compiled_patiencediff_feature]
1244
super(TestPatienceDiffLibFiles_c, self).setUp()
1245
from bzrlib import _patiencediff_c
1246
self._PatienceSequenceMatcher = \
1247
_patiencediff_c.PatienceSequenceMatcher_c
1250
class TestUsingCompiledIfAvailable(tests.TestCase):
1252
def test_PatienceSequenceMatcher(self):
1253
if compiled_patiencediff_feature.available():
1254
from bzrlib._patiencediff_c import PatienceSequenceMatcher_c
1255
self.assertIs(PatienceSequenceMatcher_c,
1256
patiencediff.PatienceSequenceMatcher)
1258
from bzrlib._patiencediff_py import PatienceSequenceMatcher_py
1259
self.assertIs(PatienceSequenceMatcher_py,
1260
patiencediff.PatienceSequenceMatcher)
1262
def test_unique_lcs(self):
1263
if compiled_patiencediff_feature.available():
1264
from bzrlib._patiencediff_c import unique_lcs_c
1265
self.assertIs(unique_lcs_c,
1266
patiencediff.unique_lcs)
1268
from bzrlib._patiencediff_py import unique_lcs_py
1269
self.assertIs(unique_lcs_py,
1270
patiencediff.unique_lcs)
1272
def test_recurse_matches(self):
1273
if compiled_patiencediff_feature.available():
1274
from bzrlib._patiencediff_c import recurse_matches_c
1275
self.assertIs(recurse_matches_c,
1276
patiencediff.recurse_matches)
1278
from bzrlib._patiencediff_py import recurse_matches_py
1279
self.assertIs(recurse_matches_py,
1280
patiencediff.recurse_matches)
1283
class TestDiffFromTool(tests.TestCaseWithTransport):
1285
def test_from_string(self):
1286
diff_obj = diff.DiffFromTool.from_string('diff', None, None, None)
1287
self.addCleanup(diff_obj.finish)
1288
self.assertEqual(['diff', '@old_path', '@new_path'],
1289
diff_obj.command_template)
1291
def test_from_string_u5(self):
1292
diff_obj = diff.DiffFromTool.from_string('diff "-u 5"',
1294
self.addCleanup(diff_obj.finish)
1295
self.assertEqual(['diff', '-u 5', '@old_path', '@new_path'],
1296
diff_obj.command_template)
1297
self.assertEqual(['diff', '-u 5', 'old-path', 'new-path'],
1298
diff_obj._get_command('old-path', 'new-path'))
1300
def test_from_string_path_with_backslashes(self):
1301
self.requireFeature(test_win32utils.BackslashDirSeparatorFeature)
1302
tool = 'C:\\Tools\\Diff.exe'
1303
diff_obj = diff.DiffFromTool.from_string(tool, None, None, None)
1304
self.addCleanup(diff_obj.finish)
1305
self.assertEqual(['C:\\Tools\\Diff.exe', '@old_path', '@new_path'],
1306
diff_obj.command_template)
1307
self.assertEqual(['C:\\Tools\\Diff.exe', 'old-path', 'new-path'],
1308
diff_obj._get_command('old-path', 'new-path'))
1310
def test_execute(self):
1312
diff_obj = diff.DiffFromTool(['python', '-c',
1313
'print "@old_path @new_path"'],
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 = diff.DiffFromTool(['a-tool-which-is-unlikely-to-exist'],
1322
self.addCleanup(diff_obj.finish)
1323
e = self.assertRaises(errors.ExecutableMissing, diff_obj._execute,
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
basis_tree = tree.basis_tree()
1338
basis_tree.lock_read()
1339
self.addCleanup(basis_tree.unlock)
1340
diff_obj = diff.DiffFromTool(['python', '-c',
1341
'print "@old_path @new_path"'],
1342
basis_tree, tree, output)
1343
diff_obj._prepare_files('file-id', 'file', 'file')
1344
# The old content should be readonly
1345
self.assertReadableByAttrib(diff_obj._root, 'old\\file',
1347
# The new content should use the tree object, not a 'new' file anymore
1348
self.assertEndsWith(tree.basedir, 'work/tree')
1349
self.assertReadableByAttrib(tree.basedir, 'file', r'work\\tree\\file$')
1351
def assertReadableByAttrib(self, cwd, relpath, regex):
1352
proc = subprocess.Popen(['attrib', relpath],
1353
stdout=subprocess.PIPE,
1355
(result, err) = proc.communicate()
1356
self.assertContainsRe(result.replace('\r\n', '\n'), regex)
1358
def test_prepare_files(self):
1360
tree = self.make_branch_and_tree('tree')
1361
self.build_tree_contents([('tree/oldname', 'oldcontent')])
1362
self.build_tree_contents([('tree/oldname2', 'oldcontent2')])
1363
tree.add('oldname', 'file-id')
1364
tree.add('oldname2', 'file2-id')
1365
# Earliest allowable date on FAT32 filesystems is 1980-01-01
1366
tree.commit('old tree', timestamp=315532800)
1367
tree.rename_one('oldname', 'newname')
1368
tree.rename_one('oldname2', 'newname2')
1369
self.build_tree_contents([('tree/newname', 'newcontent')])
1370
self.build_tree_contents([('tree/newname2', 'newcontent2')])
1371
old_tree = tree.basis_tree()
1372
old_tree.lock_read()
1373
self.addCleanup(old_tree.unlock)
1375
self.addCleanup(tree.unlock)
1376
diff_obj = diff.DiffFromTool(['python', '-c',
1377
'print "@old_path @new_path"'],
1378
old_tree, tree, output)
1379
self.addCleanup(diff_obj.finish)
1380
self.assertContainsRe(diff_obj._root, 'bzr-diff-[^/]*')
1381
old_path, new_path = diff_obj._prepare_files('file-id', 'oldname',
1383
self.assertContainsRe(old_path, 'old/oldname$')
1384
self.assertEqual(315532800, os.stat(old_path).st_mtime)
1385
self.assertContainsRe(new_path, 'tree/newname$')
1386
self.assertFileEqual('oldcontent', old_path)
1387
self.assertFileEqual('newcontent', new_path)
1388
if osutils.host_os_dereferences_symlinks():
1389
self.assertTrue(os.path.samefile('tree/newname', new_path))
1390
# make sure we can create files with the same parent directories
1391
diff_obj._prepare_files('file2-id', 'oldname2', 'newname2')
1394
class TestGetTreesAndBranchesToDiffLocked(tests.TestCaseWithTransport):
1396
def call_gtabtd(self, path_list, revision_specs, old_url, new_url):
1397
"""Call get_trees_and_branches_to_diff_locked. Overridden by
1398
TestGetTreesAndBranchesToDiff.
1400
return diff.get_trees_and_branches_to_diff_locked(
1401
path_list, revision_specs, old_url, new_url, self.addCleanup)
1403
def test_basic(self):
1404
tree = self.make_branch_and_tree('tree')
1405
(old_tree, new_tree,
1406
old_branch, new_branch,
1407
specific_files, extra_trees) = self.call_gtabtd(
1408
['tree'], None, None, None)
1410
self.assertIsInstance(old_tree, revisiontree.RevisionTree)
1411
self.assertEqual(_mod_revision.NULL_REVISION,
1412
old_tree.get_revision_id())
1413
self.assertEqual(tree.basedir, new_tree.basedir)
1414
self.assertEqual(tree.branch.base, old_branch.base)
1415
self.assertEqual(tree.branch.base, new_branch.base)
1416
self.assertIs(None, specific_files)
1417
self.assertIs(None, extra_trees)
1419
def test_with_rev_specs(self):
1420
tree = self.make_branch_and_tree('tree')
1421
self.build_tree_contents([('tree/file', 'oldcontent')])
1422
tree.add('file', 'file-id')
1423
tree.commit('old tree', timestamp=0, rev_id="old-id")
1424
self.build_tree_contents([('tree/file', 'newcontent')])
1425
tree.commit('new tree', timestamp=0, rev_id="new-id")
1427
revisions = [revisionspec.RevisionSpec.from_string('1'),
1428
revisionspec.RevisionSpec.from_string('2')]
1429
(old_tree, new_tree,
1430
old_branch, new_branch,
1431
specific_files, extra_trees) = self.call_gtabtd(
1432
['tree'], revisions, None, None)
1434
self.assertIsInstance(old_tree, revisiontree.RevisionTree)
1435
self.assertEqual("old-id", old_tree.get_revision_id())
1436
self.assertIsInstance(new_tree, revisiontree.RevisionTree)
1437
self.assertEqual("new-id", new_tree.get_revision_id())
1438
self.assertEqual(tree.branch.base, old_branch.base)
1439
self.assertEqual(tree.branch.base, new_branch.base)
1440
self.assertIs(None, specific_files)
1441
self.assertEqual(tree.basedir, extra_trees[0].basedir)
1444
class TestGetTreesAndBranchesToDiff(TestGetTreesAndBranchesToDiffLocked):
1445
"""Apply the tests for get_trees_and_branches_to_diff_locked to the
1446
deprecated get_trees_and_branches_to_diff function.
1449
def call_gtabtd(self, path_list, revision_specs, old_url, new_url):
1450
return self.applyDeprecated(
1451
deprecated_in((2, 2, 0)), diff.get_trees_and_branches_to_diff,
1452
path_list, revision_specs, old_url, new_url)