aboutsummaryrefslogtreecommitdiffstats
path: root/doc/examples/bench.cpp
diff options
context:
space:
mode:
authorlloyd <[email protected]>2012-02-20 21:10:26 +0000
committerlloyd <[email protected]>2012-02-20 21:10:26 +0000
commite5a1b8c4392b5383af133591cb9238fb8c1b4516 (patch)
treea3f2fdd46fa71ff88227881f81675038c70e79e0 /doc/examples/bench.cpp
parent018bfa3c50ec857ce93b44096fc1890dc7dd65a5 (diff)
The benchmark examples ran very slowly because they were passing
16*1024 to an argument that treated those values as KiB, it took the RNG ~3 seconds to create 16 MiB of data to randomize the input. Change to 16. Also cap the value that can be passed to --buf-size to 1024, for a 1 MiB buffer.
Diffstat (limited to 'doc/examples/bench.cpp')
-rw-r--r--doc/examples/bench.cpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/examples/bench.cpp b/doc/examples/bench.cpp
index 20e6ec40b..6cfd9205f 100644
--- a/doc/examples/bench.cpp
+++ b/doc/examples/bench.cpp
@@ -70,11 +70,11 @@ const std::string algos[] = {
void benchmark_algo(const std::string& algo,
RandomNumberGenerator& rng)
{
- u32bit milliseconds = 3000;
+ u32bit milliseconds = 1000;
Algorithm_Factory& af = global_state().algorithm_factory();
std::map<std::string, double> speeds =
- algorithm_benchmark(algo, af, rng, milliseconds, 16*1024);
+ algorithm_benchmark(algo, af, rng, milliseconds, 16);
std::cout << algo << ":";