9 class QuadtreeTilingScheme;
30 : level(level_), x(x_), y(y_) {}
36 return this->level == other.level && this->x == other.x &&
44 return !(*
this == other);
68 if (this->level == 0) {
71 return QuadtreeTileID(this->level - 1, this->x >> 1, this->y >> 1);
Defines how a rectangular region is divided into quadtree tiles.
Basic geometry classes for Cesium.
Uniquely identifies a node in a quadtree.
uint32_t computeInvertedY(const QuadtreeTilingScheme &tilingScheme) const noexcept
Computes the inverse y-coordinate of this tile ID.
uint32_t y
The y-coordinate of this tile ID.
constexpr bool operator==(const QuadtreeTileID &other) const noexcept
Returns true if two identifiers are equal.
uint32_t x
The x-coordinate of this tile ID.
uint32_t level
The level of this tile ID, with 0 being the root tile.
constexpr bool operator!=(const QuadtreeTileID &other) const noexcept
Returns true if two identifiers are not equal.
constexpr QuadtreeTileID getParent() const noexcept
Gets the ID of the parent of the tile with this ID.
constexpr QuadtreeTileID(uint32_t level_, uint32_t x_, uint32_t y_) noexcept
Creates a new instance.
A node of a tile hierarchy that was created by upsampling the tile content of a parent node.
QuadtreeTileID tileID
The QuadtreeTileID for this tree node.
size_t operator()(const CesiumGeometry::QuadtreeTileID &key) const noexcept
A specialization of the std::hash template for CesiumGeometry::QuadtreeTileID objects.