tess::RegionGraphScratch Class Reference

Reusable frontier and visitation storage for graph reachability queries. More...

#include <tess/topology/topology.h>

Public Member Functions
void	reserve_regions (std::size_t count)
auto	capacity () const noexcept -> std::size_t

Friends
template<typename Shape, typename Residency>
auto	reachable (const RegionGraphT< Residency > &graph, PathRequest request, RegionGraphScratch &scratch) -> ReachabilityResult
	Queries graph reachability between two world coordinates.
template<typename Shape, typename Residency>
auto	coarse_path (const RegionGraphT< Residency > &graph, PathRequest request, RegionGraphScratch &scratch) -> CoarsePathResult

Detailed Description

Reusable frontier and visitation storage for graph reachability queries.

Friends And Related Symbol Documentation

coarse_path

template<typename Shape, typename Residency>

auto coarse_path ( const RegionGraphT< Residency > & graph, PathRequest request, RegionGraphScratch & scratch ) -> CoarsePathResult

friend

Finds a deterministic shortest path through regions and chunk portals.

Returned spans borrow scratch and expire on its next traversal. The corridor bounds cover the complete chunks on the selected region path.

---

The documentation for this class was generated from the following file:

• include/tess/topology/topology.h