To get this branch, use:
bzr branch
http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar
« back to all changes in this revision
Viewing changes to bzrlib/weave.py
- browse files at revision 872
- compare with another revision
- download diff
- download tarball
- view history from revision 872
- Committer: Martin Pool
- Date: 2005-07-11 02:55:35 UTC
- Revision ID: mbp@sourcefrog.net-20050711025535-0990d4c48dce9542
- update testweave
- files removed:
- bzrlib/delta.py
- contrib/emacs
- files modified:
- .bzrignore
added
removed
bzrlib/weave.py
21
21
22
22
"""Weave - storage of related text file versions"""
23
23
24
# before intset (r923) 2000 versions in 41.5s
25
# with intset (r926) 2000 versions in 93s !!!
26
# better to just use plain sets.
27
28
# making _extract build and return a list, rather than being a generator
29
# takes 37.94s
30
31
# with python -O, r923 does 2000 versions in 36.87s
32
33
# with optimizations to avoid mutating lists - 35.75! I guess copying
34
# all the elements every time costs more than the small manipulations.
35
# a surprisingly small change.
36
37
# r931, which avoids using a generator for extract, does 36.98s
38
39
# with memoized inclusions, takes 41.49s; not very good
40
41
# with slots, takes 37.35s; without takes 39.16, a bit surprising
42
43
# with the delta calculation mixed in with the add method, rather than
44
# separated, takes 36.78s
45
46
# with delta folded in and mutation of the list, 36.13s
47
48
# with all this and simplification of add code, 33s
49
50
51
24
# TODO: Perhaps have copy method for Weave instances?
52
25
53
26
# XXX: If we do weaves this way, will a merge still behave the same
54
27
# way if it's done in a different order? That's a pretty desirable
55
28
# property.
56
29
30
# TODO: How to write these to disk? One option is cPickle, which
31
# would be fast but less friendly to C, and perhaps not portable. Another is
32
57
33
# TODO: Nothing here so far assumes the lines are really \n newlines,
58
34
# rather than being split up in some other way. We could accomodate
59
35
# binaries, perhaps by naively splitting on \n or perhaps using
60
36
# something like a rolling checksum.
61
37
38
# TODO: Perhaps track SHA-1 in the header for protection? This would
39
# be redundant with it being stored in the inventory, but perhaps
40
# usefully so?
41
62
42
# TODO: Track version names as well as indexes.
63
43
44
# TODO: Probably do transitive expansion when specifying parents?
45
46
# TODO: Separate out some code to read and write weaves.
47
64
48
# TODO: End marker for each version so we can stop reading?
65
49
66
50
# TODO: Check that no insertion occurs inside a deletion that was
67
51
# active in the version of the insertion.
68
52
69
# TODO: In addition to the SHA-1 check, perhaps have some code that
70
# checks structural constraints of the weave: ie that insertions are
71
# properly nested, that there is no text outside of an insertion, that
72
# insertions or deletions are not repeated, etc.
73
74
# TODO: Parallel-extract that passes back each line along with a
75
# description of which revisions include it. Nice for checking all
76
# shas in parallel.
77
78
53
# TODO: Perhaps a special slower check() method that verifies more
54
# nesting constraints and the MD5 of each version?
55
56
57
58
try:
59
set
60
frozenset
61
except NameError:
62
from sets import Set, ImmutableSet
63
set = Set
64
frozenset = ImmutableSet
65
del Set, ImmutableSet
79
66
80
67
81
68
class WeaveError(Exception):
107
94
the version-id is used to reference it in the larger world.
108
95
109
96
The weave is represented as a list mixing edit instructions and
110
literal text. Each entry in _weave can be either a string (or
97
literal text. Each entry in _l can be either a string (or
111
98
unicode), or a tuple. If a string, it means that the given line
112
99
should be output in the currently active revisions.
113
100
151
138
should be no way to get an earlier version deleting a later
152
139
version.
153
140
154
_weave
155
Text of the weave; list of control instruction tuples and strings.
156
157
_parents
158
List of parents, indexed by version number.
159
It is only necessary to store the minimal set of parents for
160
each version; the parent's parents are implied.
141
_l
142
Text of the weave.
143
144
_v
145
List of versions, indexed by index number.
146
147
For each version we store the set (included_versions), which
148
lists the previous versions also considered active; the
149
versions included in those versions are included transitively.
150
So new versions created from nothing list []; most versions
151
have a single entry; some have more.
161
152
162
153
_sha1s
163
154
List of hex SHA-1 of each version, or None if not recorded.
164
155
"""
165
166
__slots__ = ['_weave', '_parents', '_sha1s']
167
168
156
def __init__(self):
169
self._weave = []
170
self._parents = []
157
self._l = []
158
self._v = []
171
159
self._sha1s = []
172
160
173
161
174
162
def __eq__(self, other):
175
163
if not isinstance(other, Weave):
176
164
return False
177
return self._parents == other._parents \
178
and self._weave == other._weave
165
return self._v == other._v \
166
and self._l == other._l
179
167
180
168
181
169
def __ne__(self, other):
188
176
Returns the index number of the newly added version.
189
177
190
178
parents
191
List or set of direct parent version numbers.
192
179
List or set of parent version numbers. This must normally include
180
the parents and the parent's parents, or wierd things might happen.
181
193
182
text
194
183
Sequence of lines to be added in the new version."""
195
196
self._check_versions(parents)
184
## self._check_versions(parents)
197
185
## self._check_lines(text)
198
new_version = len(self._parents)
186
idx = len(self._v)
199
187
200
188
import sha
201
189
s = sha.new()
202
map(s.update, text)
190
for l in text:
191
s.update(l)
203
192
sha1 = s.hexdigest()
204
193
del s
205
194
206
# if we abort after here the weave will be corrupt
207
self._parents.append(frozenset(parents))
195
if parents:
196
delta = self._delta(self.inclusions(parents), text)
197
198
# offset gives the number of lines that have been inserted
199
# into the weave up to the current point; if the original edit instruction
200
# says to change line A then we actually change (A+offset)
201
offset = 0
202
203
for i1, i2, newlines in delta:
204
assert 0 <= i1
205
assert i1 <= i2
206
assert i2 <= len(self._l)
207
208
# the deletion and insertion are handled separately.
209
# first delete the region.
210
if i1 != i2:
211
self._l.insert(i1+offset, ('[', idx))
212
self._l.insert(i2+offset+1, (']', idx))
213
offset += 2
214
# is this OK???
215
216
if newlines:
217
# there may have been a deletion spanning up to
218
# i2; we want to insert after this region to make sure
219
# we don't destroy ourselves
220
i = i2 + offset
221
self._l[i:i] = [('{', idx)] \
222
+ newlines \
223
+ [('}', idx)]
224
offset += 2 + len(newlines)
225
226
self._addversion(parents)
227
else:
228
# special case; adding with no parents revision; can do this
229
# more quickly by just appending unconditionally
230
self._l.append(('{', idx))
231
self._l += text
232
self._l.append(('}', idx))
233
234
self._addversion(None)
235
208
236
self._sha1s.append(sha1)
209
210
211
if not parents:
212
# special case; adding with no parents revision; can do
213
# this more quickly by just appending unconditionally.
214
# even more specially, if we're adding an empty text we
215
# need do nothing at all.
216
if text:
217
self._weave.append(('{', new_version))
218
self._weave.extend(text)
219
self._weave.append(('}', new_version))
220
221
return new_version
222
223
if len(parents) == 1:
224
pv = list(parents)[0]
225
if sha1 == self._sha1s[pv]:
226
# special case: same as the single parent
227
return new_version
228
229
230
ancestors = self.inclusions(parents)
231
232
l = self._weave
233
234
# basis a list of (origin, lineno, line)
235
basis_lineno = []
236
basis_lines = []
237
for origin, lineno, line in self._extract(ancestors):
238
basis_lineno.append(lineno)
239
basis_lines.append(line)
240
241
# another small special case: a merge, producing the same text as auto-merge
242
if text == basis_lines:
243
return new_version
244
245
# add a sentinal, because we can also match against the final line
246
basis_lineno.append(len(self._weave))
247
248
# XXX: which line of the weave should we really consider
249
# matches the end of the file? the current code says it's the
250
# last line of the weave?
251
252
#print 'basis_lines:', basis_lines
253
#print 'new_lines: ', lines
254
255
from difflib import SequenceMatcher
256
s = SequenceMatcher(None, basis_lines, text)
257
258
# offset gives the number of lines that have been inserted
259
# into the weave up to the current point; if the original edit instruction
260
# says to change line A then we actually change (A+offset)
261
offset = 0
262
263
for tag, i1, i2, j1, j2 in s.get_opcodes():
264
# i1,i2 are given in offsets within basis_lines; we need to map them
265
# back to offsets within the entire weave
266
#print 'raw match', tag, i1, i2, j1, j2
267
if tag == 'equal':
268
continue
269
270
i1 = basis_lineno[i1]
271
i2 = basis_lineno[i2]
272
273
assert 0 <= j1 <= j2 <= len(text)
274
275
#print tag, i1, i2, j1, j2
276
277
# the deletion and insertion are handled separately.
278
# first delete the region.
279
if i1 != i2:
280
self._weave.insert(i1+offset, ('[', new_version))
281
self._weave.insert(i2+offset+1, (']', new_version))
282
offset += 2
283
284
if j1 != j2:
285
# there may have been a deletion spanning up to
286
# i2; we want to insert after this region to make sure
287
# we don't destroy ourselves
288
i = i2 + offset
289
self._weave[i:i] = ([('{', new_version)]
290
+ text[j1:j2]
291
+ [('}', new_version)])
292
offset += 2 + (j2 - j1)
293
294
return new_version
237
238
return idx
295
239
296
240
297
241
def inclusions(self, versions):
298
"""Return set of all ancestors of given version(s)."""
242
"""Expand out everything included by versions."""
299
243
i = set(versions)
300
v = max(versions)
301
try:
302
while v >= 0:
303
if v in i:
304
# include all its parents
305
i.update(self._parents[v])
306
v -= 1
307
return i
308
except IndexError:
309
raise ValueError("version %d not present in weave" % v)
310
311
312
def minimal_parents(self, version):
313
"""Find the minimal set of parents for the version."""
314
included = self._parents[version]
315
if not included:
316
return []
317
318
li = list(included)
319
li.sort(reverse=True)
320
321
mininc = []
322
gotit = set()
323
324
for pv in li:
325
if pv not in gotit:
326
mininc.append(pv)
327
gotit.update(self.inclusions(pv))
328
329
assert mininc[0] >= 0
330
assert mininc[-1] < version
331
return mininc
332
244
for v in versions:
245
try:
246
i.update(self._v[v])
247
except IndexError:
248
raise ValueError("version %d not present in weave" % v)
249
return i
250
251
252
def _addversion(self, parents):
253
if parents:
254
self._v.append(frozenset(parents))
255
else:
256
self._v.append(frozenset())
333
257
334
258
335
259
def _check_lines(self, text):
347
271
"""Check everything in the sequence of indexes is valid"""
348
272
for i in indexes:
349
273
try:
350
self._parents[i]
274
self._v[i]
351
275
except IndexError:
352
276
raise IndexError("invalid version number %r" % i)
353
277
360
284
"""Yield list of (index-id, line) pairs for the specified version.
361
285
362
286
The index indicates when the line originated in the weave."""
363
for origin, lineno, text in self._extract([version]):
287
included = self.inclusions([version])
288
for origin, lineno, text in self._extract(included):
364
289
yield origin, text
365
290
366
291
367
def _walk(self):
368
"""Walk the weave.
369
370
Yields sequence of
371
(lineno, insert, deletes, text)
372
for each literal line.
373
"""
374
375
istack = []
376
dset = set()
377
378
lineno = 0 # line of weave, 0-based
379
380
for l in self._weave:
381
if isinstance(l, tuple):
382
c, v = l
383
isactive = None
384
if c == '{':
385
istack.append(v)
386
elif c == '}':
387
oldv = istack.pop()
388
elif c == '[':
389
assert v not in dset
390
dset.add(v)
391
elif c == ']':
392
dset.remove(v)
393
else:
394
raise WeaveFormatError('unexpected instruction %r'
395
% v)
396
else:
397
assert isinstance(l, basestring)
398
assert istack
399
yield lineno, istack[-1], dset, l
400
lineno += 1
401
402
403
404
def _extract(self, versions):
292
def _extract(self, included):
405
293
"""Yield annotation of lines in included set.
406
294
407
295
Yields a sequence of tuples (origin, lineno, text), where
410
298
411
299
The set typically but not necessarily corresponds to a version.
412
300
"""
413
included = self.inclusions(versions)
414
415
istack = []
416
dset = set()
417
418
lineno = 0 # line of weave, 0-based
301
istack = [] # versions for which an insertion block is current
302
303
dset = set() # versions for which a deletion block is current
419
304
420
305
isactive = None
421
306
422
result = []
307
lineno = 0 # line of weave, 0-based
308
309
# TODO: Probably only need to put included revisions in the istack
310
311
# TODO: Could split this into two functions, one that updates
312
# the stack and the other that processes the results -- but
313
# I'm not sure it's really needed.
314
315
# TODO: In fact, I think we only need to store the *count* of
316
# active insertions and deletions, and we can maintain that by
317
# just by just counting as we go along.
423
318
424
319
WFE = WeaveFormatError
425
320
426
for l in self._weave:
321
for l in self._l:
427
322
if isinstance(l, tuple):
323
isactive = None # recalculate
428
324
c, v = l
429
isactive = None
430
325
if c == '{':
431
assert v not in istack
326
if istack and (istack[-1] >= v):
327
raise WFE("improperly nested insertions %d>=%d on line %d"
328
% (istack[-1], v, lineno))
432
329
istack.append(v)
433
330
elif c == '}':
434
oldv = istack.pop()
435
assert oldv == v
331
try:
332
oldv = istack.pop()
333
except IndexError:
334
raise WFE("unmatched close of insertion %d on line %d"
335
% (v, lineno))
336
if oldv != v:
337
raise WFE("mismatched close of insertion %d!=%d on line %d"
338
% (oldv, v, lineno))
436
339
elif c == '[':
437
if v in included:
438
assert v not in dset
340
# block deleted in v
341
if v in dset:
342
raise WFE("repeated deletion marker for version %d on line %d"
343
% (v, lineno))
344
if istack:
345
if istack[-1] == v:
346
raise WFE("version %d deletes own text on line %d"
347
% (v, lineno))
348
# XXX
439
349
dset.add(v)
440
else:
441
assert c == ']'
442
if v in included:
443
assert v in dset
350
elif c == ']':
351
if v in dset:
444
352
dset.remove(v)
353
else:
354
raise WFE("unmatched close of deletion %d on line %d"
355
% (v, lineno))
356
else:
357
raise WFE("invalid processing instruction %r on line %d"
358
% (l, lineno))
445
359
else:
446
360
assert isinstance(l, basestring)
447
if isactive is None:
448
isactive = (not dset) and istack and (istack[-1] in included)
361
if not istack:
362
raise WFE("literal at top level on line %d"
363
% lineno)
364
if isactive == None:
365
isactive = (istack[-1] in included) \
366
and not included.intersection(dset)
449
367
if isactive:
450
result.append((istack[-1], lineno, l))
368
origin = istack[-1]
369
yield origin, lineno, l
451
370
lineno += 1
452
371
453
372
if istack:
457
376
raise WFE("unclosed deletion blocks at end of weave",
458
377
dset)
459
378
460
return result
461
462
463
379
464
380
def get_iter(self, version):
465
381
"""Yield lines for the specified version."""
466
for origin, lineno, line in self._extract([version]):
382
for origin, lineno, line in self._extract(self.inclusions([version])):
467
383
yield line
468
384
469
385
473
389
474
390
def mash_iter(self, included):
475
391
"""Return composed version of multiple included versions."""
392
included = frozenset(included)
476
393
for origin, lineno, text in self._extract(included):
477
394
yield text
478
395
479
396
480
397
def dump(self, to_file):
481
398
from pprint import pprint
482
print >>to_file, "Weave._weave = ",
483
pprint(self._weave, to_file)
484
print >>to_file, "Weave._parents = ",
485
pprint(self._parents, to_file)
399
print >>to_file, "Weave._l = ",
400
pprint(self._l, to_file)
401
print >>to_file, "Weave._v = ",
402
pprint(self._v, to_file)
486
403
487
404
488
405
489
406
def numversions(self):
490
l = len(self._parents)
407
l = len(self._v)
491
408
assert l == len(self._sha1s)
492
409
return l
493
410
494
411
495
def __len__(self):
496
return self.numversions()
497
498
499
def check(self, progress_bar=None):
412
def check(self):
500
413
# check no circular inclusions
501
414
for version in range(self.numversions()):
502
inclusions = list(self._parents[version])
415
inclusions = list(self._v[version])
503
416
if inclusions:
504
417
inclusions.sort()
505
418
if inclusions[-1] >= version:
509
422
# try extracting all versions; this is a bit slow and parallel
510
423
# extraction could be used
511
424
import sha
512
nv = self.numversions()
513
for version in range(nv):
514
if progress_bar:
515
progress_bar.update('checking text', version, nv)
425
for version in range(self.numversions()):
516
426
s = sha.new()
517
427
for l in self.get_iter(version):
518
428
s.update(l)
523
433
"got %s, expected %s"
524
434
% (version, hd, expected))
525
435
526
# TODO: check insertions are properly nested, that there are
527
# no lines outside of insertion blocks, that deletions are
528
# properly paired, etc.
529
530
436
531
437
532
438
def merge(self, merge_versions):
565
471
If line1=line2, this is a pure insert; if newlines=[] this is a
566
472
pure delete. (Similar to difflib.)
567
473
"""
568
569
570
571
def plan_merge(self, ver_a, ver_b):
572
"""Return pseudo-annotation indicating how the two versions merge.
573
574
This is computed between versions a and b and their common
575
base.
576
577
Weave lines present in none of them are skipped entirely.
578
"""
579
inc_a = self.inclusions([ver_a])
580
inc_b = self.inclusions([ver_b])
581
inc_c = inc_a & inc_b
582
583
for lineno, insert, deleteset, line in self._walk():
584
if deleteset & inc_c:
585
# killed in parent; can't be in either a or b
586
# not relevant to our work
587
yield 'killed-base', line
588
elif insert in inc_c:
589
# was inserted in base
590
killed_a = bool(deleteset & inc_a)
591
killed_b = bool(deleteset & inc_b)
592
if killed_a and killed_b:
593
yield 'killed-both', line
594
elif killed_a:
595
yield 'killed-a', line
596
elif killed_b:
597
yield 'killed-b', line
598
else:
599
yield 'unchanged', line
600
elif insert in inc_a:
601
if deleteset & inc_a:
602
yield 'ghost-a', line
603
else:
604
# new in A; not in B
605
yield 'new-a', line
606
elif insert in inc_b:
607
if deleteset & inc_b:
608
yield 'ghost-b', line
609
else:
610
yield 'new-b', line
611
else:
612
# not in either revision
613
yield 'irrelevant', line
614
615
yield 'unchanged', '' # terminator
616
617
618
619
def weave_merge(self, plan):
620
lines_a = []
621
lines_b = []
622
ch_a = ch_b = False
623
624
for state, line in plan:
625
if state == 'unchanged' or state == 'killed-both':
626
# resync and flush queued conflicts changes if any
627
if not lines_a and not lines_b:
628
pass
629
elif ch_a and not ch_b:
630
# one-sided change:
631
for l in lines_a: yield l
632
elif ch_b and not ch_a:
633
for l in lines_b: yield l
634
elif lines_a == lines_b:
635
for l in lines_a: yield l
636
else:
637
yield '<<<<\n'
638
for l in lines_a: yield l
639
yield '====\n'
640
for l in lines_b: yield l
641
yield '>>>>\n'
642
643
del lines_a[:]
644
del lines_b[:]
645
ch_a = ch_b = False
646
647
if state == 'unchanged':
648
if line:
649
yield line
650
elif state == 'killed-a':
651
ch_a = True
652
lines_b.append(line)
653
elif state == 'killed-b':
654
ch_b = True
655
lines_a.append(line)
656
elif state == 'new-a':
657
ch_a = True
658
lines_a.append(line)
659
elif state == 'new-b':
660
ch_b = True
661
lines_b.append(line)
662
else:
663
assert state in ('irrelevant', 'ghost-a', 'ghost-b', 'killed-base',
664
'killed-both'), \
665
state
666
667
668
669
670
671
672
673
def weave_info(w):
474
# basis a list of (origin, lineno, line)
475
basis_lineno = []
476
basis_lines = []
477
for origin, lineno, line in self._extract(included):
478
basis_lineno.append(lineno)
479
basis_lines.append(line)
480
481
# add a sentinal, because we can also match against the final line
482
basis_lineno.append(len(self._l))
483
484
# XXX: which line of the weave should we really consider
485
# matches the end of the file? the current code says it's the
486
# last line of the weave?
487
488
from difflib import SequenceMatcher
489
s = SequenceMatcher(None, basis_lines, lines)
490
491
# TODO: Perhaps return line numbers from composed weave as well?
492
493
for tag, i1, i2, j1, j2 in s.get_opcodes():
494
##print tag, i1, i2, j1, j2
495
496
if tag == 'equal':
497
continue
498
499
# i1,i2 are given in offsets within basis_lines; we need to map them
500
# back to offsets within the entire weave
501
real_i1 = basis_lineno[i1]
502
real_i2 = basis_lineno[i2]
503
504
assert 0 <= j1
505
assert j1 <= j2
506
assert j2 <= len(lines)
507
508
yield real_i1, real_i2, lines[j1:j2]
509
510
511
512
def weave_info(filename, out):
674
513
"""Show some text information about the weave."""
675
print '%6s %40s %20s' % ('ver', 'sha1', 'parents')
676
for i in (6, 40, 20):
677
print '-' * i,
678
print
679
for i in range(w.numversions()):
680
sha1 = w._sha1s[i]
681
print '%6d %40s %s' % (i, sha1, ' '.join(map(str, w._parents[i])))
682
683
684
685
def weave_stats(weave_file):
686
from bzrlib.progress import ProgressBar
687
from bzrlib.weavefile import read_weave
688
689
pb = ProgressBar()
690
691
wf = file(weave_file, 'rb')
514
from weavefile import read_weave
515
wf = file(filename, 'rb')
692
516
w = read_weave(wf)
693
517
# FIXME: doesn't work on pipes
694
518
weave_size = wf.tell()
519
print >>out, "weave file size %d bytes" % weave_size
520
print >>out, "weave contains %d versions" % len(w._v)
695
521
696
522
total = 0
697
vers = len(w)
698
for i in range(vers):
699
pb.update('checking sizes', i, vers)
700
for line in w.get_iter(i):
701
total += len(line)
702
703
pb.clear()
704
705
print 'versions %9d' % vers
706
print 'weave file %9d bytes' % weave_size
707
print 'total contents %9d bytes' % total
708
print 'compression ratio %9.2fx' % (float(total) / float(weave_size))
709
523
print '%6s %6s %8s %40s %20s' % ('ver', 'lines', 'bytes', 'sha1', 'parents')
524
for i in (6, 6, 8, 40, 20):
525
print '-' * i,
526
print
527
for i in range(len(w._v)):
528
text = w.get(i)
529
lines = len(text)
530
bytes = sum((len(a) for a in text))
531
sha1 = w._sha1s[i]
532
print '%6d %6d %8d %40s' % (i, lines, bytes, sha1),
533
print ', '.join(map(str, w._v[i]))
534
total += bytes
535
536
print >>out, "versions total %d bytes" % total
537
print >>out, "compression ratio %.3f" % (float(total)/float(weave_size))
710
538
711
539
712
540
def usage():
762
590
import sys
763
591
import os
764
592
from weavefile import write_weave, read_weave
765
from bzrlib.progress import ProgressBar
766
767
#import psyco
768
#psyco.full()
769
770
593
cmd = argv[1]
771
594
772
595
def readit():
810
633
lasto = origin
811
634
812
635
elif cmd == 'info':
813
weave_info(readit())
814
815
elif cmd == 'stats':
816
weave_stats(argv[2])
636
weave_info(argv[2], sys.stdout)
817
637
818
638
elif cmd == 'check':
819
639
w = readit()
820
pb = ProgressBar()
821
w.check(pb)
822
pb.clear()
823
print '%d versions ok' % w.numversions()
824
825
elif cmd == 'inclusions':
826
w = readit()
827
print ' '.join(map(str, w.inclusions([int(argv[3])])))
828
829
elif cmd == 'parents':
830
w = readit()
831
print ' '.join(map(str, w._parents[int(argv[3])]))
832
833
elif cmd == 'plan-merge':
834
w = readit()
835
for state, line in w.plan_merge(int(argv[3]), int(argv[4])):
836
if line:
837
print '%14s | %s' % (state, line),
640
w.check()
838
641
839
642
elif cmd == 'merge':
840
w = readit()
841
p = w.plan_merge(int(argv[3]), int(argv[4]))
842
sys.stdout.writelines(w.weave_merge(p))
843
844
elif cmd == 'mash-merge':
845
643
if len(argv) != 5:
846
644
usage()
847
645
return 1
Loggerhead is a web-based interface for Breezy
Version: 2.0.2.dev0