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
|
# Copyright (C) 2005 Canonical Ltd
#
# Authors:
# Johan Rydberg <jrydberg@gnu.org>
#
# 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
# TODO: might be nice to create a versionedfile with some type of corruption
# considered typical and check that it can be detected/corrected.
from StringIO import StringIO
import bzrlib
from bzrlib import (
errors,
osutils,
progress,
)
from bzrlib.errors import (
RevisionNotPresent,
RevisionAlreadyPresent,
WeaveParentMismatch
)
from bzrlib.knit import KnitVersionedFile, \
KnitAnnotateFactory
from bzrlib.tests import TestCaseWithTransport, TestSkipped
from bzrlib.tests.HTTPTestUtil import TestCaseWithWebserver
from bzrlib.trace import mutter
from bzrlib.transport import get_transport
from bzrlib.transport.memory import MemoryTransport
from bzrlib.tsort import topo_sort
import bzrlib.versionedfile as versionedfile
from bzrlib.weave import WeaveFile
from bzrlib.weavefile import read_weave, write_weave
class VersionedFileTestMixIn(object):
"""A mixin test class for testing VersionedFiles.
This is not an adaptor-style test at this point because
theres no dynamic substitution of versioned file implementations,
they are strictly controlled by their owning repositories.
"""
def test_add(self):
f = self.get_file()
f.add_lines('r0', [], ['a\n', 'b\n'])
f.add_lines('r1', ['r0'], ['b\n', 'c\n'])
def verify_file(f):
versions = f.versions()
self.assertTrue('r0' in versions)
self.assertTrue('r1' in versions)
self.assertEquals(f.get_lines('r0'), ['a\n', 'b\n'])
self.assertEquals(f.get_text('r0'), 'a\nb\n')
self.assertEquals(f.get_lines('r1'), ['b\n', 'c\n'])
self.assertEqual(2, len(f))
self.assertEqual(2, f.num_versions())
self.assertRaises(RevisionNotPresent,
f.add_lines, 'r2', ['foo'], [])
self.assertRaises(RevisionAlreadyPresent,
f.add_lines, 'r1', [], [])
verify_file(f)
# this checks that reopen with create=True does not break anything.
f = self.reopen_file(create=True)
verify_file(f)
def test_adds_with_parent_texts(self):
f = self.get_file()
parent_texts = {}
parent_texts['r0'] = f.add_lines('r0', [], ['a\n', 'b\n'])
try:
parent_texts['r1'] = f.add_lines_with_ghosts('r1',
['r0', 'ghost'],
['b\n', 'c\n'],
parent_texts=parent_texts)
except NotImplementedError:
# if the format doesn't support ghosts, just add normally.
parent_texts['r1'] = f.add_lines('r1',
['r0'],
['b\n', 'c\n'],
parent_texts=parent_texts)
f.add_lines('r2', ['r1'], ['c\n', 'd\n'], parent_texts=parent_texts)
self.assertNotEqual(None, parent_texts['r0'])
self.assertNotEqual(None, parent_texts['r1'])
def verify_file(f):
versions = f.versions()
self.assertTrue('r0' in versions)
self.assertTrue('r1' in versions)
self.assertTrue('r2' in versions)
self.assertEquals(f.get_lines('r0'), ['a\n', 'b\n'])
self.assertEquals(f.get_lines('r1'), ['b\n', 'c\n'])
self.assertEquals(f.get_lines('r2'), ['c\n', 'd\n'])
self.assertEqual(3, f.num_versions())
origins = f.annotate('r1')
self.assertEquals(origins[0][0], 'r0')
self.assertEquals(origins[1][0], 'r1')
origins = f.annotate('r2')
self.assertEquals(origins[0][0], 'r1')
self.assertEquals(origins[1][0], 'r2')
verify_file(f)
f = self.reopen_file()
verify_file(f)
def test_add_unicode_content(self):
# unicode content is not permitted in versioned files.
# versioned files version sequences of bytes only.
vf = self.get_file()
self.assertRaises(errors.BzrBadParameterUnicode,
vf.add_lines, 'a', [], ['a\n', u'b\n', 'c\n'])
self.assertRaises(
(errors.BzrBadParameterUnicode, NotImplementedError),
vf.add_lines_with_ghosts, 'a', [], ['a\n', u'b\n', 'c\n'])
def test_add_follows_left_matching_blocks(self):
"""If we change left_matching_blocks, delta changes
Note: There are multiple correct deltas in this case, because
we start with 1 "a" and we get 3.
"""
vf = self.get_file()
if isinstance(vf, WeaveFile):
raise TestSkipped("WeaveFile ignores left_matching_blocks")
vf.add_lines('1', [], ['a\n'])
vf.add_lines('2', ['1'], ['a\n', 'a\n', 'a\n'],
left_matching_blocks=[(0, 0, 1), (1, 3, 0)])
self.assertEqual([(1, 1, 2, [('2', 'a\n'), ('2', 'a\n')])],
vf.get_delta('2')[3])
vf.add_lines('3', ['1'], ['a\n', 'a\n', 'a\n'],
left_matching_blocks=[(0, 2, 1), (1, 3, 0)])
self.assertEqual([(0, 0, 2, [('3', 'a\n'), ('3', 'a\n')])],
vf.get_delta('3')[3])
def test_inline_newline_throws(self):
# \r characters are not permitted in lines being added
vf = self.get_file()
self.assertRaises(errors.BzrBadParameterContainsNewline,
vf.add_lines, 'a', [], ['a\n\n'])
self.assertRaises(
(errors.BzrBadParameterContainsNewline, NotImplementedError),
vf.add_lines_with_ghosts, 'a', [], ['a\n\n'])
# but inline CR's are allowed
vf.add_lines('a', [], ['a\r\n'])
try:
vf.add_lines_with_ghosts('b', [], ['a\r\n'])
except NotImplementedError:
pass
def test_add_reserved(self):
vf = self.get_file()
self.assertRaises(errors.ReservedId,
vf.add_lines, 'a:', [], ['a\n', 'b\n', 'c\n'])
self.assertRaises(errors.ReservedId,
vf.add_delta, 'a:', [], None, 'sha1', False, ((0, 0, 0, []),))
def test_get_reserved(self):
vf = self.get_file()
self.assertRaises(errors.ReservedId, vf.get_delta, 'b:')
self.assertRaises(errors.ReservedId, vf.get_texts, ['b:'])
self.assertRaises(errors.ReservedId, vf.get_lines, 'b:')
self.assertRaises(errors.ReservedId, vf.get_text, 'b:')
def test_get_delta(self):
f = self.get_file()
sha1s = self._setup_for_deltas(f)
expected_delta = (None, '6bfa09d82ce3e898ad4641ae13dd4fdb9cf0d76b', False,
[(0, 0, 1, [('base', 'line\n')])])
self.assertEqual(expected_delta, f.get_delta('base'))
next_parent = 'base'
text_name = 'chain1-'
for depth in range(26):
new_version = text_name + '%s' % depth
expected_delta = (next_parent, sha1s[depth],
False,
[(depth + 1, depth + 1, 1, [(new_version, 'line\n')])])
self.assertEqual(expected_delta, f.get_delta(new_version))
next_parent = new_version
next_parent = 'base'
text_name = 'chain2-'
for depth in range(26):
new_version = text_name + '%s' % depth
expected_delta = (next_parent, sha1s[depth], False,
[(depth + 1, depth + 1, 1, [(new_version, 'line\n')])])
self.assertEqual(expected_delta, f.get_delta(new_version))
next_parent = new_version
# smoke test for eol support
expected_delta = ('base', '264f39cab871e4cfd65b3a002f7255888bb5ed97', True, [])
self.assertEqual(['line'], f.get_lines('noeol'))
self.assertEqual(expected_delta, f.get_delta('noeol'))
def test_get_deltas(self):
f = self.get_file()
sha1s = self._setup_for_deltas(f)
deltas = f.get_deltas(f.versions())
expected_delta = (None, '6bfa09d82ce3e898ad4641ae13dd4fdb9cf0d76b', False,
[(0, 0, 1, [('base', 'line\n')])])
self.assertEqual(expected_delta, deltas['base'])
next_parent = 'base'
text_name = 'chain1-'
for depth in range(26):
new_version = text_name + '%s' % depth
expected_delta = (next_parent, sha1s[depth],
False,
[(depth + 1, depth + 1, 1, [(new_version, 'line\n')])])
self.assertEqual(expected_delta, deltas[new_version])
next_parent = new_version
next_parent = 'base'
text_name = 'chain2-'
for depth in range(26):
new_version = text_name + '%s' % depth
expected_delta = (next_parent, sha1s[depth], False,
[(depth + 1, depth + 1, 1, [(new_version, 'line\n')])])
self.assertEqual(expected_delta, deltas[new_version])
next_parent = new_version
# smoke tests for eol support
expected_delta = ('base', '264f39cab871e4cfd65b3a002f7255888bb5ed97', True, [])
self.assertEqual(['line'], f.get_lines('noeol'))
self.assertEqual(expected_delta, deltas['noeol'])
# smoke tests for eol support - two noeol in a row same content
expected_deltas = (('noeol', '3ad7ee82dbd8f29ecba073f96e43e414b3f70a4d', True,
[(0, 1, 2, [('noeolsecond', 'line\n'), ('noeolsecond', 'line\n')])]),
('noeol', '3ad7ee82dbd8f29ecba073f96e43e414b3f70a4d', True,
[(0, 0, 1, [('noeolsecond', 'line\n')]), (1, 1, 0, [])]))
self.assertEqual(['line\n', 'line'], f.get_lines('noeolsecond'))
self.assertTrue(deltas['noeolsecond'] in expected_deltas)
# two no-eol in a row, different content
expected_delta = ('noeolsecond', '8bb553a84e019ef1149db082d65f3133b195223b', True,
[(1, 2, 1, [('noeolnotshared', 'phone\n')])])
self.assertEqual(['line\n', 'phone'], f.get_lines('noeolnotshared'))
self.assertEqual(expected_delta, deltas['noeolnotshared'])
# eol folling a no-eol with content change
expected_delta = ('noeol', 'a61f6fb6cfc4596e8d88c34a308d1e724caf8977', False,
[(0, 1, 1, [('eol', 'phone\n')])])
self.assertEqual(['phone\n'], f.get_lines('eol'))
self.assertEqual(expected_delta, deltas['eol'])
# eol folling a no-eol with content change
expected_delta = ('noeol', '6bfa09d82ce3e898ad4641ae13dd4fdb9cf0d76b', False,
[(0, 1, 1, [('eolline', 'line\n')])])
self.assertEqual(['line\n'], f.get_lines('eolline'))
self.assertEqual(expected_delta, deltas['eolline'])
# eol with no parents
expected_delta = (None, '264f39cab871e4cfd65b3a002f7255888bb5ed97', True,
[(0, 0, 1, [('noeolbase', 'line\n')])])
self.assertEqual(['line'], f.get_lines('noeolbase'))
self.assertEqual(expected_delta, deltas['noeolbase'])
# eol with two parents, in inverse insertion order
expected_deltas = (('noeolbase', '264f39cab871e4cfd65b3a002f7255888bb5ed97', True,
[(0, 1, 1, [('eolbeforefirstparent', 'line\n')])]),
('noeolbase', '264f39cab871e4cfd65b3a002f7255888bb5ed97', True,
[(0, 1, 1, [('eolbeforefirstparent', 'line\n')])]))
self.assertEqual(['line'], f.get_lines('eolbeforefirstparent'))
#self.assertTrue(deltas['eolbeforefirstparent'] in expected_deltas)
def test_make_mpdiffs(self):
from bzrlib import multiparent
vf = self.get_file('foo')
sha1s = self._setup_for_deltas(vf)
new_vf = self.get_file('bar')
for version in multiparent.topo_iter(vf):
mpdiff = vf.make_mpdiffs([version])[0]
new_vf.add_mpdiffs([(version, vf.get_parents(version),
vf.get_sha1(version), mpdiff)])
self.assertEqualDiff(vf.get_text(version),
new_vf.get_text(version))
def _setup_for_deltas(self, f):
self.assertRaises(errors.RevisionNotPresent, f.get_delta, 'base')
# add texts that should trip the knit maximum delta chain threshold
# as well as doing parallel chains of data in knits.
# this is done by two chains of 25 insertions
f.add_lines('base', [], ['line\n'])
f.add_lines('noeol', ['base'], ['line'])
# detailed eol tests:
# shared last line with parent no-eol
f.add_lines('noeolsecond', ['noeol'], ['line\n', 'line'])
# differing last line with parent, both no-eol
f.add_lines('noeolnotshared', ['noeolsecond'], ['line\n', 'phone'])
# add eol following a noneol parent, change content
f.add_lines('eol', ['noeol'], ['phone\n'])
# add eol following a noneol parent, no change content
f.add_lines('eolline', ['noeol'], ['line\n'])
# noeol with no parents:
f.add_lines('noeolbase', [], ['line'])
# noeol preceeding its leftmost parent in the output:
# this is done by making it a merge of two parents with no common
# anestry: noeolbase and noeol with the
# later-inserted parent the leftmost.
f.add_lines('eolbeforefirstparent', ['noeolbase', 'noeol'], ['line'])
# two identical eol texts
f.add_lines('noeoldup', ['noeol'], ['line'])
next_parent = 'base'
text_name = 'chain1-'
text = ['line\n']
sha1s = {0 :'da6d3141cb4a5e6f464bf6e0518042ddc7bfd079',
1 :'45e21ea146a81ea44a821737acdb4f9791c8abe7',
2 :'e1f11570edf3e2a070052366c582837a4fe4e9fa',
3 :'26b4b8626da827088c514b8f9bbe4ebf181edda1',
4 :'e28a5510be25ba84d31121cff00956f9970ae6f6',
5 :'d63ec0ce22e11dcf65a931b69255d3ac747a318d',
6 :'2c2888d288cb5e1d98009d822fedfe6019c6a4ea',
7 :'95c14da9cafbf828e3e74a6f016d87926ba234ab',
8 :'779e9a0b28f9f832528d4b21e17e168c67697272',
9 :'1f8ff4e5c6ff78ac106fcfe6b1e8cb8740ff9a8f',
10:'131a2ae712cf51ed62f143e3fbac3d4206c25a05',
11:'c5a9d6f520d2515e1ec401a8f8a67e6c3c89f199',
12:'31a2286267f24d8bedaa43355f8ad7129509ea85',
13:'dc2a7fe80e8ec5cae920973973a8ee28b2da5e0a',
14:'2c4b1736566b8ca6051e668de68650686a3922f2',
15:'5912e4ecd9b0c07be4d013e7e2bdcf9323276cde',
16:'b0d2e18d3559a00580f6b49804c23fea500feab3',
17:'8e1d43ad72f7562d7cb8f57ee584e20eb1a69fc7',
18:'5cf64a3459ae28efa60239e44b20312d25b253f3',
19:'1ebed371807ba5935958ad0884595126e8c4e823',
20:'2aa62a8b06fb3b3b892a3292a068ade69d5ee0d3',
21:'01edc447978004f6e4e962b417a4ae1955b6fe5d',
22:'d8d8dc49c4bf0bab401e0298bb5ad827768618bb',
23:'c21f62b1c482862983a8ffb2b0c64b3451876e3f',
24:'c0593fe795e00dff6b3c0fe857a074364d5f04fc',
25:'dd1a1cf2ba9cc225c3aff729953e6364bf1d1855',
}
for depth in range(26):
new_version = text_name + '%s' % depth
text = text + ['line\n']
f.add_lines(new_version, [next_parent], text)
next_parent = new_version
next_parent = 'base'
text_name = 'chain2-'
text = ['line\n']
for depth in range(26):
new_version = text_name + '%s' % depth
text = text + ['line\n']
f.add_lines(new_version, [next_parent], text)
next_parent = new_version
return sha1s
def test_add_delta(self):
# tests for the add-delta facility.
# at this point, optimising for speed, we assume no checks when deltas are inserted.
# this may need to be revisited.
source = self.get_file('source')
source.add_lines('base', [], ['line\n'])
next_parent = 'base'
text_name = 'chain1-'
text = ['line\n']
for depth in range(26):
new_version = text_name + '%s' % depth
text = text + ['line\n']
source.add_lines(new_version, [next_parent], text)
next_parent = new_version
next_parent = 'base'
text_name = 'chain2-'
text = ['line\n']
for depth in range(26):
new_version = text_name + '%s' % depth
text = text + ['line\n']
source.add_lines(new_version, [next_parent], text)
next_parent = new_version
source.add_lines('noeol', ['base'], ['line'])
target = self.get_file('target')
for version in source.versions():
parent, sha1, noeol, delta = source.get_delta(version)
target.add_delta(version,
source.get_parents(version),
parent,
sha1,
noeol,
delta)
self.assertRaises(RevisionAlreadyPresent,
target.add_delta, 'base', [], None, '', False, [])
for version in source.versions():
self.assertEqual(source.get_lines(version),
target.get_lines(version))
def test_ancestry(self):
f = self.get_file()
self.assertEqual([], f.get_ancestry([]))
f.add_lines('r0', [], ['a\n', 'b\n'])
f.add_lines('r1', ['r0'], ['b\n', 'c\n'])
f.add_lines('r2', ['r0'], ['b\n', 'c\n'])
f.add_lines('r3', ['r2'], ['b\n', 'c\n'])
f.add_lines('rM', ['r1', 'r2'], ['b\n', 'c\n'])
self.assertEqual([], f.get_ancestry([]))
versions = f.get_ancestry(['rM'])
# there are some possibilities:
# r0 r1 r2 rM r3
# r0 r1 r2 r3 rM
# etc
# so we check indexes
r0 = versions.index('r0')
r1 = versions.index('r1')
r2 = versions.index('r2')
self.assertFalse('r3' in versions)
rM = versions.index('rM')
self.assertTrue(r0 < r1)
self.assertTrue(r0 < r2)
self.assertTrue(r1 < rM)
self.assertTrue(r2 < rM)
self.assertRaises(RevisionNotPresent,
f.get_ancestry, ['rM', 'rX'])
self.assertEqual(set(f.get_ancestry('rM')),
set(f.get_ancestry('rM', topo_sorted=False)))
def test_mutate_after_finish(self):
f = self.get_file()
f.transaction_finished()
self.assertRaises(errors.OutSideTransaction, f.add_delta, '', [], '', '', False, [])
self.assertRaises(errors.OutSideTransaction, f.add_lines, '', [], [])
self.assertRaises(errors.OutSideTransaction, f.add_lines_with_ghosts, '', [], [])
self.assertRaises(errors.OutSideTransaction, f.fix_parents, '', [])
self.assertRaises(errors.OutSideTransaction, f.join, '')
self.assertRaises(errors.OutSideTransaction, f.clone_text, 'base', 'bar', ['foo'])
def test_clear_cache(self):
f = self.get_file()
# on a new file it should not error
f.clear_cache()
# and after adding content, doing a clear_cache and a get should work.
f.add_lines('0', [], ['a'])
f.clear_cache()
self.assertEqual(['a'], f.get_lines('0'))
def test_clone_text(self):
f = self.get_file()
f.add_lines('r0', [], ['a\n', 'b\n'])
f.clone_text('r1', 'r0', ['r0'])
def verify_file(f):
self.assertEquals(f.get_lines('r1'), f.get_lines('r0'))
self.assertEquals(f.get_lines('r1'), ['a\n', 'b\n'])
self.assertEquals(f.get_parents('r1'), ['r0'])
self.assertRaises(RevisionNotPresent,
f.clone_text, 'r2', 'rX', [])
self.assertRaises(RevisionAlreadyPresent,
f.clone_text, 'r1', 'r0', [])
verify_file(f)
verify_file(self.reopen_file())
def test_create_empty(self):
f = self.get_file()
f.add_lines('0', [], ['a\n'])
new_f = f.create_empty('t', MemoryTransport())
# smoke test, specific types should check it is honoured correctly for
# non type attributes
self.assertEqual([], new_f.versions())
self.assertTrue(isinstance(new_f, f.__class__))
def test_copy_to(self):
f = self.get_file()
f.add_lines('0', [], ['a\n'])
t = MemoryTransport()
f.copy_to('foo', t)
for suffix in f.__class__.get_suffixes():
self.assertTrue(t.has('foo' + suffix))
def test_get_suffixes(self):
f = self.get_file()
# should be the same
self.assertEqual(f.__class__.get_suffixes(), f.__class__.get_suffixes())
# and should be a list
self.assertTrue(isinstance(f.__class__.get_suffixes(), list))
def build_graph(self, file, graph):
for node in topo_sort(graph.items()):
file.add_lines(node, graph[node], [])
def test_get_graph(self):
f = self.get_file()
graph = {
'v1': (),
'v2': ('v1', ),
'v3': ('v2', )}
self.build_graph(f, graph)
self.assertEqual(graph, f.get_graph())
def test_get_graph_partial(self):
f = self.get_file()
complex_graph = {}
simple_a = {
'c': (),
'b': ('c', ),
'a': ('b', ),
}
complex_graph.update(simple_a)
simple_b = {
'c': (),
'b': ('c', ),
}
complex_graph.update(simple_b)
simple_gam = {
'c': (),
'oo': (),
'bar': ('oo', 'c'),
'gam': ('bar', ),
}
complex_graph.update(simple_gam)
simple_b_gam = {}
simple_b_gam.update(simple_gam)
simple_b_gam.update(simple_b)
self.build_graph(f, complex_graph)
self.assertEqual(simple_a, f.get_graph(['a']))
self.assertEqual(simple_b, f.get_graph(['b']))
self.assertEqual(simple_gam, f.get_graph(['gam']))
self.assertEqual(simple_b_gam, f.get_graph(['b', 'gam']))
def test_get_parents(self):
f = self.get_file()
f.add_lines('r0', [], ['a\n', 'b\n'])
f.add_lines('r1', [], ['a\n', 'b\n'])
f.add_lines('r2', [], ['a\n', 'b\n'])
f.add_lines('r3', [], ['a\n', 'b\n'])
f.add_lines('m', ['r0', 'r1', 'r2', 'r3'], ['a\n', 'b\n'])
self.assertEquals(f.get_parents('m'), ['r0', 'r1', 'r2', 'r3'])
self.assertRaises(RevisionNotPresent,
f.get_parents, 'y')
def test_annotate(self):
f = self.get_file()
f.add_lines('r0', [], ['a\n', 'b\n'])
f.add_lines('r1', ['r0'], ['c\n', 'b\n'])
origins = f.annotate('r1')
self.assertEquals(origins[0][0], 'r1')
self.assertEquals(origins[1][0], 'r0')
self.assertRaises(RevisionNotPresent,
f.annotate, 'foo')
def test_detection(self):
# Test weaves detect corruption.
#
# Weaves contain a checksum of their texts.
# When a text is extracted, this checksum should be
# verified.
w = self.get_file_corrupted_text()
self.assertEqual('hello\n', w.get_text('v1'))
self.assertRaises(errors.WeaveInvalidChecksum, w.get_text, 'v2')
self.assertRaises(errors.WeaveInvalidChecksum, w.get_lines, 'v2')
self.assertRaises(errors.WeaveInvalidChecksum, w.check)
w = self.get_file_corrupted_checksum()
self.assertEqual('hello\n', w.get_text('v1'))
self.assertRaises(errors.WeaveInvalidChecksum, w.get_text, 'v2')
self.assertRaises(errors.WeaveInvalidChecksum, w.get_lines, 'v2')
self.assertRaises(errors.WeaveInvalidChecksum, w.check)
def get_file_corrupted_text(self):
"""Return a versioned file with corrupt text but valid metadata."""
raise NotImplementedError(self.get_file_corrupted_text)
def reopen_file(self, name='foo'):
"""Open the versioned file from disk again."""
raise NotImplementedError(self.reopen_file)
def test_iter_parents(self):
"""iter_parents returns the parents for many nodes."""
f = self.get_file()
# sample data:
# no parents
f.add_lines('r0', [], ['a\n', 'b\n'])
# 1 parents
f.add_lines('r1', ['r0'], ['a\n', 'b\n'])
# 2 parents
f.add_lines('r2', ['r1', 'r0'], ['a\n', 'b\n'])
# XXX TODO a ghost
# cases: each sample data individually:
self.assertEqual(set([('r0', ())]),
set(f.iter_parents(['r0'])))
self.assertEqual(set([('r1', ('r0', ))]),
set(f.iter_parents(['r1'])))
self.assertEqual(set([('r2', ('r1', 'r0'))]),
set(f.iter_parents(['r2'])))
# no nodes returned for a missing node
self.assertEqual(set(),
set(f.iter_parents(['missing'])))
# 1 node returned with missing nodes skipped
self.assertEqual(set([('r1', ('r0', ))]),
set(f.iter_parents(['ghost1', 'r1', 'ghost'])))
# 2 nodes returned
self.assertEqual(set([('r0', ()), ('r1', ('r0', ))]),
set(f.iter_parents(['r0', 'r1'])))
# 2 nodes returned, missing skipped
self.assertEqual(set([('r0', ()), ('r1', ('r0', ))]),
set(f.iter_parents(['a', 'r0', 'b', 'r1', 'c'])))
def test_iter_lines_added_or_present_in_versions(self):
# test that we get at least an equalset of the lines added by
# versions in the weave
# the ordering here is to make a tree so that dumb searches have
# more changes to muck up.
class InstrumentedProgress(progress.DummyProgress):
def __init__(self):
progress.DummyProgress.__init__(self)
self.updates = []
def update(self, msg=None, current=None, total=None):
self.updates.append((msg, current, total))
vf = self.get_file()
# add a base to get included
vf.add_lines('base', [], ['base\n'])
# add a ancestor to be included on one side
vf.add_lines('lancestor', [], ['lancestor\n'])
# add a ancestor to be included on the other side
vf.add_lines('rancestor', ['base'], ['rancestor\n'])
# add a child of rancestor with no eofile-nl
vf.add_lines('child', ['rancestor'], ['base\n', 'child\n'])
# add a child of lancestor and base to join the two roots
vf.add_lines('otherchild',
['lancestor', 'base'],
['base\n', 'lancestor\n', 'otherchild\n'])
def iter_with_versions(versions, expected):
# now we need to see what lines are returned, and how often.
lines = {'base\n':0,
'lancestor\n':0,
'rancestor\n':0,
'child\n':0,
'otherchild\n':0,
}
progress = InstrumentedProgress()
# iterate over the lines
for line in vf.iter_lines_added_or_present_in_versions(versions,
pb=progress):
lines[line] += 1
if []!= progress.updates:
self.assertEqual(expected, progress.updates)
return lines
lines = iter_with_versions(['child', 'otherchild'],
[('Walking content.', 0, 2),
('Walking content.', 1, 2),
('Walking content.', 2, 2)])
# we must see child and otherchild
self.assertTrue(lines['child\n'] > 0)
self.assertTrue(lines['otherchild\n'] > 0)
# we dont care if we got more than that.
# test all lines
lines = iter_with_versions(None, [('Walking content.', 0, 5),
('Walking content.', 1, 5),
('Walking content.', 2, 5),
('Walking content.', 3, 5),
('Walking content.', 4, 5),
('Walking content.', 5, 5)])
# all lines must be seen at least once
self.assertTrue(lines['base\n'] > 0)
self.assertTrue(lines['lancestor\n'] > 0)
self.assertTrue(lines['rancestor\n'] > 0)
self.assertTrue(lines['child\n'] > 0)
self.assertTrue(lines['otherchild\n'] > 0)
def test_fix_parents(self):
# some versioned files allow incorrect parents to be corrected after
# insertion - this may not fix ancestry..
# if they do not supported, they just do not implement it.
# we test this as an interface test to ensure that those that *do*
# implementent it get it right.
vf = self.get_file()
vf.add_lines('notbase', [], [])
vf.add_lines('base', [], [])
try:
vf.fix_parents('notbase', ['base'])
except NotImplementedError:
return
self.assertEqual(['base'], vf.get_parents('notbase'))
# open again, check it stuck.
vf = self.get_file()
self.assertEqual(['base'], vf.get_parents('notbase'))
def test_fix_parents_with_ghosts(self):
# when fixing parents, ghosts that are listed should not be ghosts
# anymore.
vf = self.get_file()
try:
vf.add_lines_with_ghosts('notbase', ['base', 'stillghost'], [])
except NotImplementedError:
return
vf.add_lines('base', [], [])
vf.fix_parents('notbase', ['base', 'stillghost'])
self.assertEqual(['base'], vf.get_parents('notbase'))
# open again, check it stuck.
vf = self.get_file()
self.assertEqual(['base'], vf.get_parents('notbase'))
# and check the ghosts
self.assertEqual(['base', 'stillghost'],
vf.get_parents_with_ghosts('notbase'))
def test_add_lines_with_ghosts(self):
# some versioned file formats allow lines to be added with parent
# information that is > than that in the format. Formats that do
# not support this need to raise NotImplementedError on the
# add_lines_with_ghosts api.
vf = self.get_file()
# add a revision with ghost parents
# The preferred form is utf8, but we should translate when needed
parent_id_unicode = u'b\xbfse'
parent_id_utf8 = parent_id_unicode.encode('utf8')
try:
vf.add_lines_with_ghosts('notbxbfse', [parent_id_utf8], [])
except NotImplementedError:
# check the other ghost apis are also not implemented
self.assertRaises(NotImplementedError, vf.has_ghost, 'foo')
self.assertRaises(NotImplementedError, vf.get_ancestry_with_ghosts, ['foo'])
self.assertRaises(NotImplementedError, vf.get_parents_with_ghosts, 'foo')
self.assertRaises(NotImplementedError, vf.get_graph_with_ghosts)
return
vf = self.reopen_file()
# test key graph related apis: getncestry, _graph, get_parents
# has_version
# - these are ghost unaware and must not be reflect ghosts
self.assertEqual(['notbxbfse'], vf.get_ancestry('notbxbfse'))
self.assertEqual([], vf.get_parents('notbxbfse'))
self.assertEqual({'notbxbfse':()}, vf.get_graph())
self.assertFalse(self.callDeprecated([osutils._revision_id_warning],
vf.has_version, parent_id_unicode))
self.assertFalse(vf.has_version(parent_id_utf8))
# we have _with_ghost apis to give us ghost information.
self.assertEqual([parent_id_utf8, 'notbxbfse'], vf.get_ancestry_with_ghosts(['notbxbfse']))
self.assertEqual([parent_id_utf8], vf.get_parents_with_ghosts('notbxbfse'))
self.assertEqual({'notbxbfse':[parent_id_utf8]}, vf.get_graph_with_ghosts())
self.assertTrue(self.callDeprecated([osutils._revision_id_warning],
vf.has_ghost, parent_id_unicode))
self.assertTrue(vf.has_ghost(parent_id_utf8))
# if we add something that is a ghost of another, it should correct the
# results of the prior apis
self.callDeprecated([osutils._revision_id_warning],
vf.add_lines, parent_id_unicode, [], [])
self.assertEqual([parent_id_utf8, 'notbxbfse'], vf.get_ancestry(['notbxbfse']))
self.assertEqual([parent_id_utf8], vf.get_parents('notbxbfse'))
self.assertEqual({parent_id_utf8:(),
'notbxbfse':(parent_id_utf8, ),
},
vf.get_graph())
self.assertTrue(self.callDeprecated([osutils._revision_id_warning],
vf.has_version, parent_id_unicode))
self.assertTrue(vf.has_version(parent_id_utf8))
# we have _with_ghost apis to give us ghost information.
self.assertEqual([parent_id_utf8, 'notbxbfse'], vf.get_ancestry_with_ghosts(['notbxbfse']))
self.assertEqual([parent_id_utf8], vf.get_parents_with_ghosts('notbxbfse'))
self.assertEqual({parent_id_utf8:[],
'notbxbfse':[parent_id_utf8],
},
vf.get_graph_with_ghosts())
self.assertFalse(self.callDeprecated([osutils._revision_id_warning],
vf.has_ghost, parent_id_unicode))
self.assertFalse(vf.has_ghost(parent_id_utf8))
def test_add_lines_with_ghosts_after_normal_revs(self):
# some versioned file formats allow lines to be added with parent
# information that is > than that in the format. Formats that do
# not support this need to raise NotImplementedError on the
# add_lines_with_ghosts api.
vf = self.get_file()
# probe for ghost support
try:
vf.has_ghost('hoo')
except NotImplementedError:
return
vf.add_lines_with_ghosts('base', [], ['line\n', 'line_b\n'])
vf.add_lines_with_ghosts('references_ghost',
['base', 'a_ghost'],
['line\n', 'line_b\n', 'line_c\n'])
origins = vf.annotate('references_ghost')
self.assertEquals(('base', 'line\n'), origins[0])
self.assertEquals(('base', 'line_b\n'), origins[1])
self.assertEquals(('references_ghost', 'line_c\n'), origins[2])
def test_readonly_mode(self):
transport = get_transport(self.get_url('.'))
factory = self.get_factory()
vf = factory('id', transport, 0777, create=True, access_mode='w')
vf = factory('id', transport, access_mode='r')
self.assertRaises(errors.ReadOnlyError, vf.add_delta, '', [], '', '', False, [])
self.assertRaises(errors.ReadOnlyError, vf.add_lines, 'base', [], [])
self.assertRaises(errors.ReadOnlyError,
vf.add_lines_with_ghosts,
'base',
[],
[])
self.assertRaises(errors.ReadOnlyError, vf.fix_parents, 'base', [])
self.assertRaises(errors.ReadOnlyError, vf.join, 'base')
self.assertRaises(errors.ReadOnlyError, vf.clone_text, 'base', 'bar', ['foo'])
def test_get_sha1(self):
# check the sha1 data is available
vf = self.get_file()
# a simple file
vf.add_lines('a', [], ['a\n'])
# the same file, different metadata
vf.add_lines('b', ['a'], ['a\n'])
# a file differing only in last newline.
vf.add_lines('c', [], ['a'])
self.assertEqual(
'3f786850e387550fdab836ed7e6dc881de23001b', vf.get_sha1('a'))
self.assertEqual(
'3f786850e387550fdab836ed7e6dc881de23001b', vf.get_sha1('b'))
self.assertEqual(
'86f7e437faa5a7fce15d1ddcb9eaeaea377667b8', vf.get_sha1('c'))
self.assertEqual(['3f786850e387550fdab836ed7e6dc881de23001b',
'86f7e437faa5a7fce15d1ddcb9eaeaea377667b8',
'3f786850e387550fdab836ed7e6dc881de23001b'],
vf.get_sha1s(['a', 'c', 'b']))
class TestWeave(TestCaseWithTransport, VersionedFileTestMixIn):
def get_file(self, name='foo'):
return WeaveFile(name, get_transport(self.get_url('.')), create=True)
def get_file_corrupted_text(self):
w = WeaveFile('foo', get_transport(self.get_url('.')), create=True)
w.add_lines('v1', [], ['hello\n'])
w.add_lines('v2', ['v1'], ['hello\n', 'there\n'])
# We are going to invasively corrupt the text
# Make sure the internals of weave are the same
self.assertEqual([('{', 0)
, 'hello\n'
, ('}', None)
, ('{', 1)
, 'there\n'
, ('}', None)
], w._weave)
self.assertEqual(['f572d396fae9206628714fb2ce00f72e94f2258f'
, '90f265c6e75f1c8f9ab76dcf85528352c5f215ef'
], w._sha1s)
w.check()
# Corrupted
w._weave[4] = 'There\n'
return w
def get_file_corrupted_checksum(self):
w = self.get_file_corrupted_text()
# Corrected
w._weave[4] = 'there\n'
self.assertEqual('hello\nthere\n', w.get_text('v2'))
#Invalid checksum, first digit changed
w._sha1s[1] = 'f0f265c6e75f1c8f9ab76dcf85528352c5f215ef'
return w
def reopen_file(self, name='foo', create=False):
return WeaveFile(name, get_transport(self.get_url('.')), create=create)
def test_no_implicit_create(self):
self.assertRaises(errors.NoSuchFile,
WeaveFile,
'foo',
get_transport(self.get_url('.')))
def get_factory(self):
return WeaveFile
class TestKnit(TestCaseWithTransport, VersionedFileTestMixIn):
def get_file(self, name='foo'):
return KnitVersionedFile(name, get_transport(self.get_url('.')),
delta=True, create=True)
def get_factory(self):
return KnitVersionedFile
def get_file_corrupted_text(self):
knit = self.get_file()
knit.add_lines('v1', [], ['hello\n'])
knit.add_lines('v2', ['v1'], ['hello\n', 'there\n'])
return knit
def reopen_file(self, name='foo', create=False):
return KnitVersionedFile(name, get_transport(self.get_url('.')),
delta=True,
create=create)
def test_detection(self):
knit = self.get_file()
knit.check()
def test_no_implicit_create(self):
self.assertRaises(errors.NoSuchFile,
KnitVersionedFile,
'foo',
get_transport(self.get_url('.')))
class InterString(versionedfile.InterVersionedFile):
"""An inter-versionedfile optimised code path for strings.
This is for use during testing where we use strings as versionedfiles
so that none of the default regsitered interversionedfile classes will
match - which lets us test the match logic.
"""
@staticmethod
def is_compatible(source, target):
"""InterString is compatible with strings-as-versionedfiles."""
return isinstance(source, str) and isinstance(target, str)
# TODO this and the InterRepository core logic should be consolidatable
# if we make the registry a separate class though we still need to
# test the behaviour in the active registry to catch failure-to-handle-
# stange-objects
class TestInterVersionedFile(TestCaseWithTransport):
def test_get_default_inter_versionedfile(self):
# test that the InterVersionedFile.get(a, b) probes
# for a class where is_compatible(a, b) returns
# true and returns a default interversionedfile otherwise.
# This also tests that the default registered optimised interversionedfile
# classes do not barf inappropriately when a surprising versionedfile type
# is handed to them.
dummy_a = "VersionedFile 1."
dummy_b = "VersionedFile 2."
self.assertGetsDefaultInterVersionedFile(dummy_a, dummy_b)
def assertGetsDefaultInterVersionedFile(self, a, b):
"""Asserts that InterVersionedFile.get(a, b) -> the default."""
inter = versionedfile.InterVersionedFile.get(a, b)
self.assertEqual(versionedfile.InterVersionedFile,
inter.__class__)
self.assertEqual(a, inter.source)
self.assertEqual(b, inter.target)
def test_register_inter_versionedfile_class(self):
# test that a optimised code path provider - a
# InterVersionedFile subclass can be registered and unregistered
# and that it is correctly selected when given a versionedfile
# pair that it returns true on for the is_compatible static method
# check
dummy_a = "VersionedFile 1."
dummy_b = "VersionedFile 2."
versionedfile.InterVersionedFile.register_optimiser(InterString)
try:
# we should get the default for something InterString returns False
# to
self.assertFalse(InterString.is_compatible(dummy_a, None))
self.assertGetsDefaultInterVersionedFile(dummy_a, None)
# and we should get an InterString for a pair it 'likes'
self.assertTrue(InterString.is_compatible(dummy_a, dummy_b))
inter = versionedfile.InterVersionedFile.get(dummy_a, dummy_b)
self.assertEqual(InterString, inter.__class__)
self.assertEqual(dummy_a, inter.source)
self.assertEqual(dummy_b, inter.target)
finally:
versionedfile.InterVersionedFile.unregister_optimiser(InterString)
# now we should get the default InterVersionedFile object again.
self.assertGetsDefaultInterVersionedFile(dummy_a, dummy_b)
class TestReadonlyHttpMixin(object):
def test_readonly_http_works(self):
# we should be able to read from http with a versioned file.
vf = self.get_file()
# try an empty file access
readonly_vf = self.get_factory()('foo', get_transport(self.get_readonly_url('.')))
self.assertEqual([], readonly_vf.versions())
# now with feeling.
vf.add_lines('1', [], ['a\n'])
vf.add_lines('2', ['1'], ['b\n', 'a\n'])
readonly_vf = self.get_factory()('foo', get_transport(self.get_readonly_url('.')))
self.assertEqual(['1', '2'], vf.versions())
for version in readonly_vf.versions():
readonly_vf.get_lines(version)
class TestWeaveHTTP(TestCaseWithWebserver, TestReadonlyHttpMixin):
def get_file(self):
return WeaveFile('foo', get_transport(self.get_url('.')), create=True)
def get_factory(self):
return WeaveFile
class TestKnitHTTP(TestCaseWithWebserver, TestReadonlyHttpMixin):
def get_file(self):
return KnitVersionedFile('foo', get_transport(self.get_url('.')),
delta=True, create=True)
def get_factory(self):
return KnitVersionedFile
class MergeCasesMixin(object):
def doMerge(self, base, a, b, mp):
from cStringIO import StringIO
from textwrap import dedent
def addcrlf(x):
return x + '\n'
w = self.get_file()
w.add_lines('text0', [], map(addcrlf, base))
w.add_lines('text1', ['text0'], map(addcrlf, a))
w.add_lines('text2', ['text0'], map(addcrlf, b))
self.log_contents(w)
self.log('merge plan:')
p = list(w.plan_merge('text1', 'text2'))
for state, line in p:
if line:
self.log('%12s | %s' % (state, line[:-1]))
self.log('merge:')
mt = StringIO()
mt.writelines(w.weave_merge(p))
mt.seek(0)
self.log(mt.getvalue())
mp = map(addcrlf, mp)
self.assertEqual(mt.readlines(), mp)
def testOneInsert(self):
self.doMerge([],
['aa'],
[],
['aa'])
def testSeparateInserts(self):
self.doMerge(['aaa', 'bbb', 'ccc'],
['aaa', 'xxx', 'bbb', 'ccc'],
['aaa', 'bbb', 'yyy', 'ccc'],
['aaa', 'xxx', 'bbb', 'yyy', 'ccc'])
def testSameInsert(self):
self.doMerge(['aaa', 'bbb', 'ccc'],
['aaa', 'xxx', 'bbb', 'ccc'],
['aaa', 'xxx', 'bbb', 'yyy', 'ccc'],
['aaa', 'xxx', 'bbb', 'yyy', 'ccc'])
overlappedInsertExpected = ['aaa', 'xxx', 'yyy', 'bbb']
def testOverlappedInsert(self):
self.doMerge(['aaa', 'bbb'],
['aaa', 'xxx', 'yyy', 'bbb'],
['aaa', 'xxx', 'bbb'], self.overlappedInsertExpected)
# really it ought to reduce this to
# ['aaa', 'xxx', 'yyy', 'bbb']
def testClashReplace(self):
self.doMerge(['aaa'],
['xxx'],
['yyy', 'zzz'],
['<<<<<<< ', 'xxx', '=======', 'yyy', 'zzz',
'>>>>>>> '])
def testNonClashInsert1(self):
self.doMerge(['aaa'],
['xxx', 'aaa'],
['yyy', 'zzz'],
['<<<<<<< ', 'xxx', 'aaa', '=======', 'yyy', 'zzz',
'>>>>>>> '])
def testNonClashInsert2(self):
self.doMerge(['aaa'],
['aaa'],
['yyy', 'zzz'],
['yyy', 'zzz'])
def testDeleteAndModify(self):
"""Clashing delete and modification.
If one side modifies a region and the other deletes it then
there should be a conflict with one side blank.
"""
#######################################
# skippd, not working yet
return
self.doMerge(['aaa', 'bbb', 'ccc'],
['aaa', 'ddd', 'ccc'],
['aaa', 'ccc'],
['<<<<<<<< ', 'aaa', '=======', '>>>>>>> ', 'ccc'])
def _test_merge_from_strings(self, base, a, b, expected):
w = self.get_file()
w.add_lines('text0', [], base.splitlines(True))
w.add_lines('text1', ['text0'], a.splitlines(True))
w.add_lines('text2', ['text0'], b.splitlines(True))
self.log('merge plan:')
p = list(w.plan_merge('text1', 'text2'))
for state, line in p:
if line:
self.log('%12s | %s' % (state, line[:-1]))
self.log('merge result:')
result_text = ''.join(w.weave_merge(p))
self.log(result_text)
self.assertEqualDiff(result_text, expected)
def test_weave_merge_conflicts(self):
# does weave merge properly handle plans that end with unchanged?
result = ''.join(self.get_file().weave_merge([('new-a', 'hello\n')]))
self.assertEqual(result, 'hello\n')
def test_deletion_extended(self):
"""One side deletes, the other deletes more.
"""
base = """\
line 1
line 2
line 3
"""
a = """\
line 1
line 2
"""
b = """\
line 1
"""
result = """\
line 1
"""
self._test_merge_from_strings(base, a, b, result)
def test_deletion_overlap(self):
"""Delete overlapping regions with no other conflict.
Arguably it'd be better to treat these as agreement, rather than
conflict, but for now conflict is safer.
"""
base = """\
start context
int a() {}
int b() {}
int c() {}
end context
"""
a = """\
start context
int a() {}
end context
"""
b = """\
start context
int c() {}
end context
"""
result = """\
start context
<<<<<<<
int a() {}
=======
int c() {}
>>>>>>>
end context
"""
self._test_merge_from_strings(base, a, b, result)
def test_agreement_deletion(self):
"""Agree to delete some lines, without conflicts."""
base = """\
start context
base line 1
base line 2
end context
"""
a = """\
start context
base line 1
end context
"""
b = """\
start context
base line 1
end context
"""
result = """\
start context
base line 1
end context
"""
self._test_merge_from_strings(base, a, b, result)
def test_sync_on_deletion(self):
"""Specific case of merge where we can synchronize incorrectly.
A previous version of the weave merge concluded that the two versions
agreed on deleting line 2, and this could be a synchronization point.
Line 1 was then considered in isolation, and thought to be deleted on
both sides.
It's better to consider the whole thing as a disagreement region.
"""
base = """\
start context
base line 1
base line 2
end context
"""
a = """\
start context
base line 1
a's replacement line 2
end context
"""
b = """\
start context
b replaces
both lines
end context
"""
result = """\
start context
<<<<<<<
base line 1
a's replacement line 2
=======
b replaces
both lines
>>>>>>>
end context
"""
self._test_merge_from_strings(base, a, b, result)
class TestKnitMerge(TestCaseWithTransport, MergeCasesMixin):
def get_file(self, name='foo'):
return KnitVersionedFile(name, get_transport(self.get_url('.')),
delta=True, create=True)
def log_contents(self, w):
pass
class TestWeaveMerge(TestCaseWithTransport, MergeCasesMixin):
def get_file(self, name='foo'):
return WeaveFile(name, get_transport(self.get_url('.')), create=True)
def log_contents(self, w):
self.log('weave is:')
tmpf = StringIO()
write_weave(w, tmpf)
self.log(tmpf.getvalue())
overlappedInsertExpected = ['aaa', '<<<<<<< ', 'xxx', 'yyy', '=======',
'xxx', '>>>>>>> ', 'bbb']
|