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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
|
#include "path-search.hpp"
#include "global-coords.hpp"
#include "object.hpp"
#include "world.hpp"
#include "RTree-search.hpp"
#include <bit>
#include <algorithm>
#include <Corrade/Containers/Optional.h>
#include <Corrade/Containers/PairStl.h>
#include <Magnum/Math/Range.h>
namespace floormat {
path_search_result::path_search_result() = default;
void path_search::ensure_allocated(chunk_coords a, chunk_coords b)
{
auto new_size = Math::abs(a - b) + Vector2i(3);
auto new_start = Vector2i(std::min(a.x, b.x), std::min(a.y, b.y)) - Vector2i(1);
auto size1 = new_size.product();
fm_debug_assert(size1 > 0);
cache.start = new_start;
if ((size_t)size1 > cache.array.size())
{
cache.array = Array<chunk_tiles_cache>{ValueInit, (size_t)size1};
cache.size = new_size;
}
else
for (auto& x : cache.array)
x = {};
}
bool path_search::is_passable_1(chunk& c, Vector2 min, Vector2 max, object_id own_id)
{
auto& rt = *c.rtree();
bool is_passable = true;
rt.Search(min.data(), max.data(), [&](uint64_t data, const auto&) {
[[maybe_unused]] auto x = std::bit_cast<collision_data>(data);
if (x.data != own_id && x.pass != (uint64_t)pass_mode::pass)
{
is_passable = false;
return false;
}
else
return true;
});
return is_passable;
}
bool path_search::is_passable(world& w, chunk_coords_ ch0, Vector2 min, Vector2 max, object_id own_id)
{
if (auto* c = w.at(ch0))
// it's not correct to return true if c == nullptr
// because neighbors can still contain bounding boxes for that tile
if (!is_passable_1(*c, min, max, own_id))
return false;
for (auto nb : world::neighbor_offsets)
{
static_assert(iTILE_SIZE2.x() == iTILE_SIZE2.y());
constexpr auto chunk_size = iTILE_SIZE2 * TILE_MAX_DIM;
constexpr int bbox_max = 1 << sizeof(Vector2b().x())*8;
constexpr auto chunk_max = chunk_size + Vector2i(bbox_max);
const auto off = Vector2(nb)*Vector2(chunk_size);
const auto min_ = min - off, max_ = max - off;
if (min_.x() > chunk_max.x() || min_.y() > chunk_max.y())
continue;
if (max_.x() < -bbox_max || max_.y() < -bbox_max)
continue;
if (auto* c2 = w.at(ch0 + Vector2i(nb)))
if (!is_passable_1(*c2, min_, max_, own_id))
return false;
}
return true;
}
bool path_search::is_passable(world& w, global_coords coord, Vector2b offset, Vector2ub size_, object_id own_id)
{
auto center = iTILE_SIZE2 * Vector2i(coord.local()) + Vector2i(offset);
auto size = Vector2(size_);
auto min = Vector2(center) - size*.5f, max = min + size;
return is_passable(w, coord, min, max, own_id);
}
auto path_search::make_neighbor_tile_bbox(Vector2i coord, Vector2ub own_size, rotation r) -> bbox
{
constexpr auto get_value = [](Vector2i sz, rotation r) constexpr -> Pair<Vector2i, Vector2i>
{
constexpr auto half_tile = iTILE_SIZE2/2;
constexpr int offset_W = iTILE_SIZE2.x(), offset_N = iTILE_SIZE2.y();
const auto r_ = (uint8_t)r;
CORRADE_ASSUME(r_ <= (uint8_t)rotation_COUNT);
switch (r_)
{
case (uint8_t)rotation::N: {
const auto empty_space_NS = (iTILE_SIZE2.x() - sz.x()) / 2;
auto min_N = Vector2i(-half_tile.x() + empty_space_NS, -offset_N );
auto max_N = Vector2i(min_N.x() + sz.x(), 0 );
return {min_N, max_N};
}
case (uint8_t)rotation::S: {
const auto empty_space_NS = (iTILE_SIZE2.x() - sz.x()) / 2;
auto min_S = Vector2i(-half_tile.x() + empty_space_NS, 0 );
auto max_S = Vector2i(min_S.x() + sz.x(), offset_N );
return {min_S, max_S};
}
case (uint8_t)rotation::W: {
const auto empty_space_WE = (iTILE_SIZE2.y() - sz.y()) / 2;
auto min_W = Vector2i(-offset_W, -half_tile.y() + empty_space_WE );
auto max_W = Vector2i(0, min_W.y() + sz.y() );
return {min_W, max_W};
}
case (uint8_t)rotation::E: {
const auto empty_space_WE = (iTILE_SIZE2.y() - sz.y()) / 2;
auto min_E = Vector2i(0, -half_tile.y() + empty_space_WE );
auto max_E = Vector2i(offset_W, min_E.y() + sz.y() );
return {min_E, max_E};
}
case (uint8_t)rotation_COUNT: {
auto min_C = Vector2i(-(sz.x() >> 1), - (sz.y() >> 1) );
auto max_C = min_C + sz;
return {min_C, max_C};
}
default:
fm_abort("wrong 4-way rotation enum '%d'", (int)r);
}
};
constexpr auto min_size = iTILE_SIZE2*3/4;
static_assert(min_size.x() % 2 == 0);
#if 0
if constexpr(true)
{
constexpr auto sz_ = min_size;
constexpr Vector2i shift = Vector2i(1, 2) * iTILE_SIZE2;
{
constexpr auto N = get_value(sz_, rotation::N);
constexpr auto min_N = N.first() + shift, max_N = N.second() + shift;
{ [[maybe_unused]] constexpr auto N_x = min_N.x(), N_y = min_N.y(); }
{ [[maybe_unused]] constexpr auto N_x = max_N.x(), N_y = max_N.y(); }
}
{
constexpr auto E = get_value(sz_, rotation::E);
constexpr auto min_E = E.first() + shift, max_E = E.second() + shift;
{ [[maybe_unused]] constexpr auto E_x = min_E.x(), E_y = min_E.y(); }
{ [[maybe_unused]] constexpr auto E_x = max_E.x(), E_y = max_E.y(); }
}
{
constexpr auto S = get_value(sz_, rotation::S);
constexpr auto min_S = S.first() + shift, max_S = S.second() + shift;
{ [[maybe_unused]] constexpr auto S_x = min_S.x(), S_y = min_S.y(); }
{ [[maybe_unused]] constexpr auto S_x = max_S.x(), S_y = max_S.y(); }
}
{
constexpr auto W = get_value(sz_, rotation::W);
constexpr auto min_W = W.first() + shift, max_W = W.second() + shift;
{ [[maybe_unused]] constexpr auto W_x = min_W.x(), W_y = min_W.y(); }
{ [[maybe_unused]] constexpr auto W_x = max_W.x(), W_y = max_W.y(); }
}
}
#endif
const auto shift = coord * iTILE_SIZE2;
auto sz = Math::max(Vector2i(own_size), min_size);
auto [min, max] = get_value(sz, r);
return { Vector2(min + shift), Vector2(max + shift) };
}
Optional<path_search_result>
path_search::operator()(world& w, object_id own_id,
global_coords from, Vector2b from_offset, Vector2ub size,
global_coords to, Vector2b to_offset)
{
if (from.z() != to.z()) [[unlikely]]
return {};
// todo try removing this eventually
if (from.z() != 0) [[unlikely]]
return {};
// check if obj can actually move at all
if (!is_passable(w, from, from_offset, size, own_id))
return {};
ensure_allocated(from.chunk(), to.chunk());
// todo...
return {};
}
Optional<path_search_result> path_search::operator()(world& w, const object& obj, global_coords to, Vector2b to_offset)
{
constexpr auto full_tile = Vector2ub(iTILE_SIZE2*3/4);
auto size = Math::max(obj.bbox_size, full_tile);
// todo fixme
// if bbox_offset is added to obj's offset, then all coordinates in the paths are shifted by bbox_offset.
// maybe add handling to subtract bbox_offset from the returned path.
// for that it needs to be passed into callees separately.
fm_assert(obj.bbox_offset.isZero());
return operator()(w, obj.id, obj.coord, obj.offset, size, to, to_offset);
}
} // namespace floormat
|
