Mercurial
Mercurial
>
hg
/ changelog
summary
|
shortlog
| changelog |
graph
|
tags
|
bookmarks
|
branches
|
files
|
zip
|
gz
|
bz2
|
help
(0)
-3000
-1000
-300
-100
-30
-10
-4
+4
+10
+30
+100
+300
+1000
+3000
+10000
+30000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
Mon, 31 Dec 2007 18:20:34 -0600
bisect: stop early if we find a perfect candidate
changeset
Matt Mackall <mpm@selenic.com> [Mon, 31 Dec 2007 18:20:34 -0600] rev 5771
bisect: stop early if we find a perfect candidate
Mon, 31 Dec 2007 18:20:34 -0600
bisect: find best node in ancestor collection pass
changeset
Matt Mackall <mpm@selenic.com> [Mon, 31 Dec 2007 18:20:34 -0600] rev 5770
bisect: find best node in ancestor collection pass
Mon, 31 Dec 2007 18:20:33 -0600
bisect: calculate candidate set while finding children
changeset
Matt Mackall <mpm@selenic.com> [Mon, 31 Dec 2007 18:20:33 -0600] rev 5769
bisect: calculate candidate set while finding children
Mon, 31 Dec 2007 18:20:33 -0600
bisect: use a dict for children
changeset
Matt Mackall <mpm@selenic.com> [Mon, 31 Dec 2007 18:20:33 -0600] rev 5768
bisect: use a dict for children We fill in the children only for ancestors of badrev
(0)
-3000
-1000
-300
-100
-30
-10
-4
+4
+10
+30
+100
+300
+1000
+3000
+10000
+30000
tip