--- a/mercurial/phases.py Tue Jul 17 01:04:45 2012 +0200
+++ b/mercurial/phases.py Tue Jul 17 01:22:31 2012 +0200
@@ -329,43 +329,6 @@
finally:
lock.release()
-def visibleheads(repo):
- """return the set of visible head of this repo"""
- # XXX we want a cache on this
- sroots = repo._phasecache.phaseroots[secret]
- if sroots:
- # XXX very slow revset. storing heads or secret "boundary" would help.
- revset = repo.set('heads(not (%ln::))', sroots)
-
- vheads = [ctx.node() for ctx in revset]
- if not vheads:
- vheads.append(nullid)
- else:
- vheads = repo.heads()
- return vheads
-
-def visiblebranchmap(repo):
- """return a branchmap for the visible set"""
- # XXX Recomputing this data on the fly is very slow. We should build a
- # XXX cached version while computin the standard branchmap version.
- sroots = repo._phasecache.phaseroots[secret]
- if sroots:
- vbranchmap = {}
- for branch, nodes in repo.branchmap().iteritems():
- # search for secret heads.
- for n in nodes:
- if repo[n].phase() >= secret:
- nodes = None
- break
- # if secreat heads where found we must compute them again
- if nodes is None:
- s = repo.set('heads(branch(%s) - secret())', branch)
- nodes = [c.node() for c in s]
- vbranchmap[branch] = nodes
- else:
- vbranchmap = repo.branchmap()
- return vbranchmap
-
def analyzeremotephases(repo, subset, roots):
"""Compute phases heads and root in a subset of node from root dict