Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add note on potential go benchmark optimisations #781

Merged
merged 4 commits into from
Nov 22, 2024
Merged

Add note on potential go benchmark optimisations #781

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
96e3de9
Fix style of note on benchmarks running in sequence
PatrickWMartin Jun 22, 2024
11f1177
Add a note on go optimizing benchmarks
PatrickWMartin Jun 22, 2024
f7d7cbf
Fix wording to give a better sense of what go can do to optimize
PatrickWMartin Jun 22, 2024
5042837
Fix missing period
PatrickWMartin Jun 22, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion iteration.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -123,7 +123,9 @@ PASS

What `136 ns/op` means is our function takes on average 136 nanoseconds to run \(on my computer\). Which is pretty ok! To test this it ran it 10000000 times.

_NOTE_ by default Benchmarks are run sequentially.
**Note:** By default benchmarks are run sequentially.

**Note:** Sometimes, Go can optimize your benchmarks in a way that makes them inaccurate, such as eliminating the function being benchmarked. Check your benchmarks to see if the values make sense. If they seem overly optimized, you can follow the strategies in this **[blog post](https://dave.cheney.net/2013/06/30/how-to-write-benchmarks-in-go)**.

## Practice exercises

Expand Down