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
|
/*
Minetest
Copyright (C) 2018 numZero, Lobachevsky Vitaly <numzer0@yandex.com>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "serveractiveobjectmap.h"
#include "constants.h"
#include "log.h"
#include "serverobject.h"
static constexpr float granularity = 16.0 * BS;
static aabb3s16 calcBox(const aabb3f &cb)
{
return aabb3s16(
floor(cb.MinEdge.X / granularity),
floor(cb.MinEdge.Y / granularity),
floor(cb.MinEdge.Z / granularity),
ceil(cb.MaxEdge.X / granularity),
ceil(cb.MaxEdge.Y / granularity),
ceil(cb.MaxEdge.Z / granularity));
}
void ServerActiveObjectMap::addObject(ServerActiveObject *object)
{
aabb3f cb;
Wrapper w;
u16 id = object->getId();
if (!isFreeId(id))
throw std::logic_error("ServerActiveObjectMap::addObject: "
"object ID in use: " + std::to_string(id));
w.object = object;
w.has_box = w.object->getCollisionBox(&cb);
if (w.has_box) {
w.box = calcBox(cb);
addObjectRefs(id, w.box);
}
objects.emplace(id, w);
}
ServerActiveObject *ServerActiveObjectMap::removeObject(u16 id)
{
auto pw = objects.find(id);
if (pw == objects.end())
return nullptr; // silently ignore non-existent object
Wrapper w = pw->second;
if (w.has_box)
removeObjectRefs(id, w.box);
objects.erase(pw);
return w.object;
}
void ServerActiveObjectMap::removeObject(ServerActiveObject *object)
{
removeObject(object->getId());
}
void ServerActiveObjectMap::updateObject(u16 id)
{
auto pw = objects.find(id);
if (pw == objects.end()) {
warningstream << "Trying to update non-existent object: " << id
<< std::endl;
return;
}
Wrapper &w = pw->second;
aabb3f cb;
aabb3s16 box;
bool has_box = w.object->getCollisionBox(&cb);
if (has_box)
box = calcBox(cb);
if (w.has_box && has_box && w.box == box)
return;
if (w.has_box)
removeObjectRefs(id, w.box);
w.box = box;
w.has_box = has_box;
if (w.has_box)
addObjectRefs(id, w.box);
}
void ServerActiveObjectMap::updateObject(ServerActiveObject *object)
{
updateObject(object->getId());
}
ServerActiveObject *ServerActiveObjectMap::getObject(u16 id) const
{
auto pw = objects.find(id);
if (pw == objects.end())
return nullptr;
return pw->second.object;
}
std::vector<u16> ServerActiveObjectMap::getObjectsInsideRadius(v3f pos, float radius)
{
std::vector<u16> result;
auto nearby = getObjectsNearBox(calcBox({pos - radius, pos + radius}));
for (auto &id : nearby) {
ServerActiveObject *obj = getObject(id);
v3f objectpos = obj->getBasePosition();
if (objectpos.getDistanceFrom(pos) > radius)
continue;
result.push_back(id);
}
return result;
}
std::vector<u16> ServerActiveObjectMap::getObjectsTouchingBox(const aabb3f &box)
{
std::vector<u16> result;
auto nearby = getObjectsNearBox(calcBox(box));
for (auto &id : nearby) {
ServerActiveObject *obj = getObject(id);
aabb3f cb;
if (!obj->getCollisionBox(&cb))
continue;
if (!box.intersectsWithBox(cb))
continue;
result.push_back(id);
}
return result;
}
std::unordered_set<u16> ServerActiveObjectMap::getObjectsNearBox(const aabb3s16 &box)
{
std::unordered_set<u16> result;
v3s16 p;
for (p.Z = box.MinEdge.Z; p.Z <= box.MaxEdge.Z; p.Z++)
for (p.Y = box.MinEdge.Y; p.Y <= box.MaxEdge.Y; p.Y++)
for (p.X = box.MinEdge.X; p.X <= box.MaxEdge.X; p.X++) {
auto bounds = refmap.equal_range(p);
for (auto iter = bounds.first; iter != bounds.second; ++iter)
result.insert(iter->second);
}
return result;
}
void ServerActiveObjectMap::addObjectRefs(u16 id, const aabb3s16 &box)
{
v3s16 p;
for (p.Z = box.MinEdge.Z; p.Z <= box.MaxEdge.Z; p.Z++)
for (p.Y = box.MinEdge.Y; p.Y <= box.MaxEdge.Y; p.Y++)
for (p.X = box.MinEdge.X; p.X <= box.MaxEdge.X; p.X++)
refmap.emplace(p, id);
}
void ServerActiveObjectMap::removeObjectRefs(u16 id, const aabb3s16 &box)
{
v3s16 p;
for (p.Z = box.MinEdge.Z; p.Z <= box.MaxEdge.Z; p.Z++)
for (p.Y = box.MinEdge.Y; p.Y <= box.MaxEdge.Y; p.Y++)
for (p.X = box.MinEdge.X; p.X <= box.MaxEdge.X; p.X++) {
auto bounds = refmap.equal_range(p);
for (auto iter = bounds.first; iter != bounds.second;)
if (iter->second == id)
refmap.erase(iter++);
else
++iter;
}
}
bool ServerActiveObjectMap::isFreeId(u16 id)
{
if (id == 0)
return false;
return objects.find(id) == objects.end();
}
u16 ServerActiveObjectMap::getFreeId()
{
// try to reuse id's as late as possible
static u16 last_used_id = 0;
u16 startid = last_used_id;
for (;;) {
last_used_id++;
if (isFreeId(last_used_id))
return last_used_id;
if (last_used_id == startid) // wrapped around
return 0;
}
}
|
