From: Uwe Kleine-König <u.kleine-koenig@baylibre.com>
Date: Fri, 21 Feb 2025 09:28:24 GMT
Subject: Re: first bisection step takes quite a while
Message-ID: <4hx5uvjy7mzntb5zp6o4dg3ut44i46bthyfuera3lnbpbcvrey@kbo3ejype7ae>
In-Reply-To: <xmqqa5agcbx6.fsf@gitster.g>

Hello Junio,

On Thu, Feb 20, 2025 at 05:40:53PM -0800, Junio C Hamano wrote:
> Comments?

It's long time ago that I looked into the git source code and I guess
many things have changed since then.

Anyhow, here comes my thought about how finding a bisection point could
work.

Pick the middle commit of `git rev-list --topo-order $bad ^$allgood`.
Lets assume this are 10000 commits. Check the weight of commit[5000].
Depending on how much the weight is off from 5000 make a bigger or a
smaller step up or down to find the next commit to check. So a scaled
bisection on the topo-order commit list. I think that doesn't
necessarily finds a best bisection point, but I havn't thought about
that a lot.

Best regards
Uwe