git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Re: [PATCH v2.1 resend] rev-list: estimate number of bisection step left

From
Junio C Hamano <gitster@pobox.com>
Date
Feb 21, 2009, 09:27 UTC
Message-ID
<7vy6w0qgwr.fsf@gitster.siamese.dyndns.org>
In-Reply-To
<20090221092601.45691c3e.chriscool@tuxfamily.org>
Christian Couder <chriscool@tuxfamily.org> writes:
Show 5 quoted lines
> Here is a table to help analyse what should be the best estimate for
> the number of bisect steps left.
> ...
> So the algorithm used in this patch calculates 2^n and x, and then
> choose between returning n - 1 and n.
Two dumb questions about the math (because I suck at math).
 - Do you mean by "best estimate" the best case scenario, or something
   else (perhaps "the most accurate")?
 - Is computing based on linear history a good enough approximation?

I am not advocating to make things more precise nor saying your math is flawed. I'd prefer simpler code for things like this --- after all, my understanding of this whole exercise is to give "this is more or less the number you should expect" ballpack figure and nothing more (correct me if that is not what you are aiming for).

Previous: Christian CouderNext: Christian Couder
Message 2 of 3 in “rev-list: estimate number of bisection step left”
  1. rev-list: estimate number of bisection step leftChristian Couder, Feb 21, 2009
  2. Junio C HamanoFeb 21, 2009
  3. Christian CouderFeb 21, 2009

Read the whole thread, see it on lore, or plain text.

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.