Show More
@@ -328,7 +328,7 b' def foreground(repo, nodes):' | |||
|
328 | 328 | if repo.obsstore: |
|
329 | 329 | # We only need this complicated logic if there is obsolescence |
|
330 | 330 | # XXX will probably deserve an optimised revset. |
|
331 |
|
|
|
331 | has_node = repo.changelog.index.has_node | |
|
332 | 332 | plen = -1 |
|
333 | 333 | # compute the whole set of successors or descendants |
|
334 | 334 | while len(foreground) != plen: |
@@ -336,7 +336,7 b' def foreground(repo, nodes):' | |||
|
336 | 336 | succs = set(c.node() for c in foreground) |
|
337 | 337 | mutable = [c.node() for c in foreground if c.mutable()] |
|
338 | 338 | succs.update(allsuccessors(repo.obsstore, mutable)) |
|
339 |
known = (n for n in succs if n |
|
|
339 | known = (n for n in succs if has_node(n)) | |
|
340 | 340 | foreground = set(repo.set(b'%ln::', known)) |
|
341 | 341 | return set(c.node() for c in foreground) |
|
342 | 342 |
General Comments 0
You need to be logged in to leave comments.
Login now