Autogenerated HTML docs for v2.29.0-rc1

1 files changed, 9 insertions, 9 deletions

diff --git a/git-bisect-lk2009.html b/git-bisect-lk2009.html
index f27528fb8..f7f9901ef 100644
--- a/git-bisect-lk2009.html
+++ b/git-bisect-lk2009.html
@@ -1167,7 +1167,7 @@ and Z will be kept:</p></div>
 Z-Z</code></pre>

 </div></div>

 <div class="paragraph"><p>2) starting from the "good" ends of the graph, associate to each

-commit the number of ancestors it has plus one</p></div>

+   commit the number of ancestors it has plus one</p></div>

 <div class="paragraph"><p>For example with the following graph where H is the "bad" commit and A

 and D are some parents of some "good" commits:</p></div>

 <div class="listingblock">

@@ -1202,7 +1202,7 @@ A-B-C
 D---E</code></pre>

 </div></div>

 <div class="paragraph"><p>4) the best bisection point is the commit with the highest associated

-number</p></div>

+   number</p></div>

 <div class="paragraph"><p>So in the above example the best bisection point is commit C.</p></div>

 <div class="paragraph"><p>5) note that some shortcuts are implemented to speed up the algorithm</p></div>

 <div class="paragraph"><p>As we know N from the beginning, we know that min(X, N - X) can&#8217;t be

@@ -1257,8 +1257,8 @@ suppose that these commits being for example on a branch or near a
 good or a bad commit does not give more or less information).</p></div>

 <div class="paragraph"><p>Let&#8217;s also suppose that we have a cleaned up graph like one after step

 1) in the bisection algorithm above. This means that we can measure

-the information we get in terms of number of commit we can remove from

-the graph..</p></div>

+   the information we get in terms of number of commit we can remove

+   from the graph..</p></div>

 <div class="paragraph"><p>And let&#8217;s take a commit X in the graph.</p></div>

 <div class="paragraph"><p>If X is found to be "good", then we know that its ancestors are all

 "good", so we want to say that:</p></div>

@@ -1348,14 +1348,14 @@ the bisection algorithm is the same for step 1) to 3). But then we use
 roughly the following steps:</p></div>

 <div class="paragraph"><p>6) sort the commit by decreasing associated value</p></div>

 <div class="paragraph"><p>7) if the first commit has not been skipped, we can return it and stop

-here</p></div>

+   here</p></div>

 <div class="paragraph"><p>8) otherwise filter out all the skipped commits in the sorted list</p></div>

 <div class="paragraph"><p>9) use a pseudo random number generator (PRNG) to generate a random

-number between 0 and 1</p></div>

+   number between 0 and 1</p></div>

 <div class="paragraph"><p>10) multiply this random number with its square root to bias it toward

-0</p></div>

+    0</p></div>

 <div class="paragraph"><p>11) multiply the result by the number of commits in the filtered list

-to get an index into this list</p></div>

+    to get an index into this list</p></div>

 <div class="paragraph"><p>12) return the commit at the computed index</p></div>

 </div>

 <div class="sect2">

@@ -1983,7 +1983,7 @@ author to given a talk and for publishing this paper.</p></div>
 <div id="footer">

 <div id="footer-text">

 Last updated

- 2020-03-10 08:03:13 PDT

+ 2020-10-09 08:47:57 PDT

 </div>

 </div>

 </body>