aboutsummaryrefslogtreecommitdiff
path: root/commit.c
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-06-17 22:54:50 -0700
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-06-17 22:54:50 -0700
commit8b3a1e056f2107deedfdada86046971c9ad7bb87 (patch)
tree6414aac945a94018a479560bc4a7894826cab95a /commit.c
parent753fd78458b6d7d0e65ce0ebe7b62e1bc55f3992 (diff)
downloadgit-8b3a1e056f2107deedfdada86046971c9ad7bb87.tar.gz
git-8b3a1e056f2107deedfdada86046971c9ad7bb87.tar.xz
git-rev-list: add "--bisect" flag to find the "halfway" point
This is useful for doing binary searching for problems. You start with a known good and known bad point, and you then test the "halfway" point in between: git-rev-list --bisect bad ^good and you test that. If that one tests good, you now still have a known bad case, but two known good points, and you can bisect again: git-rev-list --bisect bad ^good1 ^good2 and test that point. If that point is bad, you now use that as your known-bad starting point: git-rev-list --bisect newbad ^good1 ^good2 and basically at every iteration you shrink your list of commits by half: you're binary searching for the point where the troubles started, even though there isn't a nice linear ordering.
Diffstat (limited to 'commit.c')
0 files changed, 0 insertions, 0 deletions