| line |
true |
false |
branch |
|
32
|
0 |
0 |
times.reserve(k + 1); |
|
33
|
0 |
0 |
std::generate_n(std::back_inserter(times), k + 1, now{}); |
|
|
0 |
0 |
std::generate_n(std::back_inserter(times), k + 1, now{}); |
|
36
|
0 |
0 |
deltas.reserve(k); |
|
37
|
0 |
0 |
std::transform(std::next(times.begin()), times.end(), times.begin(), |
|
|
0 |
0 |
std::transform(std::next(times.begin()), times.end(), times.begin(), |
|
|
0 |
0 |
std::transform(std::next(times.begin()), times.end(), times.begin(), |
|
57
|
0 |
0 |
.iterations; |
|
62
|
0 |
0 |
.result; |
|
64
|
0 |
0 |
FloatDuration(mean(r.begin(), r.end())), |
|
66
|
0 |
0 |
}; |
|
75
|
0 |
0 |
for (int i = 0; i < k; ++i) { |
|
80
|
0 |
0 |
}; |
|
81
|
0 |
0 |
time_clock(1); |
|
83
|
0 |
0 |
auto&& r = run_for_at_least(std::chrono::duration_cast>(clock_cost_estimation_time), iters, time_clock); |
|
86
|
0 |
0 |
times.reserve(nsamples); |
|
87
|
0 |
0 |
std::generate_n(std::back_inserter(times), nsamples, [time_clock, &r] { |
|
|
0 |
0 |
std::generate_n(std::back_inserter(times), nsamples, [time_clock, &r] { |
|
91
|
0 |
0 |
FloatDuration(mean(times.begin(), times.end())), |
|
93
|
0 |
0 |
}; |
|
102
|
0 |
0 |
static Catch::Detail::unique_ptr>> env; |
|
|
0 |
0 |
static Catch::Detail::unique_ptr>> env; |
|
106
|
0 |
0 |
if (env) { |
|
110
|
0 |
0 |
auto iters = Detail::warmup(); |
|
111
|
0 |
0 |
auto resolution = Detail::estimate_clock_resolution(iters); |
|
112
|
0 |
0 |
auto cost = Detail::estimate_clock_cost(resolution.mean); |
|
114
|
0 |
0 |
env = Catch::Detail::make_unique>>( Environment>{resolution, cost} ); |