Mercurial > public > mercurial-scm > hg
annotate mercurial/strutil.py @ 5909:f45f7390c1c5
strip: calculate list of extra nodes to save and pass it to changegroupsubset
When we remove revision N from the repository, all revisions >= N are
affected: either it's a descendant from N and will also be removed, or
it's not a descendant of N and will be renumbered.
As a consequence, we have to (at least temporarily) remove all filelog
and manifest revisions that have a linkrev >= N, readding some of them
later.
Unfortunately, it's possible to have a revlog with two revisions
r1 and r2 such that r1 < r2, but linkrev(r1) > linkrev(r2). If we try
to strip revision linkrev(r1) from the repository, we'll also lose
revision r2 when we truncate this revlog.
We already use changegroupsubset to create a temporary changegroup
containing the revisions that have to be restored, but that function is
unable to detect that we also wanted to save the r2 in the case above.
So we manually calculate these extra nodes and pass it to changegroupsubset.
This should fix issue764.
| author | Alexis S. L. Carvalho <alexis@cecm.usp.br> |
|---|---|
| date | Sat, 19 Jan 2008 18:01:16 -0200 |
| parents | 3d5547845158 |
| children | af1117f37fa7 |
| rev | line source |
|---|---|
| 2953 | 1 # strutil.py - string utilities for Mercurial |
| 2 # | |
| 3 # Copyright 2006 Vadim Gelfer <vadim.gelfer@gmail.com> | |
| 4 # | |
| 5 # This software may be used and distributed according to the terms | |
| 6 # of the GNU General Public License, incorporated herein by reference. | |
| 7 | |
| 8 def findall(haystack, needle, start=0, end=None): | |
| 9 if end is None: | |
| 10 end = len(haystack) | |
| 11 if end < 0: | |
| 12 end += len(haystack) | |
| 13 if start < 0: | |
| 14 start += len(haystack) | |
| 15 while start < end: | |
| 16 c = haystack.find(needle, start, end) | |
| 17 if c == -1: | |
| 18 break | |
| 19 yield c | |
| 20 start = c + 1 | |
| 21 | |
| 22 def rfindall(haystack, needle, start=0, end=None): | |
| 23 if end is None: | |
| 24 end = len(haystack) | |
| 25 if end < 0: | |
| 26 end += len(haystack) | |
| 27 if start < 0: | |
| 28 start += len(haystack) | |
| 29 while end >= 0: | |
| 30 c = haystack.rfind(needle, start, end) | |
| 31 if c == -1: | |
| 32 break | |
| 33 yield c | |
| 34 end = c - 1 |