New discovery code

[Adrian Buehlmann]

On 2011-05-04 20:10, Peter Arrenbrecht wrote:
> On Wed, May 4, 2011 at 7:58 PM, Adrian Buehlmann <adrian at cadifra.com> wrote:
>> On 2011-05-04 05:29, Matt Mackall wrote:
>>> Peter's new discovery code from the sprint is in the tree and I've got
>>> it running on http://selenic.com/hg and /repo.
>>>
>>> a) It's really much faster. I've got a test here of a kernel repo that's
>>> over 10k csets behind tip. Old discover takes at least a few dozen round
>>> trips and about a minute, new discovery takes 2 round trips and about a
>>> second.
>>>
>>> b) It's too aggressive for servers that support the known command but
>>> not long args. It defaults to 200 nodes per query, which works out to 8k
>>> bytes, way over the 1k URL limit. This is probably restricted to a
>>> narrow range of people running the post-1.8 default branch, but it bit
>>> me.
>>>
>>
>> I can't push to bitbucket with that. I filed
>> http://mercurial.selenic.com/bts/issue2793
> 
> Shall look into this first thing tomorrow. (It's evening here right now.)
> -parren

Thank you. No need to hurry from my side. Really impressive feature!

Greetings from evil guinea pig #1 :-)