From f1a7f8754406df68df73fa208b0960d5a3c5b7ff Mon Sep 17 00:00:00 2001 From: Siarhei Fedartsou Date: Sat, 11 May 2024 22:35:10 +0200 Subject: [PATCH] Add benchmarks comparison job --- src/benchmarks/packed_vector.cpp | 8 ++++---- src/benchmarks/static_rtree.cpp | 8 ++++---- 2 files changed, 8 insertions(+), 8 deletions(-) diff --git a/src/benchmarks/packed_vector.cpp b/src/benchmarks/packed_vector.cpp index 6278f0457..62aa1634d 100644 --- a/src/benchmarks/packed_vector.cpp +++ b/src/benchmarks/packed_vector.cpp @@ -73,9 +73,9 @@ int main(int, char **) auto write_slowdown = result_packed.random_write_ms / result_plain.random_write_ms; auto read_slowdown = result_packed.random_read_ms / result_plain.random_read_ms; std::cout << "random write:\nstd::vector " << result_plain.random_write_ms - << " ms\nutil::packed_vector " << result_packed.random_write_ms << " ms\n" - << "slowdown: " << write_slowdown << std::endl; + << " ms\nutil::packed_vector " << result_packed.random_write_ms << " ms\n" + << "slowdown: " << write_slowdown << std::endl; std::cout << "random read:\nstd::vector " << result_plain.random_read_ms - << " ms\nutil::packed_vector " << result_packed.random_read_ms << " ms\n" - << "slowdown: " << read_slowdown << std::endl; + << " ms\nutil::packed_vector " << result_packed.random_read_ms << " ms\n" + << "slowdown: " << read_slowdown << std::endl; } diff --git a/src/benchmarks/static_rtree.cpp b/src/benchmarks/static_rtree.cpp index c09a66786..eaa784ea8 100644 --- a/src/benchmarks/static_rtree.cpp +++ b/src/benchmarks/static_rtree.cpp @@ -44,7 +44,8 @@ void benchmarkQuery(const std::vector &queries, } TIMER_STOP(query); - std::cout << name << ":\n" << TIMER_MSEC(query) << "ms" + std::cout << name << ":\n" + << TIMER_MSEC(query) << "ms" << " -> " << TIMER_MSEC(query) / queries.size() << " ms/query" << std::endl; } @@ -60,9 +61,8 @@ void benchmark(BenchStaticRTree &rtree, unsigned num_queries) util::FixedLatitude{lat_udist(mt_rand)}); } - benchmarkQuery(queries, - "1 result", - [&rtree](const util::Coordinate &q) { return rtree.Nearest(q, 1); }); + benchmarkQuery( + queries, "1 result", [&rtree](const util::Coordinate &q) { return rtree.Nearest(q, 1); }); benchmarkQuery(queries, "10 results", [&rtree](const util::Coordinate &q) { return rtree.Nearest(q, 10); });