Show More
@@ -611,12 +611,14 b' class revlog(object):' | |||||
611 | count = len(self) |
|
611 | count = len(self) | |
612 | if not count: |
|
612 | if not count: | |
613 | return [nullrev] |
|
613 | return [nullrev] | |
614 | ishead = [1] * (count + 1) |
|
614 | # we won't iter over filtered rev so nobody is a head at start | |
|
615 | ishead = [0] * (count + 1) | |||
615 | index = self.index |
|
616 | index = self.index | |
616 | for r in self: |
|
617 | for r in self: | |
|
618 | ishead[r] = 1 # I may be an head | |||
617 | e = index[r] |
|
619 | e = index[r] | |
618 | ishead[e[5]] = ishead[e[6]] = 0 |
|
620 | ishead[e[5]] = ishead[e[6]] = 0 # my parent are not | |
619 |
return [r for r in |
|
621 | return [r for r, val in enumerate(ishead) if val] | |
620 |
|
622 | |||
621 | def heads(self, start=None, stop=None): |
|
623 | def heads(self, start=None, stop=None): | |
622 | """return the list of all nodes that have no children |
|
624 | """return the list of all nodes that have no children |
General Comments 0
You need to be logged in to leave comments.
Login now