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
|
# Copyright (C) 2005 by 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
"""test suite for weave algorithm"""
from testsweet import TestBase
from weave import Weave, VerInfo, WeaveFormatError
# texts for use in testing
TEXT_0 = ["Hello world"]
TEXT_1 = ["Hello world",
"A second line"]
class Easy(TestBase):
def runTest(self):
k = Weave()
class StoreText(TestBase):
"""Store and retrieve a simple text."""
def runTest(self):
k = Weave()
idx = k.add([], TEXT_0)
self.assertEqual(k.get(idx), TEXT_0)
self.assertEqual(idx, 0)
class AnnotateOne(TestBase):
def runTest(self):
k = Weave()
k.add([], TEXT_0)
self.assertEqual(k.annotate(0),
[(0, TEXT_0[0])])
class StoreTwo(TestBase):
def runTest(self):
k = Weave()
idx = k.add([], TEXT_0)
self.assertEqual(idx, 0)
idx = k.add([], TEXT_1)
self.assertEqual(idx, 1)
self.assertEqual(k.get(0), TEXT_0)
self.assertEqual(k.get(1), TEXT_1)
k.dump(self.TEST_LOG)
class Delta1(TestBase):
"""Detection of changes prior to inserting new revision."""
def runTest(self):
return ########################## SKIPPED
from pprint import pformat
k = Weave()
k.add([], ['line 1'])
changes = list(k._delta(set([0]),
['line 1',
'new line']))
self.log('raw changes: ' + pformat(changes))
# should be one inserted line after line 0q
self.assertEquals(changes,
[(1, 1, ['new line'])])
changes = k._delta(set([0]),
['top line',
'line 1'])
self.assertEquals(list(changes),
[(0, 0, ['top line'])])
class InvalidAdd(TestBase):
"""Try to use invalid version number during add."""
def runTest(self):
k = Weave()
self.assertRaises(IndexError,
k.add,
[69],
['new text!'])
class InsertLines(TestBase):
"""Store a revision that adds one line to the original.
Look at the annotations to make sure that the first line is matched
and not stored repeatedly."""
def runTest(self):
return ########################## SKIPPED
k = Weave()
k.add([], ['line 1'])
k.add([0], ['line 1', 'line 2'])
self.assertEqual(k.annotate(0),
[(0, 'line 1')])
self.assertEqual(k.get(1),
['line 1',
'line 2'])
self.assertEqual(k.annotate(1),
[(0, 'line 1'),
(1, 'line 2')])
k.add([0], ['line 1', 'diverged line'])
self.assertEqual(k.annotate(2),
[(0, 'line 1'),
(2, 'diverged line')])
k.add([0, 1],
['line 1', 'middle line', 'line 2'])
self.assertEqual(k.annotate(3),
[(0, 'line 1'),
(3, 'middle line'),
(1, 'line 2')])
# now multiple insertions at different places
k.add([0, 1, 3],
['line 1', 'aaa', 'middle line', 'bbb', 'line 2', 'ccc'])
self.assertEqual(k.annotate(4),
[(0, 'line 1'),
(4, 'aaa'),
(3, 'middle line'),
(4, 'bbb'),
(1, 'line 2'),
(4, 'ccc')])
class CannedDelete(TestBase):
"""Unpack canned weave with deleted lines."""
def runTest(self):
k = Weave()
k._v = [VerInfo([]),
VerInfo([0]),
]
k._l = [('{', 0),
'first line',
('[', 1),
'line to be deleted',
(']', 1),
'last line',
('}', 0),
]
self.assertEqual(k.get(0),
['first line',
'line to be deleted',
'last line',
])
class BadWeave(TestBase):
"""Test that we trap an insert which should not occur."""
def runTest(self):
k = Weave()
k._v = [VerInfo([]),
]
k._l = ['bad line',
('{', 0),
'foo {',
('{', 1),
' added in version 1',
('{', 2),
' added in v2',
('}', 2),
' also from v1',
('}', 1),
'}',
('}', 0)]
self.assertRaises(WeaveFormatError,
k.get,
0)
class BadInsert(TestBase):
"""Test that we trap an insert which should not occur."""
def runTest(self):
k = Weave()
k._v = [VerInfo([]),
VerInfo([0]),
VerInfo([0]),
VerInfo([0,1,2]),
]
k._l = [('{', 0),
'foo {',
('{', 1),
' added in version 1',
('{', 1),
' more in 1',
('}', 1),
('}', 1),
('}', 0)]
self.assertRaises(WeaveFormatError,
k.get,
0)
self.assertRaises(WeaveFormatError,
k.get,
1)
class InsertNested(TestBase):
"""Insertion with nested instructions."""
def runTest(self):
k = Weave()
k._v = [VerInfo([]),
VerInfo([0]),
VerInfo([0]),
VerInfo([0,1,2]),
]
k._l = [('{', 0),
'foo {',
('{', 1),
' added in version 1',
('{', 2),
' added in v2',
('}', 2),
' also from v1',
('}', 1),
'}',
('}', 0)]
self.assertEqual(k.get(0),
['foo {',
'}'])
self.assertEqual(k.get(1),
['foo {',
' added in version 1',
' also from v1',
'}'])
self.assertEqual(k.get(2),
['foo {',
' added in v2',
'}'])
self.assertEqual(k.get(3),
['foo {',
' added in version 1',
' added in v2',
' also from v1',
'}'])
class DeleteLines(TestBase):
"""Test recording revisions that delete lines.
This relies on the weave having a way to represent lines knocked
out by a later revision."""
def runTest(self):
k = Weave()
k.add([], ["line the first",
"line 2",
"line 3",
"fine"])
self.assertEqual(len(k.get(0)), 4)
return ################################## SKIPPED
k.add([0], ["line the first",
"fine"])
self.assertEqual(k.get(1),
["line the first",
"fine"])
class IncludeVersions(TestBase):
"""Check texts that are stored across multiple revisions.
Here we manually create a weave with particular encoding and make
sure it unpacks properly.
Text 0 includes nothing; text 1 includes text 0 and adds some
lines.
"""
def runTest(self):
k = Weave()
k._v = [VerInfo(), VerInfo(included=[0])]
k._l = [('{', 0),
"first line",
('}', 0),
('{', 1),
"second line",
('}', 1)]
self.assertEqual(k.get(1),
["first line",
"second line"])
self.assertEqual(k.get(0),
["first line"])
k.dump(self.TEST_LOG)
class DivergedIncludes(TestBase):
"""Weave with two diverged texts based on version 0.
"""
def runTest(self):
k = Weave()
k._v = [VerInfo(),
VerInfo(included=[0]),
VerInfo(included=[0]),
]
k._l = [('{', 0),
"first line",
('}', 0),
('{', 1),
"second line",
('}', 1),
('{', 2),
"alternative second line",
('}', 2),
]
self.assertEqual(k.get(0),
["first line"])
self.assertEqual(k.get(1),
["first line",
"second line"])
self.assertEqual(k.get(2),
["first line",
"alternative second line"])
def testweave():
import testsweet
from unittest import TestSuite, TestLoader
import testweave
tl = TestLoader()
suite = TestSuite()
suite.addTest(tl.loadTestsFromModule(testweave))
return int(not testsweet.run_suite(suite)) # for shell 0=true
if __name__ == '__main__':
import sys
sys.exit(testweave())
|