dolysis
/
benchmark
mirror of https://github.com/google/benchmark.git
3
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

try disabling liquid for jekyll to fix curly braces (#1536) 

* try disabling liquid for jekyll to fix curly braces

* do it properly with commented out tags
This commit is contained in:
dominic 2023-02-06 15:01:16 +01:00 committed by GitHub
parent 80a3c5e4d9
commit 1318865305
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 11 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/AssemblyTests.md
View File

@ -111,6 +111,7 @@ between compilers or compiler versions. A common example of this
is matching stack frame addresses. In this case regular expressions is matching stack frame addresses. In this case regular expressions
can be used to match the differing bits of output. For example: can be used to match the differing bits of output. For example:
<!-- {% raw %} -->
```c++ ```c++
int ExternInt; int ExternInt;
struct Point { int x, y, z; }; struct Point { int x, y, z; };
@ -127,6 +128,7 @@ extern "C" void test_store_point() {
// CHECK: ret // CHECK: ret
} }
``` ```
<!-- {% endraw %} -->
## Current Requirements and Limitations ## Current Requirements and Limitations

8
docs/user_guide.md
View File

@ -386,14 +386,17 @@ short-hand. The following macro will pick a few appropriate arguments in the
product of the two specified ranges and will generate a benchmark for each such product of the two specified ranges and will generate a benchmark for each such
pair. pair.
<!-- {% raw %} -->
```c++ ```c++
BENCHMARK(BM_SetInsert)->Ranges({{1<<10, 8<<10}, {128, 512}}); BENCHMARK(BM_SetInsert)->Ranges({{1<<10, 8<<10}, {128, 512}});
``` ```
<!-- {% endraw %} -->
Some benchmarks may require specific argument values that cannot be expressed Some benchmarks may require specific argument values that cannot be expressed
with `Ranges`. In this case, `ArgsProduct` offers the ability to generate a with `Ranges`. In this case, `ArgsProduct` offers the ability to generate a
benchmark input for each combination in the product of the supplied vectors. benchmark input for each combination in the product of the supplied vectors.
<!-- {% raw %} -->
```c++ ```c++
BENCHMARK(BM_SetInsert) BENCHMARK(BM_SetInsert)
->ArgsProduct({{1<<10, 3<<10, 8<<10}, {20, 40, 60, 80}}) ->ArgsProduct({{1<<10, 3<<10, 8<<10}, {20, 40, 60, 80}})
@ -412,6 +415,7 @@ BENCHMARK(BM_SetInsert)
->Args({3<<10, 80}) ->Args({3<<10, 80})
->Args({8<<10, 80}); ->Args({8<<10, 80});
``` ```
<!-- {% endraw %} -->
For the most common scenarios, helper methods for creating a list of For the most common scenarios, helper methods for creating a list of
integers for a given sparse or dense range are provided. integers for a given sparse or dense range are provided.
@ -697,6 +701,7 @@ is 1k a 1000 (default, `benchmark::Counter::OneK::kIs1000`), or 1024
When you're compiling in C++11 mode or later you can use `insert()` with When you're compiling in C++11 mode or later you can use `insert()` with
`std::initializer_list`: `std::initializer_list`:
<!-- {% raw %} -->
```c++ ```c++
// With C++11, this can be done: // With C++11, this can be done:
state.counters.insert({{"Foo", numFoos}, {"Bar", numBars}, {"Baz", numBazs}}); state.counters.insert({{"Foo", numFoos}, {"Bar", numBars}, {"Baz", numBazs}});
@ -705,6 +710,7 @@ When you're compiling in C++11 mode or later you can use `insert()` with
state.counters["Bar"] = numBars; state.counters["Bar"] = numBars;
state.counters["Baz"] = numBazs; state.counters["Baz"] = numBazs;
``` ```
<!-- {% endraw %} -->
### Counter Reporting ### Counter Reporting
@ -873,6 +879,7 @@ is measured. But sometimes, it is necessary to do some work inside of
that loop, every iteration, but without counting that time to the benchmark time. that loop, every iteration, but without counting that time to the benchmark time.
That is possible, although it is not recommended, since it has high overhead. That is possible, although it is not recommended, since it has high overhead.
<!-- {% raw %} -->
```c++ ```c++
static void BM_SetInsert_With_Timer_Control(benchmark::State& state) { static void BM_SetInsert_With_Timer_Control(benchmark::State& state) {
std::set<int> data; std::set<int> data;
@ -887,6 +894,7 @@ static void BM_SetInsert_With_Timer_Control(benchmark::State& state) {
} }
BENCHMARK(BM_SetInsert_With_Timer_Control)->Ranges({{1<<10, 8<<10}, {128, 512}}); BENCHMARK(BM_SetInsert_With_Timer_Control)->Ranges({{1<<10, 8<<10}, {128, 512}});
``` ```
<!-- {% endraw %} -->
<a name="manual-timing" /> <a name="manual-timing" />