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

#!/usr/bin/env python

     2

#

     3

# An example hgweb CGI script, edit as necessary

     4

# See also http://mercurial.selenic.com/wiki/PublishingRepositories

     5

     6

# Path to repo or hgweb config to serve (see 'hg help hgweb')

     7

config = "/path/to/repo/or/config"

     8

     9

# Uncomment and adjust if Mercurial is not installed system-wide:

    10

#import sys; sys.path.insert(0, "/path/to/python/lib")

    11

    12

# Uncomment to send python tracebacks to the browser if an error occurs:

    13

#import cgitb; cgitb.enable()

    14

    15

from mercurial import demandimport; demandimport.enable()

    16

from mercurial.hgweb import hgweb, wsgicgi

    17

application = hgweb(config)

    18

wsgicgi.launch(application)