Show More
@@ -53,11 +53,10 b' def _revealancestors(pfunc, hidden, revs' | |||||
53 | - hidden: the (preliminary) hidden revisions, to be updated |
|
53 | - hidden: the (preliminary) hidden revisions, to be updated | |
54 | - revs: iterable of revnum, |
|
54 | - revs: iterable of revnum, | |
55 |
|
55 | |||
56 |
(Ancestors are revealed |
|
56 | (Ancestors are revealed exclusively, i.e. the elements in 'revs' are | |
57 |
|
|
57 | *not* revealed) | |
58 | """ |
|
58 | """ | |
59 | stack = list(revs) |
|
59 | stack = list(revs) | |
60 | hidden -= set(stack) |
|
|||
61 | while stack: |
|
60 | while stack: | |
62 | for p in pfunc(stack.pop()): |
|
61 | for p in pfunc(stack.pop()): | |
63 | if p != nullrev and p in hidden: |
|
62 | if p != nullrev and p in hidden: | |
@@ -79,8 +78,7 b' def computehidden(repo):' | |||||
79 | visible = set(mutable - hidden) |
|
78 | visible = set(mutable - hidden) | |
80 | visible |= (hidden & pinnedrevs(repo)) |
|
79 | visible |= (hidden & pinnedrevs(repo)) | |
81 | if visible: |
|
80 | if visible: | |
82 | # don't modify possibly cached result of hideablerevs() |
|
81 | hidden = hidden - visible | |
83 | hidden = hidden.copy() |
|
|||
84 | _revealancestors(pfunc, hidden, visible) |
|
82 | _revealancestors(pfunc, hidden, visible) | |
85 | return frozenset(hidden) |
|
83 | return frozenset(hidden) | |
86 |
|
84 |
General Comments 0
You need to be logged in to leave comments.
Login now