3 Copyright (C) 2015 est31 <mtest31@outlook.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 #include "util/areastore.h"
21 #include "util/serialize.h"
22 #include "util/container.h"
25 #include <spatialindex/SpatialIndex.h>
26 #include <spatialindex/RTree.h>
27 #include <spatialindex/Point.h>
30 #define AST_SMALLER_EQ_AS(p, q) (((p).X <= (q).X) && ((p).Y <= (q).Y) && ((p).Z <= (q).Z))
32 #define AST_OVERLAPS_IN_DIMENSION(amine, amaxe, b, d) \
33 (!(((amine).d > (b)->maxedge.d) || ((amaxe).d < (b)->minedge.d)))
35 #define AST_CONTAINS_PT(a, p) (AST_SMALLER_EQ_AS((a)->minedge, (p)) && \
36 AST_SMALLER_EQ_AS((p), (a)->maxedge))
38 #define AST_CONTAINS_AREA(amine, amaxe, b) \
39 (AST_SMALLER_EQ_AS((amine), (b)->minedge) \
40 && AST_SMALLER_EQ_AS((b)->maxedge, (amaxe)))
42 #define AST_AREAS_OVERLAP(amine, amaxe, b) \
43 (AST_OVERLAPS_IN_DIMENSION((amine), (amaxe), (b), X) && \
44 AST_OVERLAPS_IN_DIMENSION((amine), (amaxe), (b), Y) && \
45 AST_OVERLAPS_IN_DIMENSION((amine), (amaxe), (b), Z))
48 AreaStore *AreaStore::getOptimalImplementation()
51 return new SpatialAreaStore();
53 return new VectorAreaStore();
57 const Area *AreaStore::getArea(u32 id) const
59 AreaMap::const_iterator it = areas_map.find(id);
60 if (it == areas_map.end())
65 void AreaStore::serialize(std::ostream &os) const
67 writeU8(os, 0); // Serialisation version
70 writeU16(os, areas_map.size());
71 for (AreaMap::const_iterator it = areas_map.begin();
72 it != areas_map.end(); ++it) {
73 const Area &a = it->second;
74 writeV3S16(os, a.minedge);
75 writeV3S16(os, a.maxedge);
76 writeU16(os, a.data.size());
77 os.write(a.data.data(), a.data.size());
81 void AreaStore::deserialize(std::istream &is)
85 throw SerializationError("Unknown AreaStore "
86 "serialization version!");
88 u16 num_areas = readU16(is);
89 for (u32 i = 0; i < num_areas; ++i) {
91 a.minedge = readV3S16(is);
92 a.maxedge = readV3S16(is);
93 u16 data_len = readU16(is);
94 char *data = new char[data_len];
95 is.read(data, data_len);
96 a.data = std::string(data, data_len);
101 void AreaStore::invalidateCache()
103 if (m_cache_enabled) {
104 m_res_cache.invalidate();
108 void AreaStore::setCacheParams(bool enabled, u8 block_radius, size_t limit)
110 m_cache_enabled = enabled;
111 m_cacheblock_radius = MYMAX(block_radius, 16);
112 m_res_cache.setLimit(MYMAX(limit, 20));
116 void AreaStore::cacheMiss(void *data, const v3s16 &mpos, std::vector<Area *> *dest)
118 AreaStore *as = (AreaStore *)data;
119 u8 r = as->m_cacheblock_radius;
121 // get the points at the edges of the mapblock
122 v3s16 minedge(mpos.X * r, mpos.Y * r, mpos.Z * r);
128 as->getAreasInArea(dest, minedge, maxedge, true);
130 /* infostream << "Cache miss with " << dest->size() << " areas, between ("
131 << minedge.X << ", " << minedge.Y << ", " << minedge.Z
133 << maxedge.X << ", " << maxedge.Y << ", " << maxedge.Z
134 << ")" << std::endl; // */
137 void AreaStore::getAreasForPos(std::vector<Area *> *result, v3s16 pos)
139 if (m_cache_enabled) {
140 v3s16 mblock = getContainerPos(pos, m_cacheblock_radius);
141 const std::vector<Area *> *pre_list = m_res_cache.lookupCache(mblock);
143 size_t s_p_l = pre_list->size();
144 for (size_t i = 0; i < s_p_l; i++) {
145 Area *b = (*pre_list)[i];
146 if (AST_CONTAINS_PT(b, pos)) {
147 result->push_back(b);
151 return getAreasForPosImpl(result, pos);
161 bool VectorAreaStore::insertArea(Area *a)
164 std::pair<AreaMap::iterator, bool> res =
165 areas_map.insert(std::make_pair(a->id, *a));
169 m_areas.push_back(&res.first->second);
174 bool VectorAreaStore::removeArea(u32 id)
176 AreaMap::iterator it = areas_map.find(id);
177 if (it == areas_map.end())
179 Area *a = &it->second;
180 for (std::vector<Area *>::iterator v_it = m_areas.begin();
181 v_it != m_areas.end(); ++v_it) {
192 void VectorAreaStore::getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos)
194 for (size_t i = 0; i < m_areas.size(); ++i) {
195 Area *b = m_areas[i];
196 if (AST_CONTAINS_PT(b, pos)) {
197 result->push_back(b);
202 void VectorAreaStore::getAreasInArea(std::vector<Area *> *result,
203 v3s16 minedge, v3s16 maxedge, bool accept_overlap)
205 for (size_t i = 0; i < m_areas.size(); ++i) {
206 Area *b = m_areas[i];
207 if (accept_overlap ? AST_AREAS_OVERLAP(minedge, maxedge, b) :
208 AST_CONTAINS_AREA(minedge, maxedge, b)) {
209 result->push_back(b);
216 static inline SpatialIndex::Region get_spatial_region(const v3s16 minedge,
219 const double p_low[] = {(double)minedge.X,
220 (double)minedge.Y, (double)minedge.Z};
221 const double p_high[] = {(double)maxedge.X, (double)maxedge.Y,
223 return SpatialIndex::Region(p_low, p_high, 3);
226 static inline SpatialIndex::Point get_spatial_point(const v3s16 pos)
228 const double p[] = {(double)pos.X, (double)pos.Y, (double)pos.Z};
229 return SpatialIndex::Point(p, 3);
233 bool SpatialAreaStore::insertArea(Area *a)
236 if (!areas_map.insert(std::make_pair(a->id, *a)).second)
239 m_tree->insertData(0, NULL, get_spatial_region(a->minedge, a->maxedge), a->id);
244 bool SpatialAreaStore::removeArea(u32 id)
246 std::map<u32, Area>::iterator itr = areas_map.find(id);
247 if (itr != areas_map.end()) {
248 Area *a = &itr->second;
249 bool result = m_tree->deleteData(get_spatial_region(a->minedge,
251 areas_map.erase(itr);
259 void SpatialAreaStore::getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos)
261 VectorResultVisitor visitor(result, this);
262 m_tree->pointLocationQuery(get_spatial_point(pos), visitor);
265 void SpatialAreaStore::getAreasInArea(std::vector<Area *> *result,
266 v3s16 minedge, v3s16 maxedge, bool accept_overlap)
268 VectorResultVisitor visitor(result, this);
269 if (accept_overlap) {
270 m_tree->intersectsWithQuery(get_spatial_region(minedge, maxedge),
273 m_tree->containsWhatQuery(get_spatial_region(minedge, maxedge), visitor);
277 SpatialAreaStore::~SpatialAreaStore()
282 SpatialAreaStore::SpatialAreaStore()
285 SpatialIndex::StorageManager::createNewMemoryStorageManager();
286 SpatialIndex::id_type id;
287 m_tree = SpatialIndex::RTree::createNewRTree(
290 100, // Index capacity
291 100, // Leaf capacity
293 SpatialIndex::RTree::RV_RSTAR,