Show More
@@ -678,7 +678,7 b' class revlog(object):' | |||||
678 | # find from roots. |
|
678 | # find from roots. | |
679 | heads = dict.fromkeys(heads, 0) |
|
679 | heads = dict.fromkeys(heads, 0) | |
680 | # Start at the top and keep marking parents until we're done. |
|
680 | # Start at the top and keep marking parents until we're done. | |
681 | nodestotag = heads.keys() |
|
681 | nodestotag = set(heads.keys()) | |
682 | # Remember where the top was so we can use it as a limit later. |
|
682 | # Remember where the top was so we can use it as a limit later. | |
683 | highestrev = max([self.rev(n) for n in nodestotag]) |
|
683 | highestrev = max([self.rev(n) for n in nodestotag]) | |
684 | while nodestotag: |
|
684 | while nodestotag: | |
@@ -696,7 +696,7 b' class revlog(object):' | |||||
696 | # and we haven't already been marked as an ancestor |
|
696 | # and we haven't already been marked as an ancestor | |
697 | ancestors[n] = 1 # Mark as ancestor |
|
697 | ancestors[n] = 1 # Mark as ancestor | |
698 | # Add non-nullid parents to list of nodes to tag. |
|
698 | # Add non-nullid parents to list of nodes to tag. | |
699 |
nodestotag. |
|
699 | nodestotag.update([p for p in self.parents(n) if | |
700 | p != nullid]) |
|
700 | p != nullid]) | |
701 | elif n in heads: # We've seen it before, is it a fake head? |
|
701 | elif n in heads: # We've seen it before, is it a fake head? | |
702 | # So it is, real heads should not be the ancestors of |
|
702 | # So it is, real heads should not be the ancestors of |
General Comments 0
You need to be logged in to leave comments.
Login now