github-repos/benchmark
1
0
Fork 0
mirror of https://github.com/google/benchmark.git synced 2024-12-27 21:10:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

removed check on automatic fit, to avoid random convergence misfits breaking the build

Browse Source
This commit is contained in:
Ismael 2016-06-02 19:01:10 +02:00
parent 8c73d49b77
commit 212cfe1c2e
1 changed files with 3 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
test/complexity_test.cc
View File

@ -153,19 +153,15 @@ void BM_Complexity_O1(benchmark::State& state) {
} }
state.SetComplexityN(state.range_x()); state.SetComplexityN(state.range_x());
} }
BENCHMARK(BM_Complexity_O1)->Range(1, 1<<18)->Complexity();
BENCHMARK(BM_Complexity_O1)->Range(1, 1<<18)->Complexity(benchmark::o1); BENCHMARK(BM_Complexity_O1)->Range(1, 1<<18)->Complexity(benchmark::o1);
BENCHMARK(BM_Complexity_O1)->Range(1, 1<<18)->Complexity([](size_t){return 1.0; }); BENCHMARK(BM_Complexity_O1)->Range(1, 1<<18)->Complexity([](size_t){return 1.0; });
BENCHMARK(BM_Complexity_O1)->Range(1, 1<<18)->Complexity();
std::string big_o_1_test_name = "BM_Complexity_O1_BigO"; std::string big_o_1_test_name = "BM_Complexity_O1_BigO";
std::string rms_o_1_test_name = "BM_Complexity_O1_RMS"; std::string rms_o_1_test_name = "BM_Complexity_O1_RMS";
std::string enum_auto_big_o_1 = "\\([0-9]+\\)"; std::string enum_auto_big_o_1 = "\\([0-9]+\\)";
std::string lambda_big_o_1 = "f\\(N\\)"; std::string lambda_big_o_1 = "f\\(N\\)";
// Add automatic tests
ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests,
big_o_1_test_name, rms_o_1_test_name, enum_auto_big_o_1);
// Add enum tests // Add enum tests
ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests, ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests,
big_o_1_test_name, rms_o_1_test_name, enum_auto_big_o_1); big_o_1_test_name, rms_o_1_test_name, enum_auto_big_o_1);
@ -195,19 +191,15 @@ void BM_Complexity_O_N(benchmark::State& state) {
} }
state.SetComplexityN(state.range_x()); state.SetComplexityN(state.range_x());
} }
BENCHMARK(BM_Complexity_O_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity();
BENCHMARK(BM_Complexity_O_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity(benchmark::oN); BENCHMARK(BM_Complexity_O_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity(benchmark::oN);
BENCHMARK(BM_Complexity_O_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity([](size_t n) -> double{return n; }); BENCHMARK(BM_Complexity_O_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity([](size_t n) -> double{return n; });
BENCHMARK(BM_Complexity_O_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity();
std::string big_o_n_test_name = "BM_Complexity_O_N_BigO"; std::string big_o_n_test_name = "BM_Complexity_O_N_BigO";
std::string rms_o_n_test_name = "BM_Complexity_O_N_RMS"; std::string rms_o_n_test_name = "BM_Complexity_O_N_RMS";
std::string enum_auto_big_o_n = "N"; std::string enum_auto_big_o_n = "N";
std::string lambda_big_o_n = "f\\(N\\)"; std::string lambda_big_o_n = "f\\(N\\)";
// Add automatic tests
ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests,
big_o_n_test_name, rms_o_n_test_name, enum_auto_big_o_n);
// Add enum tests // Add enum tests
ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests, ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests,
big_o_n_test_name, rms_o_n_test_name, enum_auto_big_o_n); big_o_n_test_name, rms_o_n_test_name, enum_auto_big_o_n);
@ -227,19 +219,15 @@ static void BM_Complexity_O_N_log_N(benchmark::State& state) {
} }
state.SetComplexityN(state.range_x()); state.SetComplexityN(state.range_x());
} }
BENCHMARK(BM_Complexity_O_N_log_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity();
BENCHMARK(BM_Complexity_O_N_log_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity(benchmark::oNLogN); BENCHMARK(BM_Complexity_O_N_log_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity(benchmark::oNLogN);
BENCHMARK(BM_Complexity_O_N_log_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity([](size_t n) {return n * log2(n); }); BENCHMARK(BM_Complexity_O_N_log_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity([](size_t n) {return n * log2(n); });
BENCHMARK(BM_Complexity_O_N_log_N) -> RangeMultiplier(2) -> Range(1<<10, 1<<16) -> Complexity();
std::string big_o_n_lg_n_test_name = "BM_Complexity_O_N_log_N_BigO"; std::string big_o_n_lg_n_test_name = "BM_Complexity_O_N_log_N_BigO";
std::string rms_o_n_lg_n_test_name = "BM_Complexity_O_N_log_N_RMS"; std::string rms_o_n_lg_n_test_name = "BM_Complexity_O_N_log_N_RMS";
std::string enum_auto_big_o_n_lg_n = "NlgN"; std::string enum_auto_big_o_n_lg_n = "NlgN";
std::string lambda_big_o_n_lg_n = "f\\(N\\)"; std::string lambda_big_o_n_lg_n = "f\\(N\\)";
// Add automatic tests
ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests,
big_o_n_lg_n_test_name, rms_o_n_lg_n_test_name, enum_auto_big_o_n_lg_n);
// Add enum tests // Add enum tests
ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests, ADD_COMPLEXITY_CASES(&ConsoleOutputTests, &JSONOutputTests, &CSVOutputTests,
big_o_n_lg_n_test_name, rms_o_n_lg_n_test_name, enum_auto_big_o_n_lg_n); big_o_n_lg_n_test_name, rms_o_n_lg_n_test_name, enum_auto_big_o_n_lg_n);