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 |
Mon, 31 Dec 2007 18:20:33 -0600 | Matt Mackall | bisect: propagate ancestor lists directly to children | changeset | files |
Mon, 31 Dec 2007 18:20:33 -0600 | Matt Mackall | bisect: add noupdate option | changeset | files |