github-repos/benchmark
1
0
Fork 0
mirror of https://github.com/google/benchmark.git synced 2025-01-16 06:40:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor least square .h

Browse Source
This commit is contained in:
Ismael 2016-05-23 20:34:01 +02:00
parent 266addc3f5
commit fed9b6f211
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/minimal_leastsq.h
View File

@ -41,6 +41,6 @@ struct LeastSq {
}; };
// Find the coefficient for the high-order term in the running time, by minimizing the sum of squares of relative error. // Find the coefficient for the high-order term in the running time, by minimizing the sum of squares of relative error.
LeastSq MinimalLeastSq(const std::vector<int>& N, const std::vector<double>& Time, const benchmark::BigO Complexity = benchmark::oAuto); LeastSq MinimalLeastSq(const std::vector<int>& n, const std::vector<double>& time, const benchmark::BigO vomplexity = benchmark::oAuto);
#endif #endif