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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
#include "path-search.hpp"
#include "object.hpp"
#include "compat/math.hpp"
#include <Corrade/Containers/PairStl.h>
#include <Magnum/Math/Vector2.h>
#include <Magnum/Math/Functions.h>
namespace floormat {
template<typename T> using bbox = path_search::bbox<T>;
namespace {
constexpr auto chunk_size = iTILE_SIZE2 * TILE_MAX_DIM;
constexpr auto div_size = path_search::div_size;
constexpr auto min_size = path_search::min_size;
template<typename T>
requires std::is_arithmetic_v<T>
constexpr bbox<T> bbox_union(bbox<T> bb, Vector2i coord, Vector2b offset, Vector2ub size)
{
auto center = coord * iTILE_SIZE2 + Vector2i(offset);
auto min = center - Vector2i(size / 2);
auto max = center + Vector2i(size);
using Vec = VectorTypeFor<2, T>;
return {
.min = Math::min(Vec(bb.min), Vec(min)),
.max = Math::max(Vec(bb.max), Vec(max)),
};
}
template<typename T>
requires std::is_arithmetic_v<T>
constexpr bbox<T> bbox_union(bbox<T> bb1, bbox<T> bb2)
{
return { Math::min(bb1.min, bb2.min), Math::max(bb1.max, bb2.max) };
}
constexpr auto get_bbox(chunk_coords_ ch_1, local_coords pos1, Vector2b off1,
chunk_coords_ ch_2, local_coords pos2, Vector2b off2,
Vector2ub size, uint32_t dist0)
{
auto c = (Vector2i(ch_2.x, ch_2.y) - Vector2i(ch_1.x, ch_1.y)) * chunk_size;
auto t = (Vector2i(pos2) - Vector2i(pos1)) * iTILE_SIZE2;
auto o = Vector2i(off2) - Vector2i(off1);
auto cto = Vector2i(c + t + o);
auto dist = Math::max(1u, (uint32_t)(Vector2(cto).length() + 0.5f));
auto center0 = Vector2i(pos1) * iTILE_SIZE2 + Vector2i(off1);
auto min0 = center0 - Vector2i(size/2u), max0 = min0 + Vector2i(size);
auto min1 = min0 + cto, max1 = max0 + cto;
return Pair<bbox<float>, uint32_t>{
{ .min = Vector2(Math::min(min0, min1)),
.max = Vector2(Math::max(max0, max1)) },
dist0 + dist,
};
}
constexpr auto directions = [] constexpr
{
struct pair { Vector2i dir; uint32_t len; };
constexpr auto len1 = div_size;
constexpr auto len2 = (uint32_t)(math::sqrt((float)len1.dot()) + 0.5f); // NOLINT
std::array<pair, 8> array = {{
{ { -1, -1 }, len2 },
{ { 1, 1 }, len2 },
{ { -1, 1 }, len2 },
{ { 1, -1 }, len2 },
{ { -1, 0 }, len1.x() },
{ { 0, -1 }, len1.y() },
{ { 1, 0 }, len1.x() },
{ { 0, 1 }, len1.y() },
}};
for (auto& [vec, len] : array)
vec *= div_size;
#if 0
for (auto i = 0uz; i < array.size(); i++)
for (auto j = 0uz; j < i; j++)
fm_assert(array[i].dir != array[j].dir);
#endif
return array;
}();
template<typename T>
requires std::is_arithmetic_v<T>
constexpr bbox<T> bbox_from_pos(Math::Vector<2, T> pos, Vector2b offset, Vector2ub size)
{
using Vec = VectorTypeFor<2, T>;
constexpr auto tile_size = Vec(iTILE_SIZE2);
const auto vec = pos * tile_size + Vec(offset);
const auto bb = bbox<float>{vec - Vec(size >> 1), vec + Vec(size)};
return bb;
}
} // namespace
bool astar::edge::operator==(const floormat::astar::edge& other) const = default;
size_t astar::point_hash::operator()(point pt) const
{
static_assert(sizeof(global_coords) == 8);
#ifdef FLOORMAT_64
static_assert(sizeof nullptr > 4);
return fnvhash_64(&pt, sizeof pt);
#else
static_assert(sizeof nullptr == 4);
return fnvhash_32(&pt, sizeof pt);
#endif
}
size_t astar::edge_hash::operator()(const edge& e) const
{
static_assert(sizeof e == 8 + 8 + 2 + 2);
#ifdef FLOORMAT_64
static_assert(sizeof nullptr > 4);
return fnvhash_64(&e, sizeof e);
#else
static_assert(sizeof nullptr == 4);
return fnvhash_32(&e, sizeof e);
#endif
}
path_search_result astar::Dijkstra(world& w, Vector2ub own_size, const object_id own_id,
point from_, point to_, uint32_t max_dist, const pred& p)
{
auto heap_comparator = [this](uint32_t a, uint32_t b) {
fm_debug_assert(std::max(a, b) < nodes.size());
const auto& n1 = nodes[a];
const auto& n2 = nodes[b];
return n2.dist < n1.dist;
};
const auto [from, from_offset] = from_;
const auto [to, to_offset] = to_;
own_size = Math::max(own_size, Vector2ub(min_size));
if (from.z() != to.z()) [[unlikely]]
return {};
// todo try removing this eventually
if (from.z() != 0) [[unlikely]]
return {};
if (!path_search::is_passable(w, from, from_offset, own_size, own_id, p))
return {};
if (!path_search::is_passable(w, to, to_offset, own_size, own_id, p))
return {};
clear();
fm_debug_assert(nodes.empty());
const auto start_bbox = bbox_from_pos(Vector2(from.local()), from_offset, own_size);
const auto from_offset_len = Math::max(1u, (uint32_t)(Vector2(from_offset).length() + 0.5f));
path_search_result result;
fm_debug_assert(result._node); // todo
auto& path = result._node->vec; path.clear();
indexes[from_] = 0;
nodes.push_back({.dist = 0, .coord = from, .offset = from_offset });
Q.push_back(0);
std::push_heap(Q.begin(), Q.end(), heap_comparator);
if (!from_offset.isZero())
{
auto bb = bbox_union(start_bbox, Vector2i(from.local()), {}, own_size);
if (path_search::is_passable(w, chunk_coords_{from}, bb, own_id, p))
{
indexes[{from, {}}] = 1;
nodes.push_back({.dist = from_offset_len, .prev = 0, .coord = from, .offset = {}});
Q.push_back(1);
std::push_heap(Q.begin(), Q.end(), heap_comparator);
}
}
while (!Q.empty())
{
std::pop_heap(Q.begin(), Q.end(), heap_comparator);
const auto id = Q.back();
fm_debug_assert(id < nodes.size());
auto& node = nodes[id];
Q.pop_back();
fm_debug_assert(node.dist != (uint32_t)-1);
const auto bb0 = bbox_from_pos(Vector2(node.coord.local()), node.offset, own_size);
for (auto [vec, len] : directions)
{
auto [new_coord, new_offset] = object::normalize_coords(node.coord, node.offset, vec);
const auto dist = node.dist + len;
if (dist >= max_dist)
continue;
auto [it, found_] = indexes.try_emplace({.coord = new_coord, .offset = new_offset}, (uint32_t)-1);
auto& new_id = it.value();
const auto found = found_ && it->second != (uint32_t)-1;
const auto cur_dist = found ? nodes[new_id].dist : (uint32_t)-1;
fm_debug_assert(!found || nodes[new_id].prev != (uint32_t)-1);
fm_debug_assert(!found || nodes[new_id].dist < max_dist);
if (dist >= cur_dist)
continue;
auto e = make_edge({node.coord, node.offset}, {new_coord, new_offset});
if (auto [it, found] = edges.try_emplace(e, edge_status::unknown); !found)
{
auto& status = it.value();
auto vec_ = Vector2(vec);
auto bb1 = bbox<float>{ bb0.min + vec_, bb0.max + vec_ };
auto bb = bbox_union(bb1, bb0);
if (path_search::is_passable(w, chunk_coords_(node.coord), bb, own_id, p))
status = edge_status::good;
else
{
status = edge_status::bad;
continue;
}
}
new_id = (uint32_t)nodes.size();
auto new_node = astar::visited {
.dist = dist, .prev = id,
.coord = new_coord, .offset = new_offset,
};
nodes.push_back(new_node);
std::push_heap(Q.begin(), Q.end(), heap_comparator);
}
}
// todo...
return result;
}
} // namespace floormat
|
