3 #include "Availability.h"
5 #include "QuadtreeTileID.h"
6 #include "TileAvailabilityFlags.h"
143 return this->_subtreeLevels;
150 return this->_maximumLevel;
159 uint32_t _subtreeLevels;
160 uint32_t _maximumLevel;
161 uint32_t _maximumChildrenSubtrees;
162 std::unique_ptr<AvailabilityNode> _pRoot;
constexpr uint32_t getSubtreeLevels() const noexcept
Gets the number of levels in each subtree.
std::optional< uint32_t > findChildNodeIndex(const QuadtreeTileID &tileID, const AvailabilityNode *pParentNode) const
Find the child node index corresponding to this tile ID and parent node.
bool addLoadedSubtree(AvailabilityNode *pNode, AvailabilitySubtree &&newSubtree) noexcept
Attempts to add a loaded subtree onto the given node.
AvailabilityNode * addNode(const QuadtreeTileID &tileID, AvailabilityNode *pParentNode) noexcept
Attempts to add a child subtree node onto the given parent node.
QuadtreeAvailability(uint32_t subtreeLevels, uint32_t maximumLevel) noexcept
Constructs a new instance.
uint8_t computeAvailability(const QuadtreeTileID &tileID, const AvailabilityNode *pNode) const noexcept
Determines the currently known availability status of the given tile.
uint8_t computeAvailability(const QuadtreeTileID &tileID) const noexcept
Determines the currently known availability status of the given tile.
constexpr uint32_t getMaximumLevel() const noexcept
Gets the index of the maximum level in this implicit tileset.
bool addSubtree(const QuadtreeTileID &tileID, AvailabilitySubtree &&newSubtree) noexcept
Attempts to add an availability subtree into the existing overall availability tree.
AvailabilityNode * getRootNode() noexcept
Gets a pointer to the root subtree node of this implicit tileset.
AvailabilityNode * findChildNode(const QuadtreeTileID &tileID, AvailabilityNode *pParentNode) const
Find the child node corresponding to this tile ID and parent node.
Basic geometry classes for Cesium.
Availability nodes wrap subtree objects and link them together to form a downwardly traversable avail...
Uniquely identifies a node in a quadtree.