Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
Functions | |
void | printBenchmarkResults (long long int times, double run_time_sec, const char *function_str) |
Variables | |
const double | MIN_BENCHMARK_TIME = 1.5 |
void utils::benchmark::printBenchmarkResults | ( | long long int | times, |
double | run_time_sec, | ||
const char * | function_str | ||
) |
times | How many times the test was run |
run_time_sec | Run time of the test in seconds |
function_str | string containing the name of the function and arguments |
const double utils::benchmark::MIN_BENCHMARK_TIME = 1.5 |
Minimum time (in seconds) for benchmark to have usedul results.
Note: current implementation of benchmark is using system timer to determine running time. This have the best resolution of 16ms and may wildly change, the present constant is conservative for reliable benchmarking