facebook/sapling
1
1
Fork 0
mirror of https://github.com/facebook/sapling.git synced 2024-10-07 23:38:50 +03:00
Code Issues Projects Releases Wiki Activity

dagop: use heap to compute max rev in filectxancestors()

Browse Source
This commit is contained in:
Yuya Nishihara 2016-09-22 18:41:51 +09:00
parent e49a4312a9
commit d7842061cc
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
mercurial/dagop.py
View File

@ -82,10 +82,12 @@ def filectxancestors(fctxs, followfirst=False):
Yields (rev, {fctx, ...}) pairs in descending order.
"""
visit = {}
visitheap = []
def addvisit(fctx):
rev = fctx.rev()
if rev not in visit:
visit[rev] = set()
heapq.heappush(visitheap, -rev) # max heap
visit[rev].add(fctx)
if followfirst:
@ -96,12 +98,13 @@ def filectxancestors(fctxs, followfirst=False):
for c in fctxs:
addvisit(c)
while visit:
currev = max(visit)
currev = -heapq.heappop(visitheap)
curfctxs = visit.pop(currev)
yield currev, curfctxs
for c in curfctxs:
for parent in c.parents()[:cut]:
addvisit(parent)
assert not visitheap
def filerevancestors(fctxs, followfirst=False):
"""Like filectx.ancestors(), but can walk from multiple files/revisions,