Groups | Search | Server Info | Login | Register

Re: binary search debugging of compilers

From	Spiros Bousbouras <spibou@gmail.com>
Newsgroups	comp.compilers
Subject	Re: binary search debugging of compilers
Date	2023-05-18 10:50 +0000
Organization	A noiseless patient Spider
Message-ID	<23-05-018@comp.compilers> (permalink)
References	<CADSkJJVN7RGqhgVDZaz_K5be6uEDaMofMu5OF3RR4Y5-fDu00Q@mail.gmail.com> <23-05-013@comp.compilers>

Show all headers | View raw

On Wed, 17 May 2023 10:55:27 -0400
Russ Cox <rsc@swtch.com> wrote:
> When BitKeeper came along, we added this:
>
>        --longest        Restrict  the  deltas  to  those  on  the longest line
>                         between the two range endpoints.  Unlike a range, the
>                         lower bound is included in the output.
>
> because BitKeeper history is a lattice, not a straight line.  So your
> test points became
>
>         bk changes -nd:REV: > REVS
>
> and binary search over those.  That gets you the longest "straight" line
> in the graph.

Any partial ordering can be extended to a total ordering. Why can't you
just do that instead of using  'the longest "straight" line' ?

Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

Re: binary search debugging of compilers Russ Cox <rsc@swtch.com> - 2023-05-17 10:55 -0400
  Re: binary search debugging of compilers Cameron McInally <cameron.mcinally@nyu.edu> - 2023-05-17 13:40 -0400
  Re: binary search debugging of compilers Kaz Kylheku <864-117-4973@kylheku.com> - 2023-05-17 18:47 +0000
  Re: binary search debugging of compilers Spiros Bousbouras <spibou@gmail.com> - 2023-05-18 10:50 +0000
    Re: binary search debugging of compilers Kaz Kylheku <864-117-4973@kylheku.com> - 2023-05-19 03:44 +0000
    binary search debugging of compilers Cliff Click <cclick0@gmail.com> - 2023-05-19 10:47 -0700
  Re: binary search debugging of compilers mrs@kithrup.com (Mike Stump) - 2023-05-20 18:04 +0000

csiph-web