Mercurial > hg > mercurial-crew-with-dirclash
annotate mercurial/strutil.py @ 5192:33015dac5df5
convert: fix mercurial_sink.putcommit
Changeset 4ebc8693ce72 added some code to putcommit to avoid creating a
revision that touches no files, but this can break regular conversions
from some repositories:
- conceptually, since we're converting a repo, we should try to make
the new hg repo as similar as possible to the original repo - we
should create a new changeset, even if the original revision didn't
touch any files (maybe the commit message had some important bit);
- even if a "regular" revision that doesn't touch any file may seem
weird (and maybe even broken), it's completely legitimate for a merge
revision to not touch any file, and, if we just skip it, the
converted repo will end up with wrong history and possibly an extra
head.
As an example, say the crew and main hg repos are sync'ed. Somebody
sends an important patch to the mailing list. Matt quickly applies
and pushes it. But at the same time somebody also applies it to crew
and pushes it. Suppose the commit message ended up being a bit
different (say, there was a typo and somebody didn't fix it) or that
the date ended up being different (because of different patch-applying
scripts): the changeset hashes will be different, but the manifests
will be the same.
Since both changesets were pushed to public repos, it's hard to recall
them. If both are merged, the manifest from the resulting merge
revision will have the exact same contents as its parents - i.e. the
merge revision really doesn't touch any file at all.
To keep the file filtering stuff "working", the generic code was changed
to skip empty revisions if we're filtering the repo, fixing a bug in the
process (we want parents[0] instead of tip).
| author | Alexis S. L. Carvalho <alexis@cecm.usp.br> |
|---|---|
| date | Fri, 17 Aug 2007 20:18:05 -0300 |
| parents | 3d5547845158 |
| children |
| 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 |