From: Nanako Shiraishi <nanako3@lavabit.com>
Date: Mon, 27 Oct 2008 10:29:23 GMT
Subject: Re: [RFC PATCH v2] fetch-pack: log(n)-transmission find_common()
Message-ID: <20081027192923.6117@nanako3.lavabit.com>
In-Reply-To: <1224790716-20551-1-git-send-email-trast@student.ethz.ch>

Quoting Thomas Rast <trast@student.ethz.ch>:

> Replaces the existing simple history search with a more sophisticated
> algorithm:
> 
> 1) Walk history with exponentially increasing stride lengths; i.e.,
>    send the 1st commit, then the 2nd after that, then the 4th after
>    that, and so on.
> 
> 2) Bisect the resulting intervals.

Junio, may I ask what the status of this patch is? I see Nicolas responded and said "I gave this a quick try". Wasn't it a good enough review?

-- 
Nanako Shiraishi
http://ivory.ap.teacup.com/nanako3/