VladPolskiy/osm2pgsql
1
0
Fork 0
mirror of https://github.com/osm2pgsql-dev/osm2pgsql.git synced 2025-08-19 16:28:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

move new tests into place

Browse Source
This commit is contained in:
Sarah Hoffmann
2019-11-05 23:32:37 +01:00
parent 8678be3374
commit 8859b6eb8e
65 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

119
tests/test-ram-cache.cpp Normal file
View File

@ -0,0 +1,119 @@
#include "catch.hpp"
#include <vector>
#include "node-ram-cache.cpp"
enum class strategy_sparse
{
value = ALLOC_SPARSE
};
enum class strategy_dense
{
value = ALLOC_DENSE
};
enum class strategy_sparse_dense
{
value = ALLOC_SPARSE | ALLOC_DENSE
};
enum class strategy_dense_chunk
{
value = ALLOC_DENSE | ALLOC_DENSE_CHUNK
};
enum class strategy_sparse_dense_chunk
{
value = ALLOC_SPARSE | ALLOC_DENSE | ALLOC_DENSE_CHUNK
};
static constexpr double test_lon(osmid_t id) { return 1 + 1e-5 * id; }
static void check_node(node_ram_cache *cache, osmid_t id, double x, double y)
{
auto node = cache->get(id);
REQUIRE(node.valid());
REQUIRE(node.lon() == Approx(x));
REQUIRE(node.lat() == Approx(y));
}
TEMPLATE_TEST_CASE("Ram cache strict", "[NoDB]", strategy_sparse,
strategy_dense, strategy_sparse_dense, strategy_dense_chunk,
strategy_sparse_dense_chunk)
{
node_ram_cache cache((int)TestType::value, 10);
std::vector<osmid_t> stored_nodes;
// 2 dense blocks, the second partially filled at the star
for (osmid_t id = 0; id < (PER_BLOCK + (PER_BLOCK >> 1) + 1); ++id) {
stored_nodes.push_back(id);
cache.set(id, osmium::Location(test_lon(id), 0.0));
}
// 1 dense block, 75% filled
for (osmid_t id = PER_BLOCK * 2; id < PER_BLOCK * 3; ++id) {
if (id % 4 != 0) {
stored_nodes.push_back(id);
cache.set(id, osmium::Location(test_lon(id), 0.0));
}
}
// 1 dense block, 20%
for (osmid_t id = PER_BLOCK * 3; id < PER_BLOCK * 4; ++id) {
if (id % 5 == 0) {
stored_nodes.push_back(id);
cache.set(id, osmium::Location(test_lon(id), 0.0));
}
}
// A lone sparse node
osmid_t lone_id = PER_BLOCK * 5;
stored_nodes.push_back(lone_id);
cache.set(lone_id, osmium::Location(test_lon(lone_id), 0.0));
// Now read everything back
for (osmid_t id : stored_nodes) {
check_node(&cache, id, test_lon(id), 0.0);
}
}
TEMPLATE_TEST_CASE("Unordered node not allowed", "[NoDB]", strategy_sparse)
{
SECTION("Strict cache")
{
node_ram_cache cache((int)TestType::value, 10);
cache.set(PER_BLOCK + 2, osmium::Location(4.0, 9.3));
REQUIRE_THROWS(cache.set(25, osmium::Location(-4.0, -9.3)));
}
SECTION("Lossy cache")
{
node_ram_cache cache((int)TestType::value | ALLOC_LOSSY, 10);
cache.set(PER_BLOCK + 2, osmium::Location(4.0, 9.3));
REQUIRE_NOTHROW(cache.set(25, osmium::Location(-4.0, -9.3)));
}
}
TEMPLATE_TEST_CASE("Unordered node allowed", "[NoDB]", strategy_dense,
strategy_sparse_dense, strategy_dense_chunk,
strategy_sparse_dense_chunk)
{
SECTION("Strict cache")
{
node_ram_cache cache((int)TestType::value, 10);
cache.set(PER_BLOCK + 2, osmium::Location(4.0, 9.3));
cache.set(25, osmium::Location(-4.0, -9.3));
check_node(&cache, 25, -4.0, -9.3);
}
SECTION("Lossy cache")
{
node_ram_cache cache((int)TestType::value | ALLOC_LOSSY, 10);
cache.set(PER_BLOCK + 2, osmium::Location(4.0, 9.3));
cache.set(25, osmium::Location(-4.0, -9.3));
check_node(&cache, 25, -4.0, -9.3);
}
}