@matheusbsbs / matheus-bagliano / commits / df49a806ab
Fork 0

git-bisect-lk2009: make continuation of list indented

That's clearer asciidoc formatting. Signed-off-by: Jean-Noël Avila <jn.avila@free.fr> Signed-off-by: Junio C Hamano <gitster@pobox.com>

Jean-Noël Avila committed Oct 8, 2020 at 22:23 UTC df49a806abab459430ce022d97ae62ab99e5bab4
1 file changed +8 -8
Documentation/git-bisect-lk2009.txt
+8 -8
@@ -473,7 +473,7 @@ Z-Z
473 -------------
474
475 2) starting from the "good" ends of the graph, associate to each
476 -commit the number of ancestors it has plus one
476 + commit the number of ancestors it has plus one
477
478 For example with the following graph where H is the "bad" commit and A
479 and D are some parents of some "good" commits:
@@ -514,7 +514,7 @@ D---E
514 -------------
515
516 4) the best bisection point is the commit with the highest associated
517 -number
517 + number
518
519 So in the above example the best bisection point is commit C.
520
@@ -580,8 +580,8 @@ good or a bad commit does not give more or less information).
580
581 Let's also suppose that we have a cleaned up graph like one after step
582 1) in the bisection algorithm above. This means that we can measure
583 -the information we get in terms of number of commit we can remove from
584 -the graph..
583 + the information we get in terms of number of commit we can remove
584 + from the graph..
585
586 And let's take a commit X in the graph.
587
@@ -689,18 +689,18 @@ roughly the following steps:
689 6) sort the commit by decreasing associated value
690
691 7) if the first commit has not been skipped, we can return it and stop
692 -here
692 + here
693
694 8) otherwise filter out all the skipped commits in the sorted list
695
696 9) use a pseudo random number generator (PRNG) to generate a random
697 -number between 0 and 1
697 + number between 0 and 1
698
699 10) multiply this random number with its square root to bias it toward
700 -0
700 + 0
701
702 11) multiply the result by the number of commits in the filtered list
703 -to get an index into this list
703 + to get an index into this list
704
705 12) return the commit at the computed index
706