| Mon, 31 Dec 2007 18:20:34 -0600 |
Matt Mackall |
bisect: merge ancestor lists when pushing to children
|
| Mon, 31 Dec 2007 18:20:34 -0600 |
Matt Mackall |
bisect: skip calculations on candidates with too many ancestors
|
| Mon, 31 Dec 2007 18:20:34 -0600 |
Matt Mackall |
bisect: stop early if we find a perfect candidate
|
| Mon, 31 Dec 2007 18:20:34 -0600 |
Matt Mackall |
bisect: find best node in ancestor collection pass
|
| Mon, 31 Dec 2007 18:20:33 -0600 |
Matt Mackall |
bisect: calculate candidate set while finding children
|
| Mon, 31 Dec 2007 18:20:33 -0600 |
Matt Mackall |
bisect: use a dict for children
|
| Mon, 31 Dec 2007 18:20:33 -0600 |
Matt Mackall |
bisect: propagate ancestor lists directly to children
|
| Mon, 31 Dec 2007 18:20:33 -0600 |
Matt Mackall |
bisect: add noupdate option
|
| Thu, 27 Dec 2007 23:55:40 -0600 |
Matt Mackall |
bisect: use proper locking when updating bisect.state
|
| Thu, 27 Dec 2007 23:55:40 -0600 |
Matt Mackall |
bisect: remove class
|
| Thu, 27 Dec 2007 23:55:40 -0600 |
Matt Mackall |
bisect: keep history of all bad revisions
|
| Thu, 27 Dec 2007 23:55:40 -0600 |
Matt Mackall |
bisect: use more standard command syntax and help
|
| Thu, 27 Dec 2007 23:55:40 -0600 |
Matt Mackall |
bisect: move reporting out of core bisect function
|
| Thu, 27 Dec 2007 23:55:40 -0600 |
Matt Mackall |
bisect: add skip command
|
| Thu, 27 Dec 2007 23:55:39 -0600 |
Matt Mackall |
bisect: simplify state handling and init
|
