[core] add algorithm for detecting whether an ordered map contains covering children

This commit is contained in:
Konstantin Käfer
2016-03-08 13:59:31 +01:00
parent 82ebcfa14e
commit ecc8e018fa
4 changed files with 98 additions and 1 deletions

View File

@@ -0,0 +1,34 @@
#ifndef MBGL_ALGORITHM_COVERED_BY_CHILDREN
#define MBGL_ALGORITHM_COVERED_BY_CHILDREN
#include <mbgl/tile/tile_id.hpp>
namespace mbgl {
namespace algorithm {
template <typename Iterator>
bool coveredByChildren(const UnwrappedTileID& id, Iterator it, const Iterator& end) {
for (const auto& child : id.children()) {
it = std::lower_bound(it, end, child, [](auto& a, auto& b) { return std::get<0>(a) < b; });
if (it == end) {
return false;
} else if (std::get<0>(*it) != child) {
return coveredByChildren(child, it, end);
}
}
// We looked at all four immediate children and verified that they're covered.
return true;
}
template <typename Container>
bool coveredByChildren(const UnwrappedTileID& id, const Container& container) {
return coveredByChildren(
id, container.upper_bound(id),
container.lower_bound(UnwrappedTileID{ static_cast<int16_t>(id.wrap + 1), { 0, 0, 0 } }));
}
} // namespace algorithm
} // namespace mbgl
#endif

View File

@@ -0,0 +1,61 @@
#include <mbgl/test/util.hpp>
#include <mbgl/algorithm/covered_by_children.hpp>
#include <map>
using namespace mbgl;
using List = std::map<UnwrappedTileID, bool>;
TEST(CoveredByChildren, NotCovered) {
const List list1;
EXPECT_FALSE(algorithm::coveredByChildren(UnwrappedTileID{ 0, 0, 0 }, list1));
const List list2{
{ UnwrappedTileID{ 0, 0, 0 }, true },
// 3 out of 4 child tiles
{ UnwrappedTileID{ 1, 0, 0 }, true },
{ UnwrappedTileID{ 1, 0, 1 }, true },
// missing 1/1/0
{ UnwrappedTileID{ 1, 1, 1 }, true },
};
EXPECT_FALSE(algorithm::coveredByChildren(UnwrappedTileID{ 0, 0, 0 }, list2));
const List list3{
{ UnwrappedTileID{ 0, 0, 0 }, true },
// all four child tiles, with with a different wrap index
{ UnwrappedTileID{ 1, { 1, 0, 0 } }, true },
{ UnwrappedTileID{ 1, { 1, 0, 1 } }, true },
{ UnwrappedTileID{ 1, { 1, 1, 0 } }, true },
{ UnwrappedTileID{ 1, { 1, 1, 1 } }, true },
};
EXPECT_FALSE(algorithm::coveredByChildren(UnwrappedTileID{ 0, 0, 0 }, list3));
}
TEST(CoveredByChildren, Covered) {
const List list1{
{ UnwrappedTileID{ 0, 0, 0 }, true },
// all four child tiles
{ UnwrappedTileID{ 1, 0, 0 }, true },
{ UnwrappedTileID{ 1, 0, 1 }, true },
{ UnwrappedTileID{ 1, 1, 0 }, true },
{ UnwrappedTileID{ 1, 1, 1 }, true },
};
EXPECT_TRUE(algorithm::coveredByChildren(UnwrappedTileID{ 0, 0, 0 }, list1));
const List list2{
{ UnwrappedTileID{ 0, 0, 0 }, true },
// missing 1/0/0
{ UnwrappedTileID{ 1, 0, 1 }, true },
{ UnwrappedTileID{ 1, 1, 0 }, true },
{ UnwrappedTileID{ 1, 1, 1 }, true },
{ UnwrappedTileID{ 2, 0, 0 }, true },
{ UnwrappedTileID{ 2, 0, 1 }, true },
{ UnwrappedTileID{ 2, 1, 0 }, true },
{ UnwrappedTileID{ 2, 1, 1 }, true },
};
EXPECT_TRUE(algorithm::coveredByChildren(UnwrappedTileID{ 0, 0, 0 }, list2));
EXPECT_TRUE(algorithm::coveredByChildren(UnwrappedTileID{ 1, 0, 0 }, list2));
EXPECT_FALSE(algorithm::coveredByChildren(UnwrappedTileID{ 2, 0, 0 }, list2));
}

View File

@@ -34,6 +34,8 @@
'util/token.cpp',
'util/work_queue.cpp',
'algorithm/covered_by_children.cpp',
'api/annotations.cpp',
'api/api_misuse.cpp',
'api/repeated_render.cpp',

View File

@@ -1,4 +1,4 @@
#include "../fixtures/util.hpp"
#include <mbgl/test/util.hpp>
#include <mbgl/tile/tile_id.hpp>