merge-slicing: introduce and use "inheritance point" for merge The first part of the stable sorted list of revision of a merge will shared with the one of others. This means we can reuse subranges computed from that point to compute some of the subranges from the merge. That point is latest point in the stable sorted list where the depth of the revisions match its index (that means all revision earlier in the stable sorted list are its ancestors, no dangling unrelated branches exists). This is a bit expensive to find since we have to walk all the revision, but being able to reuse subranges in all case (not just regular changesets) provide a massive speedup so the cost is worth it.

     1

This software was downloaded from

     2

http://hg.netv6.net/evolve-main/

     3

     4

Copyright 2011 Peter Arrenbrecht <peter.arrenbrecht@gmail.com>

     5

               Logilab SA        <contact@logilab.fr>

     6

               Pierre-Yves David <pierre-yves.david@ens-lyon.org>

     7

	       Patrick Mezard <patrick@mezard.eu>

     8

     9

    10

This software may be used and distributed according to the terms of the GNU

    11

General Public License version 2 or any later version.

    12

    13

On Debian systems, the complete text of the GNU General Public License version

    14

2 can be found in `/usr/share/common-licenses/GPL-2'.

    15