Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
utils::benchmark Namespace Reference

Functions

void printBenchmarkResults (long long int times, double run_time_sec, const char *function_str)

Variables

const double MIN_BENCHMARK_TIME = 1.5

Function Documentation

void utils::benchmark::printBenchmarkResults ( long long int  times,
double  run_time_sec,
const char *  function_str 
)
Parameters:
timesHow many times the test was run
run_time_secRun time of the test in seconds
function_strstring containing the name of the function and arguments

Variable Documentation

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

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines