[PATCH] discovery: add new set-based discovery

Dirkjan Ochtman dirkjan at ochtman.nl
Sun May 1 12:17:32 CDT 2011

On Sun, May 1, 2011 at 11:59, Peter Arrenbrecht
<peter.arrenbrecht at gmail.com> wrote:
> # HG changeset patch
> # User Peter Arrenbrecht <peter.arrenbrecht at gmail.com>
> # Date 1304243914 -7200
> 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).

This sounds very cool. What are the chances of this making it into 1.9?



More information about the Mercurial-devel mailing list