Show More
@@ -28,21 +28,18 b' def _revancestors(repo, revs, followfirs' | |||
|
28 | 28 | revs.sort(reverse=True) |
|
29 | 29 | irevs = iter(revs) |
|
30 | 30 | h = [] |
|
31 | try: | |
|
32 |
|
|
|
31 | ||
|
32 | inputrev = next(irevs, None) | |
|
33 | if inputrev is not None: | |
|
33 | 34 | heapq.heappush(h, -inputrev) |
|
34 | except StopIteration: | |
|
35 | return | |
|
36 | 35 | |
|
37 | 36 | seen = set() |
|
38 | 37 | while h: |
|
39 | 38 | current = -heapq.heappop(h) |
|
40 | 39 | if current == inputrev: |
|
41 | try: | |
|
42 |
|
|
|
40 | inputrev = next(irevs, None) | |
|
41 | if inputrev is not None: | |
|
43 | 42 | heapq.heappush(h, -inputrev) |
|
44 | except StopIteration: | |
|
45 | pass | |
|
46 | 43 | if current not in seen: |
|
47 | 44 | seen.add(current) |
|
48 | 45 | yield current |
General Comments 0
You need to be logged in to leave comments.
Login now