Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Spiros Bousbouras Newsgroups: comp.compilers Subject: Re: binary search debugging of compilers Date: Thu, 18 May 2023 10:50:24 -0000 (UTC) Organization: A noiseless patient Spider Sender: johnl@iecc.com Approved: comp.compilers@iecc.com Message-ID: <23-05-018@comp.compilers> References: <23-05-013@comp.compilers> MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="15025"; mail-complaints-to="abuse@iecc.com" Keywords: debug, tools Posted-Date: 18 May 2023 13:00:32 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com In-Reply-To: <23-05-013@comp.compilers> Xref: csiph.com comp.compilers:3474 On Wed, 17 May 2023 10:55:27 -0400 Russ Cox 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' ?