#include "path-search.hpp" #include "path-search-result.hpp" #include "compat/assert.hpp" #include #include namespace floormat { std::unique_ptr path_search_result::_pool; // NOLINT path_search_result::path_search_result() { if (_pool) { auto ptr = std::move(_pool); fm_debug_assert(ptr->vec.empty()); auto next = std::move(ptr->_next); _node = std::move(ptr); _pool = std::move(next); } else { _node = std::make_unique(); _node->vec.reserve(min_length); } } path_search_result::~path_search_result() noexcept { if (_node) [[likely]] { _node->vec.clear(); _node->_next = std::move(_pool); _pool = std::move(_node); } } path_search_result::path_search_result(const path_search_result& x) noexcept { fm_debug_assert(x._node); auto self = path_search_result{}; self._node->vec = x._node->vec; _node = std::move(self._node); } path_search_result& path_search_result::operator=(const path_search_result& x) noexcept { fm_debug_assert(_node); fm_debug_assert(!_node->_next); if (&x != this) _node->vec = x._node->vec; return *this; } path_search_result::node::node() noexcept = default; size_t path_search_result::size() const { return _node->vec.size(); } auto path_search_result::data() const -> const pair* { return _node->vec.data(); } path_search_result::operator bool() const { return !_node->vec.empty(); } path_search_result::operator ArrayView() const { fm_debug_assert(_node); return {_node->vec.data(), _node->vec.size()}; } auto path_search_result::operator[](size_t index) const -> const pair& { fm_debug_assert(_node); fm_debug_assert(index < _node->vec.size()); return data()[index]; } } // namespace floormat