| Mon, 31 Dec 2007 18:20:34 -0600 | Matt Mackall | bisect: make bisect a built-in command | changeset | files |
| Mon, 31 Dec 2007 18:20:34 -0600 | Matt Mackall | bisect: faster merging | changeset | files |
| Mon, 31 Dec 2007 18:20:34 -0600 | Matt Mackall | bisect: merge ancestor lists when pushing to children | changeset | files |
| Mon, 31 Dec 2007 18:20:34 -0600 | Matt Mackall | bisect: skip calculations on candidates with too many ancestors | changeset | files |
| Mon, 31 Dec 2007 18:20:34 -0600 | Matt Mackall | bisect: stop early if we find a perfect candidate | changeset | files |
| Mon, 31 Dec 2007 18:20:34 -0600 | Matt Mackall | bisect: find best node in ancestor collection pass | changeset | files |
| Mon, 31 Dec 2007 18:20:33 -0600 | Matt Mackall | bisect: calculate candidate set while finding children | changeset | files |
| Mon, 31 Dec 2007 18:20:33 -0600 | Matt Mackall | bisect: use a dict for children | changeset | files |