comparison mercurial/dagop.py @ 32998:c7da57bbae96

dagop: comment why revancestors() doesn't heapify input revs at once

I wondered why we're doing this complicated stuff without noticing the input
revs may be iterated lazily in descending order. c1f666e27345 showed why.

32997:b9e2269aeff8

    if followfirst:
        cut = 1
    else:
        cut = None
    cl = repo.changelog
    revs.sort(reverse=True)
    irevs = iter(revs)
    h = []

    inputrev = next(irevs, None)

32998:c7da57bbae96

    if followfirst:
        cut = 1
    else:
        cut = None
    cl = repo.changelog

    # load input revs lazily to heap so earlier revisions can be yielded
    # without fully computing the input revs
    revs.sort(reverse=True)
    irevs = iter(revs)
    h = []

    inputrev = next(irevs, None)