Mercurial > public > mercurial-scm > hg
diff mercurial/revlog.py @ 3360:ef8307585b41
nodesbetween: fix a bug with duplicate heads
author | Benoit Boissinot <benoit.boissinot@ens-lyon.org> |
---|---|
date | Thu, 12 Oct 2006 11:40:26 +0200 |
parents | 9061613c1593 |
children | a74addddd092 |
line wrap: on
line diff
--- a/mercurial/revlog.py Wed Oct 11 16:56:41 2006 -0700 +++ b/mercurial/revlog.py Thu Oct 12 11:40:26 2006 +0200 @@ -599,12 +599,12 @@ if not heads: return nonodes ancestors = {} - # Start at the top and keep marking parents until we're done. - nodestotag = heads[:] # Turn heads into a dictionary so we can remove 'fake' heads. # Also, later we will be using it to filter out the heads we can't # find from roots. heads = dict.fromkeys(heads, 0) + # Start at the top and keep marking parents until we're done. + nodestotag = heads.keys() # Remember where the top was so we can use it as a limit later. highestrev = max([self.rev(n) for n in nodestotag]) while nodestotag: