Re: RFE: "git bisect reverse"
- From
- Ealdwulf Wuffinga <ealdwulf@googlemail.com>
- Date
- May 28, 2009, 20:29 UTC
- Message-ID
- <efe2b6d70905281329s1ae5a94coe5875714f341d5a9@mail.gmail.com>
- In-Reply-To
- <4A1DC7D8.2050601@vilain.net>
On Thu, May 28, 2009 at 12:08 AM, Sam Vilain <sam@vilain.net> wrote:
> Ealdwulf Wuffinga wrote:
>> [some time back] http://github.com/Ealdwulf/bbchop/tree/master
Show 11 quoted lines
>> For git-bisect, Sam and H Peter are proposing a heuristic to trade off >> between information gained and likelihood of testing a bad commit. For >> bbchop, I am already doing calculating the information gain directly, >> so if I can incorporate the probability that a commit is broken - has >> to be skipped - then the trade-off will happen automatically. >> Therefore it would be useful to have some plausible theory as to how >> the probability of a broken commit should be calculated, given some >> known-broken and known-not-broken commits. >> > > Sounds like interesting stuff, can you make a patch out of it?
The code as it stands will actually work with an unmodified git. What it doesn't yet have is a 'git-bisect'-like frontend, which is the only part which would actually require modifying (or just adding to) git itself.
It does already interface to the git plumbing, so you can try it out if you don't mind using a slightly ungitlike interface.
I assume it's not worth doing a patch which would just copy my tree into the git source tree?
There was also, last time I mentioned this on the list, some question as to whether it was acceptable to add something written in python to git.
Ealdwulf