minetest.git - modified minetest for gpcfs purposes

about summary refs log tree commit diff

Mode	Name	Size
-rw-r--r--	.clang-format	761	log plain
-rw-r--r--	.clang-tidy	400	log plain
-rw-r--r--	.gitattributes	28	log plain
d---------	.github	211	log plain
-rw-r--r--	.gitignore	1419	log plain
-rw-r--r--	.gitlab-ci.yml	8698	log plain
-rw-r--r--	.luacheckrc	1403	log plain
-rw-r--r--	.mailmap	2087	log plain
-rw-r--r--	CMakeLists.txt	11545	log plain
-rw-r--r--	Dockerfile	2183	log plain
-rw-r--r--	LICENSE.txt	6568	log plain
-rw-r--r--	README.md	22667	log plain
d---------	build / android	34	log plain
d---------	builtin	310	log plain
d---------	client	71	log plain
d---------	clientmods / preview	34	log plain
d---------	cmake / Modules	34	log plain
d---------	doc	618	log plain
d---------	fonts	2109	log plain
d---------	games / devtest	34	log plain
d---------	lib	94	log plain
-rw-r--r--	minetest.conf.example	100752	log plain
d---------	misc	669	log plain
d---------	mods	41	log plain
d---------	po	1601	log plain
d---------	src	6706	log plain
d---------	textures	81	log plain
d---------	util	342	log plain

rn Whether the area was in the store and removed. virtual bool removeArea(u32 id) = 0; /// Finds areas that the passed position is contained in. /// Stores output in passed vector. void getAreasForPos(std::vector<Area *> *result, v3s16 pos); /// Finds areas that are completely contained inside the area defined /// by the passed edges. If @p accept_overlap is true this finds any /// areas that intersect with the passed area at any point. virtual void getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap) = 0; /// Sets cache parameters. void setCacheParams(bool enabled, u8 block_radius, size_t limit); /// Returns a pointer to the area coresponding to the passed ID, /// or NULL if it doesn't exist. const Area *getArea(u32 id) const; /// Serializes the store's areas to a binary ostream. void serialize(std::ostream &is) const; /// Deserializes the Areas from a binary istream. /// This does not currently clear the AreaStore before adding the /// areas, making it possible to deserialize multiple serialized /// AreaStores. void deserialize(std::istream &is); protected: /// Invalidates the getAreasForPos cache. /// Call after adding or removing an area. void invalidateCache(); /// Implementation of getAreasForPos. /// getAreasForPos calls this if the cache is disabled. virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) = 0; /// Returns the next area ID and increments it. u32 getNextId() { return m_next_id++; } // Note: This can't be an unordered_map, since all // references would be invalidated on rehash. typedef std::map<u32, Area> AreaMap; AreaMap areas_map; private: /// Called by the cache when a value isn't found in the cache. static void cacheMiss(void *data, const v3s16 &mpos, std::vector<Area *> *dest); bool m_cache_enabled; /// Range, in nodes, of the getAreasForPos cache. /// If you modify this, call invalidateCache() u8 m_cacheblock_radius; LRUCache<v3s16, std::vector<Area *> > m_res_cache; u32 m_next_id; }; class VectorAreaStore : public AreaStore { public: virtual void reserve(size_t count) { m_areas.reserve(count); } virtual bool insertArea(Area *a); virtual bool removeArea(u32 id); virtual void getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap); protected: virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos); private: std::vector<Area *> m_areas; }; #if USE_SPATIAL class SpatialAreaStore : public AreaStore { public: SpatialAreaStore(); virtual ~SpatialAreaStore(); virtual bool insertArea(Area *a); virtual bool removeArea(u32 id); virtual void getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap); protected: virtual void getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos); private: SpatialIndex::ISpatialIndex *m_tree;