comparison mercurial/dagutil.py @ 39179:1c3184d7e882

dagop: extract headsetofconnecteds() from dagutil

The functionality for resolving the set of DAG heads from a
subset simply requires a function to resolve parent revisions.

Let's establish a function in the dagop module to do this, which
seems to be where generic DAG functionality goes these days.

Differential Revision: https://phab.mercurial-scm.org/D4327

39178:274acf379dbb

# GNU General Public License version 2 or any later version.

from __future__ import absolute_import

from .node import nullrev

class revlogdag(object):
    '''dag interface to a revlog'''

    def __init__(self, revlog):

        prev2 = revdata[6]
        if prev2 != nullrev:
            return [prev2]
        return []

    def headsetofconnecteds(self, ixs):
        if not ixs:
            return set()
        rlog = self._revlog
        idx = rlog.index
        headrevs = set(ixs)
        for rev in ixs:
            revdata = idx[rev]
            for i in [5, 6]:
                prev = revdata[i]
                if prev != nullrev:
                    headrevs.discard(prev)
        assert headrevs
        return headrevs

    def linearize(self, ixs):
        '''linearize and topologically sort a list of revisions

        The linearization process tries to create long runs of revs where
        a child rev comes immediately after its first parent. This is done by
        visiting the heads of the given revs in inverse topological order,
        and for each visited rev, visiting its second parent, then its first
        parent, then adding the rev itself to the output list.
        '''
        sorted = []
        visit = list(self.headsetofconnecteds(ixs))
        visit.sort(reverse=True)
        finished = set()

        while visit:
            cur = visit.pop()

39179:1c3184d7e882

# GNU General Public License version 2 or any later version.

from __future__ import absolute_import

from .node import nullrev

from . import (
    dagop,
)

class revlogdag(object):
    '''dag interface to a revlog'''

    def __init__(self, revlog):

        prev2 = revdata[6]
        if prev2 != nullrev:
            return [prev2]
        return []

    def linearize(self, ixs):
        '''linearize and topologically sort a list of revisions

        The linearization process tries to create long runs of revs where
        a child rev comes immediately after its first parent. This is done by
        visiting the heads of the given revs in inverse topological order,
        and for each visited rev, visiting its second parent, then its first
        parent, then adding the rev itself to the output list.
        '''
        sorted = []
        visit = list(dagop.headrevs(ixs, self.parents))
        visit.sort(reverse=True)
        finished = set()

        while visit:
            cur = visit.pop()