mirror of https://github.com/google/benchmark.git
Remove redundant formatting tags (#1420)
This commit is contained in:
parent
b7afda2cd2
commit
7280499e8e
|
@ -383,17 +383,14 @@ 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
|
||||
pair.
|
||||
|
||||
{% raw %}
|
||||
```c++
|
||||
BENCHMARK(BM_SetInsert)->Ranges({{1<<10, 8<<10}, {128, 512}});
|
||||
```
|
||||
{% endraw %}
|
||||
|
||||
Some benchmarks may require specific argument values that cannot be expressed
|
||||
with `Ranges`. In this case, `ArgsProduct` offers the ability to generate a
|
||||
benchmark input for each combination in the product of the supplied vectors.
|
||||
|
||||
{% raw %}
|
||||
```c++
|
||||
BENCHMARK(BM_SetInsert)
|
||||
->ArgsProduct({{1<<10, 3<<10, 8<<10}, {20, 40, 60, 80}})
|
||||
|
@ -412,7 +409,6 @@ BENCHMARK(BM_SetInsert)
|
|||
->Args({3<<10, 80})
|
||||
->Args({8<<10, 80});
|
||||
```
|
||||
{% endraw %}
|
||||
|
||||
For the most common scenarios, helper methods for creating a list of
|
||||
integers for a given sparse or dense range are provided.
|
||||
|
@ -698,7 +694,6 @@ 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
|
||||
`std::initializer_list`:
|
||||
|
||||
{% raw %}
|
||||
```c++
|
||||
// With C++11, this can be done:
|
||||
state.counters.insert({{"Foo", numFoos}, {"Bar", numBars}, {"Baz", numBazs}});
|
||||
|
@ -707,7 +702,6 @@ When you're compiling in C++11 mode or later you can use `insert()` with
|
|||
state.counters["Bar"] = numBars;
|
||||
state.counters["Baz"] = numBazs;
|
||||
```
|
||||
{% endraw %}
|
||||
|
||||
### Counter Reporting
|
||||
|
||||
|
@ -876,7 +870,6 @@ 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 is possible, although it is not recommended, since it has high overhead.
|
||||
|
||||
{% raw %}
|
||||
```c++
|
||||
static void BM_SetInsert_With_Timer_Control(benchmark::State& state) {
|
||||
std::set<int> data;
|
||||
|
@ -891,7 +884,6 @@ static void BM_SetInsert_With_Timer_Control(benchmark::State& state) {
|
|||
}
|
||||
BENCHMARK(BM_SetInsert_With_Timer_Control)->Ranges({{1<<10, 8<<10}, {128, 512}});
|
||||
```
|
||||
{% endraw %}
|
||||
|
||||
<a name="manual-timing" />
|
||||
|
||||
|
|
Loading…
Reference in New Issue