blob: 9e62a30f29a0907bdcfa3c109f58e590f24c3a3f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
#include "path-search.hpp"
#include "path-search-result.hpp"
#include "compat/assert.hpp"
#include <Corrade/Containers/ArrayView.h>
#include <utility>
namespace floormat {
std::unique_ptr<path_search_result::node> 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>();
_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 path_search_result::pair>() 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
|
