comparison mercurial/repoview.py @ 38156:5b592ac502ef

repoview: use 'phasecache.getrevset' when computing 'unserved' filter

This reuses a precomputed set, being much faster than manual iteration.

Computing the "unserved" filter speed up by 55%.

before: wall 0.014671 comb 0.020000 user 0.020000 sys 0.000000 (best of 180)
after:  wall 0.006623 comb 0.010000 user 0.010000 sys 0.000000 (best of 401)

The "unserved" filter is used to restrict the revisions client can pull from a
server. (eg: secret changesets)

38155:5736570718fe

    Secret and hidden changeset should not pretend to be here."""
    assert not repo.changelog.filteredrevs
    # fast path in simple case to avoid impact of non optimised code
    hiddens = filterrevs(repo, 'visible')
    if phases.hassecret(repo):
        cl = repo.changelog
        secret = phases.secret
        getphase = repo._phasecache.phase
        first = min(cl.rev(n) for n in repo._phasecache.phaseroots[secret])
        revs = cl.revs(start=first)
        secrets = set(r for r in revs if getphase(repo, r) >= secret)
        return frozenset(hiddens | secrets)
    else:
        return hiddens

def computemutable(repo, visibilityexceptions=None):

38156:5b592ac502ef

    Secret and hidden changeset should not pretend to be here."""
    assert not repo.changelog.filteredrevs
    # fast path in simple case to avoid impact of non optimised code
    hiddens = filterrevs(repo, 'visible')
    if phases.hassecret(repo):
        secrets = frozenset(repo._phasecache.getrevset(repo, (phases.secret,)))
        return frozenset(hiddens | secrets)
    else:
        return hiddens

def computemutable(repo, visibilityexceptions=None):