summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 5d6a9f4)
raw | patch | inline | side by side (parent: 5d6a9f4)
author | Junio C Hamano <junkio@cox.net> | |
Mon, 8 May 2006 20:46:53 +0000 (13:46 -0700) | ||
committer | Junio C Hamano <junkio@cox.net> | |
Mon, 8 May 2006 20:46:53 +0000 (13:46 -0700) |
Signed-off-by: Junio C Hamano <junkio@cox.net>
Documentation/git-rev-list.txt | patch | blob | history |
index 8255ae1bceee562140179704352a7e4f9cd83d99..ad6d14c55aab2144bdac3c313305ba408fe5f0db 100644 (file)
--bisect::
Limit output to the one commit object which is roughly halfway
between the included and excluded commits. Thus, if 'git-rev-list
- --bisect foo ^bar ^baz' outputs 'midpoint', the output
- of 'git-rev-list foo ^midpoint' and 'git-rev-list midpoint
- ^bar ^baz' would be of roughly the same length. Finding the change
+ --bisect foo {caret}bar {caret}baz' outputs 'midpoint', the output
+ of 'git-rev-list foo {caret}midpoint' and 'git-rev-list midpoint
+ {caret}bar {caret}baz' would be of roughly the same length.
+ Finding the change
which introduces a regression is thus reduced to a binary search:
repeatedly generate and test new 'midpoint's until the commit chain
is of length one.