Show More
@@ -266,10 +266,13 b' def bisect(ui, repo, rev=None, extra=Non' | |||||
266 | To use, mark the earliest changeset you know exhibits the problem |
|
266 | To use, mark the earliest changeset you know exhibits the problem | |
267 | as bad, then mark the latest changeset which is free from the |
|
267 | as bad, then mark the latest changeset which is free from the | |
268 | problem as good. Bisect will update your working directory to a |
|
268 | problem as good. Bisect will update your working directory to a | |
269 | revision for testing. Once you have performed tests, mark the |
|
269 | revision for testing (unless the --noupdate option is specified). | |
270 | working directory as bad or good and bisect will either update to |
|
270 | Once you have performed tests, mark the working directory as bad | |
271 | another candidate changeset or announce that it has found the bad |
|
271 | or good and bisect will either update to another candidate changeset | |
272 | revision. |
|
272 | or announce that it has found the bad revision. | |
|
273 | ||||
|
274 | As a shortcut, you can also use the revision argument to mark a | |||
|
275 | revision as good or bad without checking it out first. | |||
273 | """ |
|
276 | """ | |
274 | # backward compatibility |
|
277 | # backward compatibility | |
275 | if rev in "good bad reset init".split(): |
|
278 | if rev in "good bad reset init".split(): |
General Comments 0
You need to be logged in to leave comments.
Login now