1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
|
# Copyright (C) 2005-2010 Canonical Ltd
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
import os
import os.path
from cStringIO import StringIO
import errno
import subprocess
import sys
from tempfile import TemporaryFile
from bzrlib import tests
from bzrlib.diff import (
DiffFromTool,
DiffPath,
DiffSymlink,
DiffTree,
DiffText,
external_diff,
internal_diff,
show_diff_trees,
get_trees_and_branches_to_diff,
)
from bzrlib.errors import BinaryFile, NoDiff, ExecutableMissing
import bzrlib.osutils as osutils
import bzrlib.revision as _mod_revision
import bzrlib.transform as transform
import bzrlib.patiencediff
import bzrlib._patiencediff_py
from bzrlib.tests import (Feature, TestCase, TestCaseWithTransport,
TestCaseInTempDir, TestSkipped)
from bzrlib.revisiontree import RevisionTree
from bzrlib.revisionspec import RevisionSpec
from bzrlib.tests.test_win32utils import BackslashDirSeparatorFeature
class _AttribFeature(Feature):
def _probe(self):
if (sys.platform not in ('cygwin', 'win32')):
return False
try:
proc = subprocess.Popen(['attrib', '.'], stdout=subprocess.PIPE)
except OSError, e:
return False
return (0 == proc.wait())
def feature_name(self):
return 'attrib Windows command-line tool'
AttribFeature = _AttribFeature()
compiled_patiencediff_feature = tests.ModuleAvailableFeature(
'bzrlib._patiencediff_c')
def udiff_lines(old, new, allow_binary=False):
output = StringIO()
internal_diff('old', old, 'new', new, output, allow_binary)
output.seek(0, 0)
return output.readlines()
def external_udiff_lines(old, new, use_stringio=False):
if use_stringio:
# StringIO has no fileno, so it tests a different codepath
output = StringIO()
else:
output = TemporaryFile()
try:
external_diff('old', old, 'new', new, output, diff_opts=['-u'])
except NoDiff:
raise TestSkipped('external "diff" not present to test')
output.seek(0, 0)
lines = output.readlines()
output.close()
return lines
class TestDiff(TestCase):
def test_add_nl(self):
"""diff generates a valid diff for patches that add a newline"""
lines = udiff_lines(['boo'], ['boo\n'])
self.check_patch(lines)
self.assertEquals(lines[4], '\\ No newline at end of file\n')
## "expected no-nl, got %r" % lines[4]
def test_add_nl_2(self):
"""diff generates a valid diff for patches that change last line and
add a newline.
"""
lines = udiff_lines(['boo'], ['goo\n'])
self.check_patch(lines)
self.assertEquals(lines[4], '\\ No newline at end of file\n')
## "expected no-nl, got %r" % lines[4]
def test_remove_nl(self):
"""diff generates a valid diff for patches that change last line and
add a newline.
"""
lines = udiff_lines(['boo\n'], ['boo'])
self.check_patch(lines)
self.assertEquals(lines[5], '\\ No newline at end of file\n')
## "expected no-nl, got %r" % lines[5]
def check_patch(self, lines):
self.assert_(len(lines) > 1)
## "Not enough lines for a file header for patch:\n%s" % "".join(lines)
self.assert_(lines[0].startswith ('---'))
## 'No orig line for patch:\n%s' % "".join(lines)
self.assert_(lines[1].startswith ('+++'))
## 'No mod line for patch:\n%s' % "".join(lines)
self.assert_(len(lines) > 2)
## "No hunks for patch:\n%s" % "".join(lines)
self.assert_(lines[2].startswith('@@'))
## "No hunk header for patch:\n%s" % "".join(lines)
self.assert_('@@' in lines[2][2:])
## "Unterminated hunk header for patch:\n%s" % "".join(lines)
def test_binary_lines(self):
self.assertRaises(BinaryFile, udiff_lines, [1023 * 'a' + '\x00'], [])
self.assertRaises(BinaryFile, udiff_lines, [], [1023 * 'a' + '\x00'])
udiff_lines([1023 * 'a' + '\x00'], [], allow_binary=True)
udiff_lines([], [1023 * 'a' + '\x00'], allow_binary=True)
def test_external_diff(self):
lines = external_udiff_lines(['boo\n'], ['goo\n'])
self.check_patch(lines)
self.assertEqual('\n', lines[-1])
def test_external_diff_no_fileno(self):
# Make sure that we can handle not having a fileno, even
# if the diff is large
lines = external_udiff_lines(['boo\n']*10000,
['goo\n']*10000,
use_stringio=True)
self.check_patch(lines)
def test_external_diff_binary_lang_c(self):
old_env = {}
for lang in ('LANG', 'LC_ALL', 'LANGUAGE'):
old_env[lang] = osutils.set_or_unset_env(lang, 'C')
try:
lines = external_udiff_lines(['\x00foobar\n'], ['foo\x00bar\n'])
# Older versions of diffutils say "Binary files", newer
# versions just say "Files".
self.assertContainsRe(lines[0],
'(Binary f|F)iles old and new differ\n')
self.assertEquals(lines[1:], ['\n'])
finally:
for lang, old_val in old_env.iteritems():
osutils.set_or_unset_env(lang, old_val)
def test_no_external_diff(self):
"""Check that NoDiff is raised when diff is not available"""
# Use os.environ['PATH'] to make sure no 'diff' command is available
orig_path = os.environ['PATH']
try:
os.environ['PATH'] = ''
self.assertRaises(NoDiff, external_diff,
'old', ['boo\n'], 'new', ['goo\n'],
StringIO(), diff_opts=['-u'])
finally:
os.environ['PATH'] = orig_path
def test_internal_diff_default(self):
# Default internal diff encoding is utf8
output = StringIO()
internal_diff(u'old_\xb5', ['old_text\n'],
u'new_\xe5', ['new_text\n'], output)
lines = output.getvalue().splitlines(True)
self.check_patch(lines)
self.assertEquals(['--- old_\xc2\xb5\n',
'+++ new_\xc3\xa5\n',
'@@ -1,1 +1,1 @@\n',
'-old_text\n',
'+new_text\n',
'\n',
]
, lines)
def test_internal_diff_utf8(self):
output = StringIO()
internal_diff(u'old_\xb5', ['old_text\n'],
u'new_\xe5', ['new_text\n'], output,
path_encoding='utf8')
lines = output.getvalue().splitlines(True)
self.check_patch(lines)
self.assertEquals(['--- old_\xc2\xb5\n',
'+++ new_\xc3\xa5\n',
'@@ -1,1 +1,1 @@\n',
'-old_text\n',
'+new_text\n',
'\n',
]
, lines)
def test_internal_diff_iso_8859_1(self):
output = StringIO()
internal_diff(u'old_\xb5', ['old_text\n'],
u'new_\xe5', ['new_text\n'], output,
path_encoding='iso-8859-1')
lines = output.getvalue().splitlines(True)
self.check_patch(lines)
self.assertEquals(['--- old_\xb5\n',
'+++ new_\xe5\n',
'@@ -1,1 +1,1 @@\n',
'-old_text\n',
'+new_text\n',
'\n',
]
, lines)
def test_internal_diff_no_content(self):
output = StringIO()
internal_diff(u'old', [], u'new', [], output)
self.assertEqual('', output.getvalue())
def test_internal_diff_no_changes(self):
output = StringIO()
internal_diff(u'old', ['text\n', 'contents\n'],
u'new', ['text\n', 'contents\n'],
output)
self.assertEqual('', output.getvalue())
def test_internal_diff_returns_bytes(self):
import StringIO
output = StringIO.StringIO()
internal_diff(u'old_\xb5', ['old_text\n'],
u'new_\xe5', ['new_text\n'], output)
self.failUnless(isinstance(output.getvalue(), str),
'internal_diff should return bytestrings')
class TestDiffFiles(TestCaseInTempDir):
def test_external_diff_binary(self):
"""The output when using external diff should use diff's i18n error"""
# Make sure external_diff doesn't fail in the current LANG
lines = external_udiff_lines(['\x00foobar\n'], ['foo\x00bar\n'])
cmd = ['diff', '-u', '--binary', 'old', 'new']
open('old', 'wb').write('\x00foobar\n')
open('new', 'wb').write('foo\x00bar\n')
pipe = subprocess.Popen(cmd, stdout=subprocess.PIPE,
stdin=subprocess.PIPE)
out, err = pipe.communicate()
# Diff returns '2' on Binary files.
self.assertEqual(2, pipe.returncode)
# We should output whatever diff tells us, plus a trailing newline
self.assertEqual(out.splitlines(True) + ['\n'], lines)
class TestShowDiffTreesHelper(TestCaseWithTransport):
"""Has a helper for running show_diff_trees"""
def get_diff(self, tree1, tree2, specific_files=None, working_tree=None):
output = StringIO()
if working_tree is not None:
extra_trees = (working_tree,)
else:
extra_trees = ()
show_diff_trees(tree1, tree2, output, specific_files=specific_files,
extra_trees=extra_trees, old_label='old/',
new_label='new/')
return output.getvalue()
class TestDiffDates(TestShowDiffTreesHelper):
def setUp(self):
super(TestDiffDates, self).setUp()
self.wt = self.make_branch_and_tree('.')
self.b = self.wt.branch
self.build_tree_contents([
('file1', 'file1 contents at rev 1\n'),
('file2', 'file2 contents at rev 1\n')
])
self.wt.add(['file1', 'file2'])
self.wt.commit(
message='Revision 1',
timestamp=1143849600, # 2006-04-01 00:00:00 UTC
timezone=0,
rev_id='rev-1')
self.build_tree_contents([('file1', 'file1 contents at rev 2\n')])
self.wt.commit(
message='Revision 2',
timestamp=1143936000, # 2006-04-02 00:00:00 UTC
timezone=28800,
rev_id='rev-2')
self.build_tree_contents([('file2', 'file2 contents at rev 3\n')])
self.wt.commit(
message='Revision 3',
timestamp=1144022400, # 2006-04-03 00:00:00 UTC
timezone=-3600,
rev_id='rev-3')
self.wt.remove(['file2'])
self.wt.commit(
message='Revision 4',
timestamp=1144108800, # 2006-04-04 00:00:00 UTC
timezone=0,
rev_id='rev-4')
self.build_tree_contents([
('file1', 'file1 contents in working tree\n')
])
# set the date stamps for files in the working tree to known values
os.utime('file1', (1144195200, 1144195200)) # 2006-04-05 00:00:00 UTC
def test_diff_rev_tree_working_tree(self):
output = self.get_diff(self.wt.basis_tree(), self.wt)
# note that the date for old/file1 is from rev 2 rather than from
# the basis revision (rev 4)
self.assertEqualDiff(output, '''\
=== modified file 'file1'
--- old/file1\t2006-04-02 00:00:00 +0000
+++ new/file1\t2006-04-05 00:00:00 +0000
@@ -1,1 +1,1 @@
-file1 contents at rev 2
+file1 contents in working tree
''')
def test_diff_rev_tree_rev_tree(self):
tree1 = self.b.repository.revision_tree('rev-2')
tree2 = self.b.repository.revision_tree('rev-3')
output = self.get_diff(tree1, tree2)
self.assertEqualDiff(output, '''\
=== modified file 'file2'
--- old/file2\t2006-04-01 00:00:00 +0000
+++ new/file2\t2006-04-03 00:00:00 +0000
@@ -1,1 +1,1 @@
-file2 contents at rev 1
+file2 contents at rev 3
''')
def test_diff_add_files(self):
tree1 = self.b.repository.revision_tree(_mod_revision.NULL_REVISION)
tree2 = self.b.repository.revision_tree('rev-1')
output = self.get_diff(tree1, tree2)
# the files have the epoch time stamp for the tree in which
# they don't exist.
self.assertEqualDiff(output, '''\
=== added file 'file1'
--- old/file1\t1970-01-01 00:00:00 +0000
+++ new/file1\t2006-04-01 00:00:00 +0000
@@ -0,0 +1,1 @@
+file1 contents at rev 1
=== added file 'file2'
--- old/file2\t1970-01-01 00:00:00 +0000
+++ new/file2\t2006-04-01 00:00:00 +0000
@@ -0,0 +1,1 @@
+file2 contents at rev 1
''')
def test_diff_remove_files(self):
tree1 = self.b.repository.revision_tree('rev-3')
tree2 = self.b.repository.revision_tree('rev-4')
output = self.get_diff(tree1, tree2)
# the file has the epoch time stamp for the tree in which
# it doesn't exist.
self.assertEqualDiff(output, '''\
=== removed file 'file2'
--- old/file2\t2006-04-03 00:00:00 +0000
+++ new/file2\t1970-01-01 00:00:00 +0000
@@ -1,1 +0,0 @@
-file2 contents at rev 3
''')
def test_show_diff_specified(self):
"""A working tree filename can be used to identify a file"""
self.wt.rename_one('file1', 'file1b')
old_tree = self.b.repository.revision_tree('rev-1')
new_tree = self.b.repository.revision_tree('rev-4')
out = self.get_diff(old_tree, new_tree, specific_files=['file1b'],
working_tree=self.wt)
self.assertContainsRe(out, 'file1\t')
def test_recursive_diff(self):
"""Children of directories are matched"""
os.mkdir('dir1')
os.mkdir('dir2')
self.wt.add(['dir1', 'dir2'])
self.wt.rename_one('file1', 'dir1/file1')
old_tree = self.b.repository.revision_tree('rev-1')
new_tree = self.b.repository.revision_tree('rev-4')
out = self.get_diff(old_tree, new_tree, specific_files=['dir1'],
working_tree=self.wt)
self.assertContainsRe(out, 'file1\t')
out = self.get_diff(old_tree, new_tree, specific_files=['dir2'],
working_tree=self.wt)
self.assertNotContainsRe(out, 'file1\t')
class TestShowDiffTrees(TestShowDiffTreesHelper):
"""Direct tests for show_diff_trees"""
def test_modified_file(self):
"""Test when a file is modified."""
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/file', 'contents\n')])
tree.add(['file'], ['file-id'])
tree.commit('one', rev_id='rev-1')
self.build_tree_contents([('tree/file', 'new contents\n')])
diff = self.get_diff(tree.basis_tree(), tree)
self.assertContainsRe(diff, "=== modified file 'file'\n")
self.assertContainsRe(diff, '--- old/file\t')
self.assertContainsRe(diff, '\\+\\+\\+ new/file\t')
self.assertContainsRe(diff, '-contents\n'
'\\+new contents\n')
def test_modified_file_in_renamed_dir(self):
"""Test when a file is modified in a renamed directory."""
tree = self.make_branch_and_tree('tree')
self.build_tree(['tree/dir/'])
self.build_tree_contents([('tree/dir/file', 'contents\n')])
tree.add(['dir', 'dir/file'], ['dir-id', 'file-id'])
tree.commit('one', rev_id='rev-1')
tree.rename_one('dir', 'other')
self.build_tree_contents([('tree/other/file', 'new contents\n')])
diff = self.get_diff(tree.basis_tree(), tree)
self.assertContainsRe(diff, "=== renamed directory 'dir' => 'other'\n")
self.assertContainsRe(diff, "=== modified file 'other/file'\n")
# XXX: This is technically incorrect, because it used to be at another
# location. What to do?
self.assertContainsRe(diff, '--- old/dir/file\t')
self.assertContainsRe(diff, '\\+\\+\\+ new/other/file\t')
self.assertContainsRe(diff, '-contents\n'
'\\+new contents\n')
def test_renamed_directory(self):
"""Test when only a directory is only renamed."""
tree = self.make_branch_and_tree('tree')
self.build_tree(['tree/dir/'])
self.build_tree_contents([('tree/dir/file', 'contents\n')])
tree.add(['dir', 'dir/file'], ['dir-id', 'file-id'])
tree.commit('one', rev_id='rev-1')
tree.rename_one('dir', 'newdir')
diff = self.get_diff(tree.basis_tree(), tree)
# Renaming a directory should be a single "you renamed this dir" even
# when there are files inside.
self.assertEqual("=== renamed directory 'dir' => 'newdir'\n", diff)
def test_renamed_file(self):
"""Test when a file is only renamed."""
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/file', 'contents\n')])
tree.add(['file'], ['file-id'])
tree.commit('one', rev_id='rev-1')
tree.rename_one('file', 'newname')
diff = self.get_diff(tree.basis_tree(), tree)
self.assertContainsRe(diff, "=== renamed file 'file' => 'newname'\n")
# We shouldn't have a --- or +++ line, because there is no content
# change
self.assertNotContainsRe(diff, '---')
def test_renamed_and_modified_file(self):
"""Test when a file is only renamed."""
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/file', 'contents\n')])
tree.add(['file'], ['file-id'])
tree.commit('one', rev_id='rev-1')
tree.rename_one('file', 'newname')
self.build_tree_contents([('tree/newname', 'new contents\n')])
diff = self.get_diff(tree.basis_tree(), tree)
self.assertContainsRe(diff, "=== renamed file 'file' => 'newname'\n")
self.assertContainsRe(diff, '--- old/file\t')
self.assertContainsRe(diff, '\\+\\+\\+ new/newname\t')
self.assertContainsRe(diff, '-contents\n'
'\\+new contents\n')
def test_internal_diff_exec_property(self):
tree = self.make_branch_and_tree('tree')
tt = transform.TreeTransform(tree)
tt.new_file('a', tt.root, 'contents\n', 'a-id', True)
tt.new_file('b', tt.root, 'contents\n', 'b-id', False)
tt.new_file('c', tt.root, 'contents\n', 'c-id', True)
tt.new_file('d', tt.root, 'contents\n', 'd-id', False)
tt.new_file('e', tt.root, 'contents\n', 'control-e-id', True)
tt.new_file('f', tt.root, 'contents\n', 'control-f-id', False)
tt.apply()
tree.commit('one', rev_id='rev-1')
tt = transform.TreeTransform(tree)
tt.set_executability(False, tt.trans_id_file_id('a-id'))
tt.set_executability(True, tt.trans_id_file_id('b-id'))
tt.set_executability(False, tt.trans_id_file_id('c-id'))
tt.set_executability(True, tt.trans_id_file_id('d-id'))
tt.apply()
tree.rename_one('c', 'new-c')
tree.rename_one('d', 'new-d')
diff = self.get_diff(tree.basis_tree(), tree)
self.assertContainsRe(diff, r"file 'a'.*\(properties changed:.*\+x to -x.*\)")
self.assertContainsRe(diff, r"file 'b'.*\(properties changed:.*-x to \+x.*\)")
self.assertContainsRe(diff, r"file 'c'.*\(properties changed:.*\+x to -x.*\)")
self.assertContainsRe(diff, r"file 'd'.*\(properties changed:.*-x to \+x.*\)")
self.assertNotContainsRe(diff, r"file 'e'")
self.assertNotContainsRe(diff, r"file 'f'")
def test_binary_unicode_filenames(self):
"""Test that contents of files are *not* encoded in UTF-8 when there
is a binary file in the diff.
"""
# See https://bugs.launchpad.net/bugs/110092.
self.requireFeature(tests.UnicodeFilenameFeature)
# This bug isn't triggered with cStringIO.
from StringIO import StringIO
tree = self.make_branch_and_tree('tree')
alpha, omega = u'\u03b1', u'\u03c9'
alpha_utf8, omega_utf8 = alpha.encode('utf8'), omega.encode('utf8')
self.build_tree_contents(
[('tree/' + alpha, chr(0)),
('tree/' + omega,
('The %s and the %s\n' % (alpha_utf8, omega_utf8)))])
tree.add([alpha], ['file-id'])
tree.add([omega], ['file-id-2'])
diff_content = StringIO()
show_diff_trees(tree.basis_tree(), tree, diff_content)
diff = diff_content.getvalue()
self.assertContainsRe(diff, r"=== added file '%s'" % alpha_utf8)
self.assertContainsRe(
diff, "Binary files a/%s.*and b/%s.* differ\n" % (alpha_utf8, alpha_utf8))
self.assertContainsRe(diff, r"=== added file '%s'" % omega_utf8)
self.assertContainsRe(diff, r"--- a/%s" % (omega_utf8,))
self.assertContainsRe(diff, r"\+\+\+ b/%s" % (omega_utf8,))
def test_unicode_filename(self):
"""Test when the filename are unicode."""
self.requireFeature(tests.UnicodeFilenameFeature)
alpha, omega = u'\u03b1', u'\u03c9'
autf8, outf8 = alpha.encode('utf8'), omega.encode('utf8')
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/ren_'+alpha, 'contents\n')])
tree.add(['ren_'+alpha], ['file-id-2'])
self.build_tree_contents([('tree/del_'+alpha, 'contents\n')])
tree.add(['del_'+alpha], ['file-id-3'])
self.build_tree_contents([('tree/mod_'+alpha, 'contents\n')])
tree.add(['mod_'+alpha], ['file-id-4'])
tree.commit('one', rev_id='rev-1')
tree.rename_one('ren_'+alpha, 'ren_'+omega)
tree.remove('del_'+alpha)
self.build_tree_contents([('tree/add_'+alpha, 'contents\n')])
tree.add(['add_'+alpha], ['file-id'])
self.build_tree_contents([('tree/mod_'+alpha, 'contents_mod\n')])
diff = self.get_diff(tree.basis_tree(), tree)
self.assertContainsRe(diff,
"=== renamed file 'ren_%s' => 'ren_%s'\n"%(autf8, outf8))
self.assertContainsRe(diff, "=== added file 'add_%s'"%autf8)
self.assertContainsRe(diff, "=== modified file 'mod_%s'"%autf8)
self.assertContainsRe(diff, "=== removed file 'del_%s'"%autf8)
class DiffWasIs(DiffPath):
def diff(self, file_id, old_path, new_path, old_kind, new_kind):
self.to_file.write('was: ')
self.to_file.write(self.old_tree.get_file(file_id).read())
self.to_file.write('is: ')
self.to_file.write(self.new_tree.get_file(file_id).read())
pass
class TestDiffTree(TestCaseWithTransport):
def setUp(self):
TestCaseWithTransport.setUp(self)
self.old_tree = self.make_branch_and_tree('old-tree')
self.old_tree.lock_write()
self.addCleanup(self.old_tree.unlock)
self.new_tree = self.make_branch_and_tree('new-tree')
self.new_tree.lock_write()
self.addCleanup(self.new_tree.unlock)
self.differ = DiffTree(self.old_tree, self.new_tree, StringIO())
def test_diff_text(self):
self.build_tree_contents([('old-tree/olddir/',),
('old-tree/olddir/oldfile', 'old\n')])
self.old_tree.add('olddir')
self.old_tree.add('olddir/oldfile', 'file-id')
self.build_tree_contents([('new-tree/newdir/',),
('new-tree/newdir/newfile', 'new\n')])
self.new_tree.add('newdir')
self.new_tree.add('newdir/newfile', 'file-id')
differ = DiffText(self.old_tree, self.new_tree, StringIO())
differ.diff_text('file-id', None, 'old label', 'new label')
self.assertEqual(
'--- old label\n+++ new label\n@@ -1,1 +0,0 @@\n-old\n\n',
differ.to_file.getvalue())
differ.to_file.seek(0)
differ.diff_text(None, 'file-id', 'old label', 'new label')
self.assertEqual(
'--- old label\n+++ new label\n@@ -0,0 +1,1 @@\n+new\n\n',
differ.to_file.getvalue())
differ.to_file.seek(0)
differ.diff_text('file-id', 'file-id', 'old label', 'new label')
self.assertEqual(
'--- old label\n+++ new label\n@@ -1,1 +1,1 @@\n-old\n+new\n\n',
differ.to_file.getvalue())
def test_diff_deletion(self):
self.build_tree_contents([('old-tree/file', 'contents'),
('new-tree/file', 'contents')])
self.old_tree.add('file', 'file-id')
self.new_tree.add('file', 'file-id')
os.unlink('new-tree/file')
self.differ.show_diff(None)
self.assertContainsRe(self.differ.to_file.getvalue(), '-contents')
def test_diff_creation(self):
self.build_tree_contents([('old-tree/file', 'contents'),
('new-tree/file', 'contents')])
self.old_tree.add('file', 'file-id')
self.new_tree.add('file', 'file-id')
os.unlink('old-tree/file')
self.differ.show_diff(None)
self.assertContainsRe(self.differ.to_file.getvalue(), '\+contents')
def test_diff_symlink(self):
differ = DiffSymlink(self.old_tree, self.new_tree, StringIO())
differ.diff_symlink('old target', None)
self.assertEqual("=== target was 'old target'\n",
differ.to_file.getvalue())
differ = DiffSymlink(self.old_tree, self.new_tree, StringIO())
differ.diff_symlink(None, 'new target')
self.assertEqual("=== target is 'new target'\n",
differ.to_file.getvalue())
differ = DiffSymlink(self.old_tree, self.new_tree, StringIO())
differ.diff_symlink('old target', 'new target')
self.assertEqual("=== target changed 'old target' => 'new target'\n",
differ.to_file.getvalue())
def test_diff(self):
self.build_tree_contents([('old-tree/olddir/',),
('old-tree/olddir/oldfile', 'old\n')])
self.old_tree.add('olddir')
self.old_tree.add('olddir/oldfile', 'file-id')
self.build_tree_contents([('new-tree/newdir/',),
('new-tree/newdir/newfile', 'new\n')])
self.new_tree.add('newdir')
self.new_tree.add('newdir/newfile', 'file-id')
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
self.assertContainsRe(
self.differ.to_file.getvalue(),
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
' \@\@\n-old\n\+new\n\n')
def test_diff_kind_change(self):
self.requireFeature(tests.SymlinkFeature)
self.build_tree_contents([('old-tree/olddir/',),
('old-tree/olddir/oldfile', 'old\n')])
self.old_tree.add('olddir')
self.old_tree.add('olddir/oldfile', 'file-id')
self.build_tree(['new-tree/newdir/'])
os.symlink('new', 'new-tree/newdir/newfile')
self.new_tree.add('newdir')
self.new_tree.add('newdir/newfile', 'file-id')
self.differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
self.assertContainsRe(
self.differ.to_file.getvalue(),
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+0,0'
' \@\@\n-old\n\n')
self.assertContainsRe(self.differ.to_file.getvalue(),
"=== target is u'new'\n")
def test_diff_directory(self):
self.build_tree(['new-tree/new-dir/'])
self.new_tree.add('new-dir', 'new-dir-id')
self.differ.diff('new-dir-id', None, 'new-dir')
self.assertEqual(self.differ.to_file.getvalue(), '')
def create_old_new(self):
self.build_tree_contents([('old-tree/olddir/',),
('old-tree/olddir/oldfile', 'old\n')])
self.old_tree.add('olddir')
self.old_tree.add('olddir/oldfile', 'file-id')
self.build_tree_contents([('new-tree/newdir/',),
('new-tree/newdir/newfile', 'new\n')])
self.new_tree.add('newdir')
self.new_tree.add('newdir/newfile', 'file-id')
def test_register_diff(self):
self.create_old_new()
old_diff_factories = DiffTree.diff_factories
DiffTree.diff_factories=old_diff_factories[:]
DiffTree.diff_factories.insert(0, DiffWasIs.from_diff_tree)
try:
differ = DiffTree(self.old_tree, self.new_tree, StringIO())
finally:
DiffTree.diff_factories = old_diff_factories
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
self.assertNotContainsRe(
differ.to_file.getvalue(),
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
' \@\@\n-old\n\+new\n\n')
self.assertContainsRe(differ.to_file.getvalue(),
'was: old\nis: new\n')
def test_extra_factories(self):
self.create_old_new()
differ = DiffTree(self.old_tree, self.new_tree, StringIO(),
extra_factories=[DiffWasIs.from_diff_tree])
differ.diff('file-id', 'olddir/oldfile', 'newdir/newfile')
self.assertNotContainsRe(
differ.to_file.getvalue(),
r'--- olddir/oldfile.*\n\+\+\+ newdir/newfile.*\n\@\@ -1,1 \+1,1'
' \@\@\n-old\n\+new\n\n')
self.assertContainsRe(differ.to_file.getvalue(),
'was: old\nis: new\n')
def test_alphabetical_order(self):
self.build_tree(['new-tree/a-file'])
self.new_tree.add('a-file')
self.build_tree(['old-tree/b-file'])
self.old_tree.add('b-file')
self.differ.show_diff(None)
self.assertContainsRe(self.differ.to_file.getvalue(),
'.*a-file(.|\n)*b-file')
class TestPatienceDiffLib(TestCase):
def setUp(self):
super(TestPatienceDiffLib, self).setUp()
self._unique_lcs = bzrlib._patiencediff_py.unique_lcs_py
self._recurse_matches = bzrlib._patiencediff_py.recurse_matches_py
self._PatienceSequenceMatcher = \
bzrlib._patiencediff_py.PatienceSequenceMatcher_py
def test_diff_unicode_string(self):
a = ''.join([unichr(i) for i in range(4000, 4500, 3)])
b = ''.join([unichr(i) for i in range(4300, 4800, 2)])
sm = self._PatienceSequenceMatcher(None, a, b)
mb = sm.get_matching_blocks()
self.assertEquals(35, len(mb))
def test_unique_lcs(self):
unique_lcs = self._unique_lcs
self.assertEquals(unique_lcs('', ''), [])
self.assertEquals(unique_lcs('', 'a'), [])
self.assertEquals(unique_lcs('a', ''), [])
self.assertEquals(unique_lcs('a', 'a'), [(0,0)])
self.assertEquals(unique_lcs('a', 'b'), [])
self.assertEquals(unique_lcs('ab', 'ab'), [(0,0), (1,1)])
self.assertEquals(unique_lcs('abcde', 'cdeab'), [(2,0), (3,1), (4,2)])
self.assertEquals(unique_lcs('cdeab', 'abcde'), [(0,2), (1,3), (2,4)])
self.assertEquals(unique_lcs('abXde', 'abYde'), [(0,0), (1,1),
(3,3), (4,4)])
self.assertEquals(unique_lcs('acbac', 'abc'), [(2,1)])
def test_recurse_matches(self):
def test_one(a, b, matches):
test_matches = []
self._recurse_matches(
a, b, 0, 0, len(a), len(b), test_matches, 10)
self.assertEquals(test_matches, matches)
test_one(['a', '', 'b', '', 'c'], ['a', 'a', 'b', 'c', 'c'],
[(0, 0), (2, 2), (4, 4)])
test_one(['a', 'c', 'b', 'a', 'c'], ['a', 'b', 'c'],
[(0, 0), (2, 1), (4, 2)])
# Even though 'bc' is not unique globally, and is surrounded by
# non-matching lines, we should still match, because they are locally
# unique
test_one('abcdbce', 'afbcgdbce', [(0,0), (1, 2), (2, 3), (3, 5),
(4, 6), (5, 7), (6, 8)])
# recurse_matches doesn't match non-unique
# lines surrounded by bogus text.
# The update has been done in patiencediff.SequenceMatcher instead
# This is what it could be
#test_one('aBccDe', 'abccde', [(0,0), (2,2), (3,3), (5,5)])
# This is what it currently gives:
test_one('aBccDe', 'abccde', [(0,0), (5,5)])
def assertDiffBlocks(self, a, b, expected_blocks):
"""Check that the sequence matcher returns the correct blocks.
:param a: A sequence to match
:param b: Another sequence to match
:param expected_blocks: The expected output, not including the final
matching block (len(a), len(b), 0)
"""
matcher = self._PatienceSequenceMatcher(None, a, b)
blocks = matcher.get_matching_blocks()
last = blocks.pop()
self.assertEqual((len(a), len(b), 0), last)
self.assertEqual(expected_blocks, blocks)
def test_matching_blocks(self):
# Some basic matching tests
self.assertDiffBlocks('', '', [])
self.assertDiffBlocks([], [], [])
self.assertDiffBlocks('abc', '', [])
self.assertDiffBlocks('', 'abc', [])
self.assertDiffBlocks('abcd', 'abcd', [(0, 0, 4)])
self.assertDiffBlocks('abcd', 'abce', [(0, 0, 3)])
self.assertDiffBlocks('eabc', 'abce', [(1, 0, 3)])
self.assertDiffBlocks('eabce', 'abce', [(1, 0, 4)])
self.assertDiffBlocks('abcde', 'abXde', [(0, 0, 2), (3, 3, 2)])
self.assertDiffBlocks('abcde', 'abXYZde', [(0, 0, 2), (3, 5, 2)])
self.assertDiffBlocks('abde', 'abXYZde', [(0, 0, 2), (2, 5, 2)])
# This may check too much, but it checks to see that
# a copied block stays attached to the previous section,
# not the later one.
# difflib would tend to grab the trailing longest match
# which would make the diff not look right
self.assertDiffBlocks('abcdefghijklmnop', 'abcdefxydefghijklmnop',
[(0, 0, 6), (6, 11, 10)])
# make sure it supports passing in lists
self.assertDiffBlocks(
['hello there\n',
'world\n',
'how are you today?\n'],
['hello there\n',
'how are you today?\n'],
[(0, 0, 1), (2, 1, 1)])
# non unique lines surrounded by non-matching lines
# won't be found
self.assertDiffBlocks('aBccDe', 'abccde', [(0,0,1), (5,5,1)])
# But they only need to be locally unique
self.assertDiffBlocks('aBcDec', 'abcdec', [(0,0,1), (2,2,1), (4,4,2)])
# non unique blocks won't be matched
self.assertDiffBlocks('aBcdEcdFg', 'abcdecdfg', [(0,0,1), (8,8,1)])
# but locally unique ones will
self.assertDiffBlocks('aBcdEeXcdFg', 'abcdecdfg', [(0,0,1), (2,2,2),
(5,4,1), (7,5,2), (10,8,1)])
self.assertDiffBlocks('abbabbXd', 'cabbabxd', [(7,7,1)])
self.assertDiffBlocks('abbabbbb', 'cabbabbc', [])
self.assertDiffBlocks('bbbbbbbb', 'cbbbbbbc', [])
def test_matching_blocks_tuples(self):
# Some basic matching tests
self.assertDiffBlocks([], [], [])
self.assertDiffBlocks([('a',), ('b',), ('c,')], [], [])
self.assertDiffBlocks([], [('a',), ('b',), ('c,')], [])
self.assertDiffBlocks([('a',), ('b',), ('c,')],
[('a',), ('b',), ('c,')],
[(0, 0, 3)])
self.assertDiffBlocks([('a',), ('b',), ('c,')],
[('a',), ('b',), ('d,')],
[(0, 0, 2)])
self.assertDiffBlocks([('d',), ('b',), ('c,')],
[('a',), ('b',), ('c,')],
[(1, 1, 2)])
self.assertDiffBlocks([('d',), ('a',), ('b',), ('c,')],
[('a',), ('b',), ('c,')],
[(1, 0, 3)])
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
[('a', 'b'), ('c', 'X'), ('e', 'f')],
[(0, 0, 1), (2, 2, 1)])
self.assertDiffBlocks([('a', 'b'), ('c', 'd'), ('e', 'f')],
[('a', 'b'), ('c', 'dX'), ('e', 'f')],
[(0, 0, 1), (2, 2, 1)])
def test_opcodes(self):
def chk_ops(a, b, expected_codes):
s = self._PatienceSequenceMatcher(None, a, b)
self.assertEquals(expected_codes, s.get_opcodes())
chk_ops('', '', [])
chk_ops([], [], [])
chk_ops('abc', '', [('delete', 0,3, 0,0)])
chk_ops('', 'abc', [('insert', 0,0, 0,3)])
chk_ops('abcd', 'abcd', [('equal', 0,4, 0,4)])
chk_ops('abcd', 'abce', [('equal', 0,3, 0,3),
('replace', 3,4, 3,4)
])
chk_ops('eabc', 'abce', [('delete', 0,1, 0,0),
('equal', 1,4, 0,3),
('insert', 4,4, 3,4)
])
chk_ops('eabce', 'abce', [('delete', 0,1, 0,0),
('equal', 1,5, 0,4)
])
chk_ops('abcde', 'abXde', [('equal', 0,2, 0,2),
('replace', 2,3, 2,3),
('equal', 3,5, 3,5)
])
chk_ops('abcde', 'abXYZde', [('equal', 0,2, 0,2),
('replace', 2,3, 2,5),
('equal', 3,5, 5,7)
])
chk_ops('abde', 'abXYZde', [('equal', 0,2, 0,2),
('insert', 2,2, 2,5),
('equal', 2,4, 5,7)
])
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
[('equal', 0,6, 0,6),
('insert', 6,6, 6,11),
('equal', 6,16, 11,21)
])
chk_ops(
[ 'hello there\n'
, 'world\n'
, 'how are you today?\n'],
[ 'hello there\n'
, 'how are you today?\n'],
[('equal', 0,1, 0,1),
('delete', 1,2, 1,1),
('equal', 2,3, 1,2),
])
chk_ops('aBccDe', 'abccde',
[('equal', 0,1, 0,1),
('replace', 1,5, 1,5),
('equal', 5,6, 5,6),
])
chk_ops('aBcDec', 'abcdec',
[('equal', 0,1, 0,1),
('replace', 1,2, 1,2),
('equal', 2,3, 2,3),
('replace', 3,4, 3,4),
('equal', 4,6, 4,6),
])
chk_ops('aBcdEcdFg', 'abcdecdfg',
[('equal', 0,1, 0,1),
('replace', 1,8, 1,8),
('equal', 8,9, 8,9)
])
chk_ops('aBcdEeXcdFg', 'abcdecdfg',
[('equal', 0,1, 0,1),
('replace', 1,2, 1,2),
('equal', 2,4, 2,4),
('delete', 4,5, 4,4),
('equal', 5,6, 4,5),
('delete', 6,7, 5,5),
('equal', 7,9, 5,7),
('replace', 9,10, 7,8),
('equal', 10,11, 8,9)
])
def test_grouped_opcodes(self):
def chk_ops(a, b, expected_codes, n=3):
s = self._PatienceSequenceMatcher(None, a, b)
self.assertEquals(expected_codes, list(s.get_grouped_opcodes(n)))
chk_ops('', '', [])
chk_ops([], [], [])
chk_ops('abc', '', [[('delete', 0,3, 0,0)]])
chk_ops('', 'abc', [[('insert', 0,0, 0,3)]])
chk_ops('abcd', 'abcd', [])
chk_ops('abcd', 'abce', [[('equal', 0,3, 0,3),
('replace', 3,4, 3,4)
]])
chk_ops('eabc', 'abce', [[('delete', 0,1, 0,0),
('equal', 1,4, 0,3),
('insert', 4,4, 3,4)
]])
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
[[('equal', 3,6, 3,6),
('insert', 6,6, 6,11),
('equal', 6,9, 11,14)
]])
chk_ops('abcdefghijklmnop', 'abcdefxydefghijklmnop',
[[('equal', 2,6, 2,6),
('insert', 6,6, 6,11),
('equal', 6,10, 11,15)
]], 4)
chk_ops('Xabcdef', 'abcdef',
[[('delete', 0,1, 0,0),
('equal', 1,4, 0,3)
]])
chk_ops('abcdef', 'abcdefX',
[[('equal', 3,6, 3,6),
('insert', 6,6, 6,7)
]])
def test_multiple_ranges(self):
# There was an earlier bug where we used a bad set of ranges,
# this triggers that specific bug, to make sure it doesn't regress
self.assertDiffBlocks('abcdefghijklmnop',
'abcXghiYZQRSTUVWXYZijklmnop',
[(0, 0, 3), (6, 4, 3), (9, 20, 7)])
self.assertDiffBlocks('ABCd efghIjk L',
'AxyzBCn mo pqrstuvwI1 2 L',
[(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
# These are rot13 code snippets.
self.assertDiffBlocks('''\
trg nqqrq jura lbh nqq n svyr va gur qverpgbel.
"""
gnxrf_netf = ['svyr*']
gnxrf_bcgvbaf = ['ab-erphefr']
qrs eha(frys, svyr_yvfg, ab_erphefr=Snyfr):
sebz omeyvo.nqq vzcbeg fzneg_nqq, nqq_ercbegre_cevag, nqq_ercbegre_ahyy
vs vf_dhvrg():
ercbegre = nqq_ercbegre_ahyy
ryfr:
ercbegre = nqq_ercbegre_cevag
fzneg_nqq(svyr_yvfg, abg ab_erphefr, ercbegre)
pynff pzq_zxqve(Pbzznaq):
'''.splitlines(True), '''\
trg nqqrq jura lbh nqq n svyr va gur qverpgbel.
--qel-eha jvyy fubj juvpu svyrf jbhyq or nqqrq, ohg abg npghnyyl
nqq gurz.
"""
gnxrf_netf = ['svyr*']
gnxrf_bcgvbaf = ['ab-erphefr', 'qel-eha']
qrs eha(frys, svyr_yvfg, ab_erphefr=Snyfr, qel_eha=Snyfr):
vzcbeg omeyvo.nqq
vs qel_eha:
vs vf_dhvrg():
# Guvf vf cbvagyrff, ohg V'q engure abg envfr na reebe
npgvba = omeyvo.nqq.nqq_npgvba_ahyy
ryfr:
npgvba = omeyvo.nqq.nqq_npgvba_cevag
ryvs vf_dhvrg():
npgvba = omeyvo.nqq.nqq_npgvba_nqq
ryfr:
npgvba = omeyvo.nqq.nqq_npgvba_nqq_naq_cevag
omeyvo.nqq.fzneg_nqq(svyr_yvfg, abg ab_erphefr, npgvba)
pynff pzq_zxqve(Pbzznaq):
'''.splitlines(True)
, [(0,0,1), (1, 4, 2), (9, 19, 1), (12, 23, 3)])
def test_patience_unified_diff(self):
txt_a = ['hello there\n',
'world\n',
'how are you today?\n']
txt_b = ['hello there\n',
'how are you today?\n']
unified_diff = bzrlib.patiencediff.unified_diff
psm = self._PatienceSequenceMatcher
self.assertEquals(['--- \n',
'+++ \n',
'@@ -1,3 +1,2 @@\n',
' hello there\n',
'-world\n',
' how are you today?\n'
]
, list(unified_diff(txt_a, txt_b,
sequencematcher=psm)))
txt_a = map(lambda x: x+'\n', 'abcdefghijklmnop')
txt_b = map(lambda x: x+'\n', 'abcdefxydefghijklmnop')
# This is the result with LongestCommonSubstring matching
self.assertEquals(['--- \n',
'+++ \n',
'@@ -1,6 +1,11 @@\n',
' a\n',
' b\n',
' c\n',
'+d\n',
'+e\n',
'+f\n',
'+x\n',
'+y\n',
' d\n',
' e\n',
' f\n']
, list(unified_diff(txt_a, txt_b)))
# And the patience diff
self.assertEquals(['--- \n',
'+++ \n',
'@@ -4,6 +4,11 @@\n',
' d\n',
' e\n',
' f\n',
'+x\n',
'+y\n',
'+d\n',
'+e\n',
'+f\n',
' g\n',
' h\n',
' i\n',
]
, list(unified_diff(txt_a, txt_b,
sequencematcher=psm)))
def test_patience_unified_diff_with_dates(self):
txt_a = ['hello there\n',
'world\n',
'how are you today?\n']
txt_b = ['hello there\n',
'how are you today?\n']
unified_diff = bzrlib.patiencediff.unified_diff
psm = self._PatienceSequenceMatcher
self.assertEquals(['--- a\t2008-08-08\n',
'+++ b\t2008-09-09\n',
'@@ -1,3 +1,2 @@\n',
' hello there\n',
'-world\n',
' how are you today?\n'
]
, list(unified_diff(txt_a, txt_b,
fromfile='a', tofile='b',
fromfiledate='2008-08-08',
tofiledate='2008-09-09',
sequencematcher=psm)))
class TestPatienceDiffLib_c(TestPatienceDiffLib):
_test_needs_features = [compiled_patiencediff_feature]
def setUp(self):
super(TestPatienceDiffLib_c, self).setUp()
import bzrlib._patiencediff_c
self._unique_lcs = bzrlib._patiencediff_c.unique_lcs_c
self._recurse_matches = bzrlib._patiencediff_c.recurse_matches_c
self._PatienceSequenceMatcher = \
bzrlib._patiencediff_c.PatienceSequenceMatcher_c
def test_unhashable(self):
"""We should get a proper exception here."""
# We need to be able to hash items in the sequence, lists are
# unhashable, and thus cannot be diffed
e = self.assertRaises(TypeError, self._PatienceSequenceMatcher,
None, [[]], [])
e = self.assertRaises(TypeError, self._PatienceSequenceMatcher,
None, ['valid', []], [])
e = self.assertRaises(TypeError, self._PatienceSequenceMatcher,
None, ['valid'], [[]])
e = self.assertRaises(TypeError, self._PatienceSequenceMatcher,
None, ['valid'], ['valid', []])
class TestPatienceDiffLibFiles(TestCaseInTempDir):
def setUp(self):
super(TestPatienceDiffLibFiles, self).setUp()
self._PatienceSequenceMatcher = \
bzrlib._patiencediff_py.PatienceSequenceMatcher_py
def test_patience_unified_diff_files(self):
txt_a = ['hello there\n',
'world\n',
'how are you today?\n']
txt_b = ['hello there\n',
'how are you today?\n']
open('a1', 'wb').writelines(txt_a)
open('b1', 'wb').writelines(txt_b)
unified_diff_files = bzrlib.patiencediff.unified_diff_files
psm = self._PatienceSequenceMatcher
self.assertEquals(['--- a1\n',
'+++ b1\n',
'@@ -1,3 +1,2 @@\n',
' hello there\n',
'-world\n',
' how are you today?\n',
]
, list(unified_diff_files('a1', 'b1',
sequencematcher=psm)))
txt_a = map(lambda x: x+'\n', 'abcdefghijklmnop')
txt_b = map(lambda x: x+'\n', 'abcdefxydefghijklmnop')
open('a2', 'wb').writelines(txt_a)
open('b2', 'wb').writelines(txt_b)
# This is the result with LongestCommonSubstring matching
self.assertEquals(['--- a2\n',
'+++ b2\n',
'@@ -1,6 +1,11 @@\n',
' a\n',
' b\n',
' c\n',
'+d\n',
'+e\n',
'+f\n',
'+x\n',
'+y\n',
' d\n',
' e\n',
' f\n']
, list(unified_diff_files('a2', 'b2')))
# And the patience diff
self.assertEquals(['--- a2\n',
'+++ b2\n',
'@@ -4,6 +4,11 @@\n',
' d\n',
' e\n',
' f\n',
'+x\n',
'+y\n',
'+d\n',
'+e\n',
'+f\n',
' g\n',
' h\n',
' i\n',
]
, list(unified_diff_files('a2', 'b2',
sequencematcher=psm)))
class TestPatienceDiffLibFiles_c(TestPatienceDiffLibFiles):
_test_needs_features = [compiled_patiencediff_feature]
def setUp(self):
super(TestPatienceDiffLibFiles_c, self).setUp()
import bzrlib._patiencediff_c
self._PatienceSequenceMatcher = \
bzrlib._patiencediff_c.PatienceSequenceMatcher_c
class TestUsingCompiledIfAvailable(TestCase):
def test_PatienceSequenceMatcher(self):
if compiled_patiencediff_feature.available():
from bzrlib._patiencediff_c import PatienceSequenceMatcher_c
self.assertIs(PatienceSequenceMatcher_c,
bzrlib.patiencediff.PatienceSequenceMatcher)
else:
from bzrlib._patiencediff_py import PatienceSequenceMatcher_py
self.assertIs(PatienceSequenceMatcher_py,
bzrlib.patiencediff.PatienceSequenceMatcher)
def test_unique_lcs(self):
if compiled_patiencediff_feature.available():
from bzrlib._patiencediff_c import unique_lcs_c
self.assertIs(unique_lcs_c,
bzrlib.patiencediff.unique_lcs)
else:
from bzrlib._patiencediff_py import unique_lcs_py
self.assertIs(unique_lcs_py,
bzrlib.patiencediff.unique_lcs)
def test_recurse_matches(self):
if compiled_patiencediff_feature.available():
from bzrlib._patiencediff_c import recurse_matches_c
self.assertIs(recurse_matches_c,
bzrlib.patiencediff.recurse_matches)
else:
from bzrlib._patiencediff_py import recurse_matches_py
self.assertIs(recurse_matches_py,
bzrlib.patiencediff.recurse_matches)
class TestDiffFromTool(TestCaseWithTransport):
def test_from_string(self):
diff_obj = DiffFromTool.from_string('diff', None, None, None)
self.addCleanup(diff_obj.finish)
self.assertEqual(['diff', '@old_path', '@new_path'],
diff_obj.command_template)
def test_from_string_u5(self):
diff_obj = DiffFromTool.from_string('diff "-u 5"', None, None, None)
self.addCleanup(diff_obj.finish)
self.assertEqual(['diff', '-u 5', '@old_path', '@new_path'],
diff_obj.command_template)
self.assertEqual(['diff', '-u 5', 'old-path', 'new-path'],
diff_obj._get_command('old-path', 'new-path'))
def test_from_string_path_with_backslashes(self):
self.requireFeature(BackslashDirSeparatorFeature)
tool = 'C:\\Tools\\Diff.exe'
diff_obj = DiffFromTool.from_string(tool, None, None, None)
self.addCleanup(diff_obj.finish)
self.assertEqual(['C:\\Tools\\Diff.exe', '@old_path', '@new_path'],
diff_obj.command_template)
self.assertEqual(['C:\\Tools\\Diff.exe', 'old-path', 'new-path'],
diff_obj._get_command('old-path', 'new-path'))
def test_execute(self):
output = StringIO()
diff_obj = DiffFromTool(['python', '-c',
'print "@old_path @new_path"'],
None, None, output)
self.addCleanup(diff_obj.finish)
diff_obj._execute('old', 'new')
self.assertEqual(output.getvalue().rstrip(), 'old new')
def test_excute_missing(self):
diff_obj = DiffFromTool(['a-tool-which-is-unlikely-to-exist'],
None, None, None)
self.addCleanup(diff_obj.finish)
e = self.assertRaises(ExecutableMissing, diff_obj._execute, 'old',
'new')
self.assertEqual('a-tool-which-is-unlikely-to-exist could not be found'
' on this machine', str(e))
def test_prepare_files_creates_paths_readable_by_windows_tool(self):
self.requireFeature(AttribFeature)
output = StringIO()
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/file', 'content')])
tree.add('file', 'file-id')
tree.commit('old tree')
tree.lock_read()
self.addCleanup(tree.unlock)
basis_tree = tree.basis_tree()
basis_tree.lock_read()
self.addCleanup(basis_tree.unlock)
diff_obj = DiffFromTool(['python', '-c',
'print "@old_path @new_path"'],
basis_tree, tree, output)
diff_obj._prepare_files('file-id', 'file', 'file')
# The old content should be readonly
self.assertReadableByAttrib(diff_obj._root, 'old\\file',
r'R.*old\\file$')
# The new content should use the tree object, not a 'new' file anymore
self.assertEndsWith(tree.basedir, 'work/tree')
self.assertReadableByAttrib(tree.basedir, 'file', r'work\\tree\\file$')
def assertReadableByAttrib(self, cwd, relpath, regex):
proc = subprocess.Popen(['attrib', relpath],
stdout=subprocess.PIPE,
cwd=cwd)
(result, err) = proc.communicate()
self.assertContainsRe(result.replace('\r\n', '\n'), regex)
def test_prepare_files(self):
output = StringIO()
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/oldname', 'oldcontent')])
self.build_tree_contents([('tree/oldname2', 'oldcontent2')])
tree.add('oldname', 'file-id')
tree.add('oldname2', 'file2-id')
tree.commit('old tree', timestamp=0)
tree.rename_one('oldname', 'newname')
tree.rename_one('oldname2', 'newname2')
self.build_tree_contents([('tree/newname', 'newcontent')])
self.build_tree_contents([('tree/newname2', 'newcontent2')])
old_tree = tree.basis_tree()
old_tree.lock_read()
self.addCleanup(old_tree.unlock)
tree.lock_read()
self.addCleanup(tree.unlock)
diff_obj = DiffFromTool(['python', '-c',
'print "@old_path @new_path"'],
old_tree, tree, output)
self.addCleanup(diff_obj.finish)
self.assertContainsRe(diff_obj._root, 'bzr-diff-[^/]*')
old_path, new_path = diff_obj._prepare_files('file-id', 'oldname',
'newname')
self.assertContainsRe(old_path, 'old/oldname$')
self.assertEqual(0, os.stat(old_path).st_mtime)
self.assertContainsRe(new_path, 'tree/newname$')
self.assertFileEqual('oldcontent', old_path)
self.assertFileEqual('newcontent', new_path)
if osutils.host_os_dereferences_symlinks():
self.assertTrue(os.path.samefile('tree/newname', new_path))
# make sure we can create files with the same parent directories
diff_obj._prepare_files('file2-id', 'oldname2', 'newname2')
class TestGetTreesAndBranchesToDiff(TestCaseWithTransport):
def test_basic(self):
tree = self.make_branch_and_tree('tree')
(old_tree, new_tree,
old_branch, new_branch,
specific_files, extra_trees) = \
get_trees_and_branches_to_diff(['tree'], None, None, None)
self.assertIsInstance(old_tree, RevisionTree)
#print dir (old_tree)
self.assertEqual(_mod_revision.NULL_REVISION, old_tree.get_revision_id())
self.assertEqual(tree.basedir, new_tree.basedir)
self.assertEqual(tree.branch.base, old_branch.base)
self.assertEqual(tree.branch.base, new_branch.base)
self.assertIs(None, specific_files)
self.assertIs(None, extra_trees)
def test_with_rev_specs(self):
tree = self.make_branch_and_tree('tree')
self.build_tree_contents([('tree/file', 'oldcontent')])
tree.add('file', 'file-id')
tree.commit('old tree', timestamp=0, rev_id="old-id")
self.build_tree_contents([('tree/file', 'newcontent')])
tree.commit('new tree', timestamp=0, rev_id="new-id")
revisions = [RevisionSpec.from_string('1'),
RevisionSpec.from_string('2')]
(old_tree, new_tree,
old_branch, new_branch,
specific_files, extra_trees) = \
get_trees_and_branches_to_diff(['tree'], revisions, None, None)
self.assertIsInstance(old_tree, RevisionTree)
self.assertEqual("old-id", old_tree.get_revision_id())
self.assertIsInstance(new_tree, RevisionTree)
self.assertEqual("new-id", new_tree.get_revision_id())
self.assertEqual(tree.branch.base, old_branch.base)
self.assertEqual(tree.branch.base, new_branch.base)
self.assertIs(None, specific_files)
self.assertEqual(tree.basedir, extra_trees[0].basedir)
|