Autogenerated HTML docs for v1.3.2-g45f7

diff --git a/git-rev-list.html b/git-rev-list.html
index 0293629..98ad84e 100644 (file)
--- a/git-rev-list.html
+++ b/git-rev-list.html
@@ -359,9 +359,10 @@ short-hand for ^&lt;commit1&gt; &lt;commit2&gt;.</p>
 <p>\r
         Limit output to the one commit object which is roughly halfway\r
         between the included and excluded commits. Thus, if <em>git-rev-list\r
-        --bisect foo <sup>bar </sup>baz</em> outputs <em>midpoint</em>, the output\r
+        --bisect foo ^bar ^baz</em> outputs <em>midpoint</em>, the output\r
         of <em>git-rev-list foo ^midpoint</em> and <em>git-rev-list midpoint\r
-        <sup>bar </sup>baz</em> would be of roughly the same length. Finding the change\r
+        ^bar ^baz</em> would be of roughly the same length.\r
+        Finding the change\r
         which introduces a regression is thus reduced to a binary search:\r
         repeatedly generate and test new 'midpoint's until the commit chain\r
         is of length one.\r
@@ -440,7 +441,7 @@ short-hand for ^&lt;commit1&gt; &lt;commit2&gt;.</p>
 </div>\r
 <div id="footer">\r
 <div id="footer-text">\r
-Last updated 04-Mar-2006 22:16:33 UTC\r
+Last updated 09-May-2006 00:32:26 UTC\r
 </div>\r
 </div>\r
 </body>\r

diff --git a/git-rev-list.txt b/git-rev-list.txt
index 8255ae1..ad6d14c 100644 (file)
--- a/git-rev-list.txt
+++ b/git-rev-list.txt
@@ -68,9 +68,10 @@ OPTIONS
 --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.