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.
24 #include "noise.h" // for PcgRandom
29 #include "util/container.h"
30 #include "util/numeric.h"
32 #include "cmake_config.h"
35 #include <spatialindex/SpatialIndex.h>
36 #include "util/serialize.h"
42 Area(const v3s16 &mine, const v3s16 &maxe) :
43 minedge(mine), maxedge(maxe)
45 sortBoxVerticies(minedge, maxedge);
49 v3s16 minedge, maxedge;
57 m_cache_enabled(true),
58 m_cacheblock_radius(64),
59 m_res_cache(1000, &cacheMiss, this),
63 virtual ~AreaStore() {}
65 static AreaStore *getOptimalImplementation();
67 virtual void reserve(size_t count) {};
68 size_t size() const { return areas_map.size(); }
70 // Updates the area's ID
71 virtual bool insertArea(Area *a) = 0;
72 virtual bool removeArea(u32 id) = 0;
73 void getAreasForPos(std::vector<Area *> *result, v3s16 pos);
74 virtual void getAreasInArea(std::vector<Area *> *result,
75 v3s16 minedge, v3s16 maxedge, bool accept_overlap) = 0;
76 void setCacheParams(bool enabled, u8 block_radius, size_t limit);
78 const Area *getArea(u32 id) const;
81 typedef bool (*ForEachCallback)(const Area *a, void *arg);
82 // Calls a passed function for every stored area, until the
83 // callback returns true. If that happens, it returns true,
84 // if the search is exhausted, it returns false.
85 virtual bool forEach(ForEachCallback, void *arg=NULL) const = 0;
87 void serialize(std::ostream &is) const;
88 bool deserialize(std::istream &is);
92 void invalidateCache();
93 virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) = 0;
94 u32 getNextId() { return m_next_id++; }
96 // Note: This can't be an unordered_map, since all
97 // references would be invalidated on rehash.
98 typedef std::map<u32, Area> AreaMap;
102 static void cacheMiss(void *data, const v3s16 &mpos, std::vector<Area *> *dest);
104 bool m_cache_enabled;
105 u8 m_cacheblock_radius; // if you modify this, call invalidateCache()
106 LRUCache<v3s16, std::vector<Area *> > m_res_cache;
112 class VectorAreaStore : public AreaStore {
114 virtual void reserve(size_t count) { m_areas.reserve(count); }
115 virtual bool insertArea(Area *a);
116 virtual bool removeArea(u32 id);
117 virtual void getAreasInArea(std::vector<Area *> *result,
118 v3s16 minedge, v3s16 maxedge, bool accept_overlap);
119 //virtual bool forEach(ForEachCallback, void *arg) const;
122 virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos);
125 std::vector<Area *> m_areas;
131 class SpatialAreaStore : public AreaStore {
134 virtual ~SpatialAreaStore();
136 virtual bool insertArea(Area *a);
137 virtual bool removeArea(u32 id);
138 virtual void getAreasInArea(std::vector<Area *> *result,
139 v3s16 minedge, v3s16 maxedge, bool accept_overlap);
140 //virtual bool forEach(ForEachCallback, void *arg) const;
143 virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos);
146 SpatialIndex::ISpatialIndex *m_tree;
147 SpatialIndex::IStorageManager *m_storagemanager;
149 class VectorResultVisitor : public SpatialIndex::IVisitor {
151 VectorResultVisitor(std::vector<Area *> *result, SpatialAreaStore *store) :
155 ~VectorResultVisitor() {}
157 virtual void visitNode(const SpatialIndex::INode &in) {}
159 virtual void visitData(const SpatialIndex::IData &in)
161 u32 id = in.getIdentifier();
163 std::map<u32, Area>::iterator itr = m_store->areas_map.find(id);
164 assert(itr != m_store->areas_map.end());
165 m_result->push_back(&itr->second);
168 virtual void visitData(std::vector<const SpatialIndex::IData *> &v)
170 for (size_t i = 0; i < v.size(); i++)
175 SpatialAreaStore *m_store;
176 std::vector<Area *> *m_result;
180 #endif // USE_SPATIAL
182 #endif // AREA_STORE_H_