mercurial/phases.py

51504:6b2aeeec3ed0

                break
        if not new_revs:
            return set()

        # search for affected high phase changesets and roots
        push = heapq.heappush
        pop = heapq.heappop
        parents = cl.parentrevs
        get_phase = self.phase
        changed = {}  # set of revisions to be changed

                # do not record phase, because we could have "duplicated"
                # roots, were one root is shadowed by the very same roots of an
                # higher phases
                delroots.add(current)
            # schedule a walk down if needed
            if p1_phase > targetphase:
                push(revs, -p1)
            if p2_phase > targetphase:
                push(revs, -p2)
            if p1_phase < targetphase and p2_phase < targetphase:
                new_target_roots.add(current)

        # the last iteration was done with the smallest value

51505:c9ceb4f60256

                break
        if not new_revs:
            return set()

        # search for affected high phase changesets and roots
        seen = set(new_revs)
        push = heapq.heappush
        pop = heapq.heappop
        parents = cl.parentrevs
        get_phase = self.phase
        changed = {}  # set of revisions to be changed

                # do not record phase, because we could have "duplicated"
                # roots, were one root is shadowed by the very same roots of an
                # higher phases
                delroots.add(current)
            # schedule a walk down if needed
            if p1_phase > targetphase and p1 not in seen:
                seen.add(p1)
                push(revs, -p1)
            if p2_phase > targetphase and p2 not in seen:
                seen.add(p2)
                push(revs, -p2)
            if p1_phase < targetphase and p2_phase < targetphase:
                new_target_roots.add(current)

        # the last iteration was done with the smallest value