Re: RFE: "git bisect reverse"
- From
- H. Peter Anvin <hpa@zytor.com>
- Date
- May 28, 2009, 21:54 UTC
- Message-ID
- <4A1F07FA.6040008@zytor.com>
- In-Reply-To
- <efe2b6d70905281407x56bb788aq3dba4b27eb91d7a6@mail.gmail.com>
Ealdwulf Wuffinga wrote:
Show 7 quoted lines
> > It would fit a lot better into this algorithm to have some model of > the probability that a commit will cause a skip. It doesn't actually > have to be a very good one, because if it's poor it will only make the > search slightly less efficient, not affect the reliability of the > final result. >
How about simply modelling it linearly, with 100% probability for known skip point, 0% for a known good/bad point, and a linear gradient in between? It's probably a good enough model. In practice, it will vastly overestimate the probability of a skip, so if a linear model turns out to be too conservative, I would probably just try to model it as a higher-order power function.
-hpa