Thu, 27 Dec 2007 23:55:39 -0600 bisect: slightly improve the help message
Matt Mackall <mpm@selenic.com> [Thu, 27 Dec 2007 23:55:39 -0600] rev 5729
bisect: slightly improve the help message
Thu, 27 Dec 2007 23:55:39 -0600 bisect: remove stale test function
Matt Mackall <mpm@selenic.com> [Thu, 27 Dec 2007 23:55:39 -0600] rev 5728
bisect: remove stale test function
Thu, 27 Dec 2007 23:55:39 -0600 bisect: use array.array rather than lists for ancestor lists
Matt Mackall <mpm@selenic.com> [Thu, 27 Dec 2007 23:55:39 -0600] rev 5727
bisect: use array.array rather than lists for ancestor lists This nearly doubles performance and cuts memory usage in half on large bisections.
Thu, 27 Dec 2007 23:55:39 -0600 bisect: switch individual ancestor lists from dict to list
Matt Mackall <mpm@selenic.com> [Thu, 27 Dec 2007 23:55:39 -0600] rev 5726
bisect: switch individual ancestor lists from dict to list This saves quite a lot of memory and increases performance
Thu, 27 Dec 2007 23:55:39 -0600 bisect: turn ancestors into an array
Matt Mackall <mpm@selenic.com> [Thu, 27 Dec 2007 23:55:39 -0600] rev 5725
bisect: turn ancestors into an array This makes things faster and eliminates the separate stop hash
Thu, 27 Dec 2007 23:55:39 -0600 bisect: greatly simplify the ancestor accumulating loop
Matt Mackall <mpm@selenic.com> [Thu, 27 Dec 2007 23:55:39 -0600] rev 5724
bisect: greatly simplify the ancestor accumulating loop
(0) -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip