Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Add benchmarks comparison job

Browse Source
This commit is contained in:
Siarhei Fedartsou 2024-05-11 22:35:10 +02:00
parent e97bbef807
commit f1a7f87544
2 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/benchmarks/packed_vector.cpp
View File

@ -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;
}

8
src/benchmarks/static_rtree.cpp
View File

@ -44,7 +44,8 @@ void benchmarkQuery(const std::vector<util::Coordinate> &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); });