3 ms·
This is awesome. Didn't know about it, thanks! My approach has been to step exponentially. I go back 1 commit, 2 commits, 4 commits... etc. I'll be using bisec
by azhenley 9y ago
This is awesome. Didn't know about it, thanks!
My approach has been to step exponentially. I go back 1 commit, 2 commits, 4 commits... etc. I'll be using bisect from now on though.
- pishpash 9y agoYou may be implementing an intuitive weighted bisect :)
- maccard 9y agoHeh, I do a binary search. Find last known good build, go half way between, etc
- ChronosKey 9y agoThat's what git bisect does
- maccard 9y agoAnd not everyone uses git, unfortunately.
- mcintyre1994 9y agoThis is what git-bisect does :)
- muxxa 9y agoI wish git bisect could handle the 'find last good build' step by jumping back exponentially through history, then switching to binary search once the last good build is found