bdiff: give slight preference to longest matches in the middle of the B side We already have a slight preference for matches close to the middle on the A side. Now, do the same on the B side. j is iterating the b range backwards and we thus accept a new j if the previous match was in the upper half. This makes the test-bhalf diff "correct". It obviously also gives more preference to balanced recursion than to appending to sequences. That is kind of correct, but will also unfortunately make some bundles bigger. No doubt, we can also create examples where it will make them smaller ... The bundle size for 4.0 (hg bundle --base null -r 4.0 x.hg) happens to go from 22803824 to 22806817 bytes - an 0.01% increase.

     1

'''

     2

Examples of useful python hooks for Mercurial.

     3

'''

     4

from __future__ import absolute_import

     5

from mercurial import (

     6

    patch,

     7

    util,

     8

)

     9

    10

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

    11

    '''Example usage:

    12

    13

    [hooks]

    14

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

    15

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

    16

    '''

    17

    if kwargs.get('parent2'):

    18

        return

    19

    node = kwargs['node']

    20

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

    21

    if 'url' in kwargs:

    22

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

    23

    else:

    24

        last = node

    25

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

    26

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