comparison mercurial/hgweb/webutil.py @ 18403:bfaee31a83d2

hgweb: move revnavgen into an object

For later compatibility with changelog filtering some part of the navigation
generation logic will be altered. Those altered part will be different when in
the changelog case and in the filelog case. Moving this into an object will
allow to use inheritance to override just the part of the logic we need.

The aimed logic are for example:

- generation of revision 'hex' (different logic for changelog and filelog)
- revlog emptyness test
- fetching of the first revision of a revlog (may not be 0)

18402:bfba6d954108

    while True:
        yield 1 * step
        yield 3 * step
        step *= 10

def revnavgen(pos, pagelen, limit, nodefunc):
    """computes label and revision id for navigation link

    :pos: is the revision relative to which we generate navigation.
    :pagelen: the size of each navigation page
    :limit: how far shall we link
    :nodefun: factory for a changectx from a revision

    The return is:
        - a single element tuple
        - containing a dictionary with a `before` and `after` key
        - values are generator functions taking an arbitrary number of kwargs
        - yield items are dictionaries with `label` and `node` keys
    """

    navbefore = []
    navafter = []

    for f in _navseq(1, pagelen):
        if f > limit:
            break
        if pos + f < limit:
            navafter.append(("+%d" % f, hex(nodefunc(pos + f).node())))
        if pos - f >= 0:
            navbefore.insert(0, ("-%d" % f, hex(nodefunc(pos - f).node())))

    navafter.append(("tip", "tip"))
    try:
        navbefore.insert(0, ("(0)", hex(nodefunc(0).node())))
    except error.RepoError:
        pass

    data = lambda i: {"label": i[0], "node": i[1]}
    return ({'before': lambda **map: (data(i) for i in navbefore),
             'after':  lambda **map: (data(i) for i in navafter)},)

def _siblings(siblings=[], hiderev=None):
    siblings = [s for s in siblings if s.node() != nullid]
    if len(siblings) == 1 and siblings[0].rev() == hiderev:
        return

18403:bfaee31a83d2

    while True:
        yield 1 * step
        yield 3 * step
        step *= 10

class revnav(object):

    def gen(self, pos, pagelen, limit, nodefunc):
        """computes label and revision id for navigation link

        :pos: is the revision relative to which we generate navigation.
        :pagelen: the size of each navigation page
        :limit: how far shall we link
        :nodefun: factory for a changectx from a revision

        The return is:
            - a single element tuple
            - containing a dictionary with a `before` and `after` key
            - values are generator functions taking arbitrary number of kwargs
            - yield items are dictionaries with `label` and `node` keys
        """

        navbefore = []
        navafter = []

        for f in _navseq(1, pagelen):
            if f > limit:
                break
            if pos + f < limit:
                navafter.append(("+%d" % f, hex(nodefunc(pos + f).node())))
            if pos - f >= 0:
                navbefore.insert(0, ("-%d" % f, hex(nodefunc(pos - f).node())))

        navafter.append(("tip", "tip"))
        try:
            navbefore.insert(0, ("(0)", hex(nodefunc(0).node())))
        except error.RepoError:
            pass

        data = lambda i: {"label": i[0], "node": i[1]}
        return ({'before': lambda **map: (data(i) for i in navbefore),
                 'after':  lambda **map: (data(i) for i in navafter)},)

def _siblings(siblings=[], hiderev=None):
    siblings = [s for s in siblings if s.node() != nullid]
    if len(siblings) == 1 and siblings[0].rev() == hiderev:
        return