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
|
#include "chunk.hpp"
#include "tile-atlas.hpp"
#include "entity.hpp"
#include "src/RTree-search.hpp"
#include "src/chunk-scenery.hpp"
#include "src/tile-bbox.hpp"
#include <bit>
#include <Corrade/Containers/PairStl.h>
namespace floormat {
chunk::RTree* chunk::rtree() noexcept { ensure_passability(); return &_rtree; }
namespace {
constexpr object_id make_id(collision_type type, pass_mode p, object_id id)
{
return std::bit_cast<object_id>(collision_data { (object_id)type, (object_id)p, id });
}
} // namespace
void chunk::ensure_passability() noexcept
{
fm_assert(_entities_sorted); // not strictly necessary
if (!_pass_modified)
return;
_pass_modified = false;
_rtree.RemoveAll();
for (const std::shared_ptr<entity>& s : entities())
{
bbox box;
if (_bbox_for_scenery(*s, box))
_add_bbox(box);
}
for (auto i = 0uz; i < TILE_COUNT; i++)
{
if (const auto* atlas = ground_atlas_at(i))
{
auto [min, max] = whole_tile(i);
auto id = make_id(collision_type::geometry, atlas->pass_mode(pass_mode::pass), i);
_rtree.Insert(min.data(), max.data(), id);
}
}
for (auto i = 0uz; i < TILE_COUNT; i++)
{
auto tile = operator[](i);
if (const auto* atlas = tile.wall_north_atlas().get())
{
auto [min, max] = wall_north(i);
auto id = make_id(collision_type::geometry, atlas->pass_mode(pass_mode::blocked), i);
_rtree.Insert(min.data(), max.data(), id);
}
if (const auto* atlas = tile.wall_west_atlas().get())
{
auto [min, max] = wall_west(i);
auto id = make_id(collision_type::geometry, atlas->pass_mode(pass_mode::blocked), i);
_rtree.Insert(min.data(), max.data(), id);
}
}
}
bool chunk::_bbox_for_scenery(const entity& s, local_coords local, Vector2b offset, Vector2b bbox_offset, Vector2ub bbox_size, bbox& value) noexcept
{
auto [start, end] = scenery_tile(local, offset, bbox_offset, bbox_size);
auto id = make_id(collision_type::scenery, s.pass, s.id);
value = { .id = id, .start = start, .end = end };
return s.atlas && !Vector2ui(s.bbox_size).isZero();
}
bool chunk::_bbox_for_scenery(const entity& s, bbox& value) noexcept
{
return _bbox_for_scenery(s, s.coord.local(), s.offset, s.bbox_offset, s.bbox_size, value);
}
void chunk::_remove_bbox(const bbox& x)
{
auto start = Vector2(x.start), end = Vector2(x.end);
_rtree.Remove(start.data(), end.data(), x.id);
}
void chunk::_add_bbox(const bbox& x)
{
auto start = Vector2(x.start), end = Vector2(x.end);
_rtree.Insert(start.data(), end.data(), x.id);
}
void chunk::_replace_bbox(const bbox& x0, const bbox& x1, bool b0, bool b1)
{
if (_pass_modified)
return;
unsigned i = (unsigned)b1 << 1 | (unsigned)(b0 ? 1 : 0) << 0;
CORRADE_ASSUME(i < 4u); (void)0;
switch (i) // NOLINT(hicpp-multiway-paths-covered)
{
case 1 << 1 | 1 << 0:
if (x1 == x0)
return;
_remove_bbox(x0);
[[fallthrough]];
case 1 << 1 | 0 << 0:
_add_bbox(x1);
return;
case 0 << 1 | 1 << 0:
_remove_bbox(x0);
return;
case 0 << 1 | 0 << 0:
return;
}
CORRADE_ASSUME(false);
}
bool chunk::can_place_entity(const entity_proto& proto, local_coords pos)
{
(void)ensure_scenery_mesh();
const auto center = Vector2(pos)*TILE_SIZE2 + Vector2(proto.offset) + Vector2(proto.bbox_offset),
min = center - Vector2(proto.bbox_size/2), max = min + Vector2(proto.bbox_size);
bool ret = true;
_rtree.Search(min.data(), max.data(), [&](uint64_t data, const auto&) {
[[maybe_unused]] auto x = std::bit_cast<collision_data>(data);
if (x.pass == (uint64_t)pass_mode::pass)
return true;
return ret = false;
});
return ret;
}
} // namespace floormat
|
