comparison mercurial/repoview.py @ 18242:e4687edec014

clfilter: introduces a hidden filter

This filter exclude all hidden revision. We plan to use this filter to hide
revision instead of manually checking contents of the hidden revisions set.

18241:f5ed27c51995

# This software may be used and distributed according to the terms of the
# GNU General Public License version 2 or any later version.

import copy
import phases

def computeunserved(repo):
    """compute the set of revision that should be filtered when used a server

    Secret and hidden changeset should not pretend to be here."""

    if phases.hassecret(repo) or repo.obsstore:
        return frozenset(repo.revs('hidden() + secret()'))
    return frozenset()

# function to compute filtered set
filtertable = {'unserved': computeunserved}
### Nearest subset relation
# Nearest subset of filter X is a filter Y so that:
# * Y is included in X,
# * X - Y is as small as possible.
# This create and ordering used for branchmap purpose.
# the ordering may be partial
subsettable = {None: 'unserved'}

def filteredrevs(repo, filtername):
    """returns set of filtered revision for this filter name"""
    if filtername not in repo.filteredrevcache:
        func = filtertable[filtername]

18242:e4687edec014

# This software may be used and distributed according to the terms of the
# GNU General Public License version 2 or any later version.

import copy
import phases


def computehidden(repo):
    """compute the set of hidden revision to filter

    During most operation hidden should be filtered."""
    assert not repo.changelog.filteredrevs
    if repo.obsstore:
        return frozenset(repo.revs('hidden()'))
    return frozenset()

def computeunserved(repo):
    """compute the set of revision that should be filtered when used a server

    Secret and hidden changeset should not pretend to be here."""

    if phases.hassecret(repo) or repo.obsstore:
        return frozenset(repo.revs('hidden() + secret()'))
    return frozenset()

# function to compute filtered set
filtertable = {'hidden': computehidden,
               'unserved': computeunserved}
### Nearest subset relation
# Nearest subset of filter X is a filter Y so that:
# * Y is included in X,
# * X - Y is as small as possible.
# This create and ordering used for branchmap purpose.
# the ordering may be partial
subsettable = {None: 'hidden',
               'hidden': 'unserved'}

def filteredrevs(repo, filtername):
    """returns set of filtered revision for this filter name"""
    if filtername not in repo.filteredrevcache:
        func = filtertable[filtername]