|
tess 1.0.0
Performance-first tile and path simulation substrate
|
#include <tess/path/path.h>
Public Member Functions | |
| void | reserve_requests (std::size_t request_count) |
| void | reserve_path_nodes (std::size_t node_count) |
| void | reserve_search_nodes (std::size_t node_count) |
| void | clear () noexcept |
| auto | stats () const noexcept -> WeightedPathBatchStats |
Friends | |
| template<typename World, typename Class, std::uint32_t MaxCost> | |
| auto | weighted_path_batch (const World &world, std::span< const PathRequest > requests, WeightedPathBatchScratch &scratch, MissingChunkPolicy policy=MissingChunkPolicy::ReportIndeterminate) -> std::span< const PathResult > |
| Solves a bounded weighted batch without special transitions. | |
| template<typename World, typename Class, std::uint32_t MaxCost, typename Provider> | |
| auto | weighted_path_batch (const World &world, std::span< const PathRequest > requests, WeightedPathBatchScratch &scratch, MissingChunkPolicy policy, const Provider &provider) -> std::span< const PathResult > |
| Solves a provider-aware bounded weighted batch. | |
Owns all temporary and returned storage for weighted batch pathfinding.
Result spans and their paths remain valid until this object is mutated. Reserve request, path, and search capacity to avoid warm allocations.