mirror of
https://github.com/Brandon-Rozek/website.git
synced 2024-12-22 20:23:07 +00:00
New post
This commit is contained in:
parent
67685c82e7
commit
e617faf805
1 changed files with 32 additions and 0 deletions
32
content/blog/git-bisect-broken-builds.md
Normal file
32
content/blog/git-bisect-broken-builds.md
Normal file
|
@ -0,0 +1,32 @@
|
|||
---
|
||||
title: "Which commit broke the build? Using Git Bisect"
|
||||
date: 2022-05-03T01:15:55-04:00
|
||||
draft: false
|
||||
tags: []
|
||||
math: false
|
||||
---
|
||||
|
||||
Lets imagine a scenario where in the latest merge a test
|
||||
starts failing. Lets say these tests are saved
|
||||
in `test.sh`. Instead of having to test each individual
|
||||
commit in the merge, to see where the test fails, luckily
|
||||
`git bisect` narrows it down in a more efficient way!
|
||||
|
||||
To use:
|
||||
```bash
|
||||
git bisect start [good] [bad]
|
||||
git bisect run test.sh
|
||||
```
|
||||
Where `[good]` and `[bad]` are replaced with their respective
|
||||
commit hashes.
|
||||
|
||||
Under the hood, Git will run a binary search between the good
|
||||
and bad nodes in the commit tree.
|
||||
|
||||
As a reminder, don't forget to make `test.sh` an executable.
|
||||
Starting in Git 2.36 it will provide a warning, but earlier
|
||||
versions will perform the search anyways even with it all
|
||||
failing.
|
||||
|
||||
|
||||
Read more: https://git-scm.com/docs/git-bisect
|
Loading…
Reference in a new issue