[PATCH 1 of 2] revlogdag: add linearize function
Sune Foldager
cryo at cyanite.org
Tue May 17 15:36:39 CDT 2011
# HG changeset patch
# User Sune Foldager <cryo at cyanite.org>
# Date 1305664419 -7200
# Node ID d29b9d6e76eca602c879a76427fec813929335d1
# Parent bf85c2639700e7e56c01afaf7e33e818ec922919
revlogdag: add linearize function
See the docstring for a detailed explanation. The linearizer was originally
written by Benoit Boissinot.
diff -r bf85c2639700 -r d29b9d6e76ec mercurial/dagutil.py
--- a/mercurial/dagutil.py Mon May 16 16:59:45 2011 -0500
+++ b/mercurial/dagutil.py Tue May 17 22:33:39 2011 +0200
@@ -205,6 +205,33 @@
assert headrevs
return headrevs
+ def linearize(self, ixs):
+ '''linearize and topologically sort a list of revisions
+
+ The linearization process tries to create long runs of revs where
+ a child rev comes immediately after its first parent. This is done by
+ visiting the heads of the given revs in inverse topological order,
+ and for each visited rev, visiting its second parent, then its first
+ parent, then adding the rev itself to the output list.
+ '''
+ sorted = []
+ visit = list(self.headsetofconnecteds(ixs))
+ visit.sort(reverse=True)
+ finished = set()
+
+ while visit:
+ cur = visit.pop()
+ if cur < 0:
+ cur = -cur - 1
+ if cur not in finished:
+ sorted.append(cur)
+ finished.add(cur)
+ else:
+ visit.append(-cur - 1)
+ visit += [p for p in self.parents(cur) if p not in finished]
+ assert len(sorted) == len(ixs)
+ return sorted
+
class inverserevlogdag(revlogbaseddag, genericdag):
'''inverse of an existing revlog dag; see revlogdag.inverse()'''
More information about the Mercurial-devel
mailing list