3 ms·
Expanding on other comments: binary search is extremely sensitive to false positives and false negatives… false information generally. While other approaches w
by cwillu 3y ago
Expanding on other comments: binary search is extremely sensitive to false positives and false negatives… false information generally. While other approaches will still put you in the right ballpark even with some amount of incorrect information, a binary search with a single flipped bit will consistently land you in entirely unrelated areas, so you need to be _damn_ sure your “git bisect good/bad” is correct.
- rwmj 3y agoIn the other post there was an interesting discussion about different approaches to searching for a bug (other than straight bisection) when your test is unreliable: https://news.ycombinator.com/item?id=36327263 https://news.ycombinator.com/item?id=36327263
- wging 3y agoThere is `git bisect skip` (https://git-scm.com/docs/git-bisect#_bisect_skip https://git-scm.com/docs/git-bisect#_bisect_skip), which lets you cope with a testing process that sometimes doesn't yield a true/false result. But it's more useful for untestable commits than for inconclusive results like you'd get from a single boot here.