commit 240ba4e64eb46e1f5acbafaadae34c2b2ca701eb
author Ismael <ijimenezm@hotmail.es> Thu Jun 02 22:21:52 2016 +0200
committer Ismael <ijimenezm@hotmail.es> Thu Jun 02 22:21:52 2016 +0200
tree 4f0bfb0e2a5d0f18f13b9c55c6da1e6d81b07589
parent f964480080c3e2b3f6f437b76ccd07bbfdb92ad1

changed BigOFunc argument from size_t to int

README.md

diff --git a/README.md b/README.md
index f34e887..e30052d 100644
--- a/README.md
+++ b/README.md
@@ -147,7 +147,7 @@
 
 ```c++
 BENCHMARK(BM_StringCompare)->RangeMultiplier(2)
-    ->Range(1<<10, 1<<18)->Complexity([](size_t n)->double{return n; });
+    ->Range(1<<10, 1<<18)->Complexity([](int n)->double{return n; });
 ```
 
 ### Templated benchmarks

include/benchmark/benchmark_api.h

diff --git a/include/benchmark/benchmark_api.h b/include/benchmark/benchmark_api.h
index 0cb4348..34cd0b5 100644
--- a/include/benchmark/benchmark_api.h
+++ b/include/benchmark/benchmark_api.h
@@ -253,7 +253,7 @@
 
 // BigOFunc is passed to a benchmark in order to specify the asymptotic 
 // computational complexity for the benchmark.
-typedef double(BigOFunc)(size_t);
+typedef double(BigOFunc)(int);
 
 // State is passed to a running Benchmark and contains state for the
 // benchmark to use.

src/complexity.cc

diff --git a/src/complexity.cc b/src/complexity.cc
index 0d53ade..e25aa3c 100644
--- a/src/complexity.cc
+++ b/src/complexity.cc
@@ -29,18 +29,18 @@
 BigOFunc* FittingCurve(BigO complexity) {
   switch (complexity) {
     case oN:
-      return [](size_t n) -> double { return n; };
+      return [](int n) -> double { return n; };
     case oNSquared:
-      return [](size_t n) -> double { return n * n; };
+      return [](int n) -> double { return n * n; };
     case oNCubed:
-      return [](size_t n) -> double { return n * n * n; };
+      return [](int n) -> double { return n * n * n; };
     case oLogN:
-      return [](size_t n) { return log2(n); };
+      return [](int n) { return log2(n); };
     case oNLogN:
-      return [](size_t n) { return n * log2(n); };
+      return [](int n) { return n * log2(n); };
     case o1:
     default:
-      return [](size_t) { return 1.0; };
+      return [](int) { return 1.0; };
   }
 }
 

test/complexity_test.cc

diff --git a/test/complexity_test.cc b/test/complexity_test.cc
index 03bd2dc..662b627 100644
--- a/test/complexity_test.cc
+++ b/test/complexity_test.cc
@@ -154,7 +154,7 @@
   state.SetComplexityN(state.range_x());
 }
 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([](int){return 1.0; });
 BENCHMARK(BM_Complexity_O1) -> Range(1, 1<<18) -> Complexity();
 
 std::string big_o_1_test_name = "BM_Complexity_O1_BigO";
@@ -192,7 +192,7 @@
   state.SetComplexityN(state.range_x());
 }
 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([](int 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";
@@ -220,7 +220,7 @@
   state.SetComplexityN(state.range_x());
 }
 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([](int 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";