On Sun, Jan 17, 2021 at 1:34 PM Grr <gebbe...@gmail.com> wrote: > > Sort of binary search? You're right, that's faster. I tend to see it like a > sequence rather than a searchable collection
Oh yes, bisect does a binary search of a sequence of commits to find the one that broke something. I've used it to find which commit introduced a subtle bug, where there were tens of thousands of commits between a "known good" revision and a "known bad" revision, and by using bisect I only had to test maybe 10 or 15 revisions. The bigger the search space, the more useful bisect is. For Git, bisect is built in [1]. For Subversion, there's a perl script to do it [2]. It might be helpful for you in this case, but even if not, it's good to know how to use it when you need it. [1] https://git-scm.com/docs/git-bisect [2] https://metacpan.org/pod/distribution/App-SVN-Bisect/bin/svn-bisect Nathan
