Jon Seymour <jon.seymour@xxxxxxxxx> writes:
> On Tue, Jul 26, 2011 at 4:48 AM, Johannes Sixt <j6t@xxxxxxxx> wrote:
>> Am 25.07.2011 11:28, schrieb Jon Seymour:
>>> On Mon, Jul 25, 2011 at 4:35 AM, Junio C Hamano <gitster@xxxxxxxxx> wrote:
>>>> Jon Seymour <jon.seymour@xxxxxxxxx> writes:
>>
>> The fundamental preconditions of bisection are: that there is a single
>> event in the sequence, and that the effects of the event propagate to
>> the end of the sequence.
>
> More correctly: the fundamental pre-condition of a single round of
> bisection finding an event of interest is as you say.
>
> There is nothing that prevents multiple rounds of bisection being
> used, if required.
No, it is not true. Think of bisection as in original application, as
numerical methods used to find root of one dimensional function. It
works if there is single root between starting endpoints, or rather if
endpoints have different signs.
Which means that it works in this case:
bad bad bad
BAD
good good good
but won't work in this case:
good good good good good good
bad bad bad
--
Jakub Narębski
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html