37cb2bd756
* src/mbgl/annotation/annotation_manager.hpp * src/mbgl/algorithm/update_renderables.hpp * src/mbgl/geometry/glyph_atlas.hpp * src/mbgl/renderer/painter.cpp and src/mbgl/renderer/render_item.hpp * src/mbgl/renderer/symbol_bucket.hpp and src/mbgl/text/glyph_store.hpp * src/mbgl/sprite/sprite_atlas.hpp * include/mbgl/storage/network_status.hpp * src/mbgl/text/collision_tile.cpp * src/mbgl/style/update_batch.hpp * platform/default/mbgl/storage/offline_download.hpp * Add GlyphRangeSet typedef * Fix whitespace & unused imports
116 lines
4.6 KiB
C++
116 lines
4.6 KiB
C++
#pragma once
|
|
|
|
#include <mbgl/tile/tile_id.hpp>
|
|
#include <mbgl/util/range.hpp>
|
|
#include <mbgl/storage/resource.hpp>
|
|
|
|
#include <unordered_set>
|
|
|
|
namespace mbgl {
|
|
namespace algorithm {
|
|
|
|
template <typename GetTileFn,
|
|
typename CreateTileFn,
|
|
typename RetainTileFn,
|
|
typename RenderTileFn,
|
|
typename IdealTileIDs>
|
|
void updateRenderables(GetTileFn getTile,
|
|
CreateTileFn createTile,
|
|
RetainTileFn retainTile,
|
|
RenderTileFn renderTile,
|
|
const IdealTileIDs& idealTileIDs,
|
|
const Range<uint8_t>& zoomRange,
|
|
const uint8_t dataTileZoom) {
|
|
std::unordered_set<UnwrappedTileID> checked;
|
|
bool covered;
|
|
int32_t overscaledZ;
|
|
|
|
// for (all in the set of ideal tiles of the source) {
|
|
for (const auto& idealRenderTileID : idealTileIDs) {
|
|
assert(idealRenderTileID.canonical.z >= zoomRange.min);
|
|
assert(idealRenderTileID.canonical.z <= zoomRange.max);
|
|
assert(dataTileZoom >= idealRenderTileID.canonical.z);
|
|
|
|
const OverscaledTileID idealDataTileID(dataTileZoom, idealRenderTileID.canonical);
|
|
auto tile = getTile(idealDataTileID);
|
|
if (!tile) {
|
|
tile = createTile(idealDataTileID);
|
|
assert(tile);
|
|
}
|
|
|
|
// if (source has the tile and bucket is loaded) {
|
|
if (tile->isRenderable()) {
|
|
retainTile(*tile, Resource::Necessity::Required);
|
|
renderTile(idealRenderTileID, *tile);
|
|
} else {
|
|
bool triedPrevious = tile->hasTriedOptional();
|
|
|
|
// The tile isn't loaded yet, but retain it anyway because it's an ideal tile.
|
|
retainTile(*tile, Resource::Necessity::Required);
|
|
covered = true;
|
|
overscaledZ = dataTileZoom + 1;
|
|
if (overscaledZ > zoomRange.max) {
|
|
// We're looking for an overzoomed child tile.
|
|
const auto childDataTileID = idealDataTileID.scaledTo(overscaledZ);
|
|
tile = getTile(childDataTileID);
|
|
if (tile && tile->isRenderable()) {
|
|
retainTile(*tile, Resource::Necessity::Optional);
|
|
renderTile(idealRenderTileID, *tile);
|
|
} else {
|
|
covered = false;
|
|
}
|
|
} else {
|
|
// Check all four actual child tiles.
|
|
for (const auto& childTileID : idealDataTileID.canonical.children()) {
|
|
const OverscaledTileID childDataTileID(overscaledZ, childTileID);
|
|
tile = getTile(childDataTileID);
|
|
if (tile && tile->isRenderable()) {
|
|
retainTile(*tile, Resource::Necessity::Optional);
|
|
renderTile(childDataTileID.unwrapTo(idealRenderTileID.wrap), *tile);
|
|
} else {
|
|
// At least one child tile doesn't exist, so we are going to look for
|
|
// parents as well.
|
|
covered = false;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!covered) {
|
|
// We couldn't find child tiles that entirely cover the ideal tile.
|
|
for (overscaledZ = dataTileZoom - 1; overscaledZ >= zoomRange.min; --overscaledZ) {
|
|
const auto parentDataTileID = idealDataTileID.scaledTo(overscaledZ);
|
|
const auto parentRenderTileID =
|
|
parentDataTileID.unwrapTo(idealRenderTileID.wrap);
|
|
|
|
if (checked.find(parentRenderTileID) != checked.end()) {
|
|
// Break parent tile ascent, this route has been checked by another child
|
|
// tile before.
|
|
break;
|
|
} else {
|
|
checked.emplace(parentRenderTileID);
|
|
}
|
|
|
|
tile = getTile(parentDataTileID);
|
|
if (!tile && triedPrevious) {
|
|
tile = createTile(parentDataTileID);
|
|
}
|
|
|
|
if (tile) {
|
|
triedPrevious = tile->hasTriedOptional();
|
|
retainTile(*tile, Resource::Necessity::Optional);
|
|
|
|
if (tile->isRenderable()) {
|
|
renderTile(parentRenderTileID, *tile);
|
|
// Break parent tile ascent, since we found one.
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
} // namespace algorithm
|
|
} // namespace mbgl
|