nanobench
hyperfine
| nanobench | hyperfine | |
|---|---|---|
| 13 | 74 | |
| 1,315 | 20,020 | |
| - | - | |
| 0.0 | 8.1 | |
| 8 days ago | 4 days ago | |
| C++ | Rust | |
| MIT License | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
nanobench
-
The issue of unit tests and performance measurements (Benchmark)
An alternative is tracking the number of instructions a test executes: https://github.com/martinus/nanobench
-
how do you properly benchmark?
Nano bench is a great library with low overhead. https://github.com/martinus/nanobench
-
Much Faster than std::string, fmt::format, std::to_chars, std::time and more?
I've done a relatively simple test of taking random doubles (between 0 and 1), converting them to a C string via std::to_chars and then converting that C string back to a double via std::from_chars vs his xeerx::chars_to and got the following results on my machine via nanobench:
-
Can you give an example of well-designed C++ code, and explain why you think it is so?
I like https://nanobench.ankerl.com/
-
Best accurate way to measure/compare elapsed time in C++
Of course, the best way to benchmark is nanobench: https://nanobench.ankerl.com/
-
The 23 year-old C++ developers with three job offers over $500k
I've created robin-hood-hashing and nanobench, and recently made some contributions to Bitcoin and doxygen
-
I don’t know which container to use (and at this point I’m too afraid to ask)
Right. Regex runtime construction is known to be slow, so ideally the state machinery construction is built at compile time (boost.xpressive, ctre). Also, boost.regex is faster than most of the std implementations if compile time isn’t possible. And if that’s no good rewrite without regex. Since it sounds like it’s all encapsulated at least it would be easy to measure the options. These days I use this one to compare https://nanobench.ankerl.com/
-
I'm writing a microbenchmarking library called "precision" without any macros. What do you guys think of the API?
You can check the API of nanobench which also doesn't use macros, as far as I have used it.
-
C++20 std::format is 2x slower than std::fstream?
I've tried again with your latest changes and decided to use https://github.com/martinus/nanobench for a better benchmark and got the following output:
- Nanobench: Fast, Accurate, Single-Header Microbenchmarking Functionality For C++
hyperfine
-
Measuring startup and shutdown overhead of several code interpreters
Check out the official hyperfine Github repo
-
Bun - The One Tool for All Your JavaScript/Typescript Project's Needs?
And then I used hyperfine to run the benchmarks on my MacBook Pro 14 M2 Max, and here are the results:
-
Faster tetranucleotide (k-mer) frequencies!
Search "benchmarking tools for linux" and decide that hyperfine is good for what I'm doing. Run Jennifer's new python script against my refactored perl and find that the python is 1.26 times faster for k=3 and 1.47 times faster for k=4. For the Covid-19 sequence, these are both on the order of hundreds of milliseconds.
- Hyperfine: A command-line benchmarking tool
- FLaNK Weekly 08 Jan 2024
-
Show HN: Inshellisense – IDE style shell autocomplete
> It is very possible to write sub 100ms procedures in TS, […]
I will not disagree with this statement because I don’t have a way to test inshellisense right now. Could you (or anyone with a working Node + NPM installation) please install inshellisense and post the actual numbers? Perhaps using a tool like hyperfine (https://github.com/sharkdp/hyperfine).
-
Firefox has surpassed Chrome on Speedometer
Yeah, while it's not as thorough as these tools, the method is at least reproducible and sane, and with ~10 or so samples, you get an interval with a nice confidence.
Another through method will be hyperfine[0], yet I wanted to provide a method which requires no installation and can be done in a whim, without jumps and hoops, with the tools already at hand.
[0]: https://github.com/sharkdp/hyperfine
-
How to optimize your config? What are mistakes to avoid when optimizing your config?
That is native and inbuild but I would suggest below options instead 1. Using lazy's Profile tab instead https://github.com/folke/lazy.nvim 2. Using a dedicated plugin to do this https://github.com/dstein64/vim-startuptime. 3. Using an external program hyperfine is one that I use https://github.com/sharkdp/hyperfine
-
How to remove all <br> from all of my .html files
Fair enough, although might I recommend using hyperfine for your testing? ;p
What are some alternatives?
benchmark - A microbenchmark support library
criterion.rs - Statistics-driven benchmarking library for Rust
fast_io - C++20 Concepts IO library which is 10x faster than stdio and iostream
fd - A simple, fast and user-friendly alternative to 'find'
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
curl4cpp - Single header cURL wrapper for C++ around libcURL
awesome-mac - Now we have become very big, Different from the original idea. Collect premium software in various categories.
ut - C++20 μ(micro)/Unit Testing Framework
kubeconform - A FAST Kubernetes manifests validator, with support for Custom Resources!
bench-rest - bench-rest - benchmark REST (HTTP/HTTPS) API's. node.js client module for easy load testing / benchmarking REST API's using a simple structure/DSL can create REST flows with setup and teardown and returns (measured) metrics.
quinn - Async-friendly QUIC implementation in Rust