author | Thomas Arendsen Hein <thomas@intevation.de> |
Tue, 03 Jul 2007 12:46:34 +0200 | |
changeset 4784 | 7cd8a00d08de |
parent 4783 | 8b90d763ea90 (current diff) |
parent 4746 | 62c56d8f368b (diff) |
child 4785 | be78ab217109 |
--- a/mercurial/revlog.py Tue Jul 03 12:14:25 2007 +0200 +++ b/mercurial/revlog.py Tue Jul 03 12:46:34 2007 +0200 @@ -756,9 +756,13 @@ c = [] p = self.rev(node) for r in range(p + 1, self.count()): - for pr in self.parentrevs(r): - if pr == p: - c.append(self.node(r)) + prevs = [pr for pr in self.parentrevs(r) if pr != nullrev] + if prevs: + for pr in prevs: + if pr == p: + c.append(self.node(r)) + elif p == nullrev: + c.append(self.node(r)) return c def _match(self, id):