discovery: add new set-based discovery Adds a new discovery method based on repeatedly sampling the still undecided subset of the local node graph to determine the set of nodes common to both the client and the server. For small differences between client and server, it uses about the same or slightly fewer roundtrips than the old tree-based discovery. For larger differences, it typically reduces the number of roundtrips drastically (from 150 to 4, for instance). The old discovery code now lives in treediscovery.py, the new code is in setdiscovery.py. Still missing is a hook for extensions to contribute nodes to the initial sample. For instance, Augie's remotebranches could contribute the last known state of the server's heads. Credits for the actual sampler and computing common heads instead of bases go to Benoit Boissinot.

     1

'''

     2

Examples of useful python hooks for Mercurial.

     3

'''

     4

from mercurial import patch, util

     5

     6

def diffstat(ui, repo, **kwargs):

     7

    '''Example usage:

     8

     9

    [hooks]

    10

    commit.diffstat = python:/path/to/this/file.py:diffstat

    11

    changegroup.diffstat = python:/path/to/this/file.py:diffstat

    12

    '''

    13

    if kwargs.get('parent2'):

    14

        return

    15

    node = kwargs['node']

    16

    first = repo[node].p1().node()

    17

    if 'url' in kwargs:

    18

        last = repo['tip'].node()

    19

    else:

    20

        last = node

    21

    diff = patch.diff(repo, first, last)

    22

    ui.write(patch.diffstat(util.iterlines(diff)))