aboutsummaryrefslogtreecommitdiff
path: root/builtin/common
Commit message (Expand)AuthorAge
...
* [CSM] Add client-sided chat commands (#5092)red-0012017-03-13
* Vector: Add vector.sort(a, b): return box edgesAuke Kok2017-01-23
* Revert "Adding particle blend, glow and animation (#4705)"sfan52016-11-14
* Adding particle blend, glow and animation (#4705)Foghrye42016-11-15
* Core.rotate_and_place: Remove unused call to get_look_pitch()Auke Kok2016-10-31
* Builtin: Add vector.floor helper functionrubenwardy2016-10-17
* Only allow strings to be passed to minetest.global_exists (#4253)HybridDog2016-06-28
* Faster insertion into tableRui9142016-03-06
* Refactor loggingShadowNinja2015-10-14
* Add /emergeblocks command and core.emerge_area() Lua APIkwolekr2015-09-23
* Allow random menu images for subgamessfan52015-07-21
* Fix wrong replace from previous commitest312015-06-02
* Localize inside whole misc_helpers.luaest312015-06-01
* Add minetest.global_exists()ShadowNinja2015-04-21
* Fix serialization of floating point numbersShadowNinja2015-02-21
* Server: announce MIN/MAX protocol version supported to serverlist. Client: ch...est312015-02-18
* Fix crash on passing false as value in table to table.copy(t)est312015-02-14
* Change assignment to global in a function to warningrubenwardy2015-02-04
* Fix imprecise serialization of large numbersShadowNinja2015-01-25
* Simplify deleteblocks chat command argument parsingkwolekr2015-01-15
* Fix typo in `serialize.lua`.Diego Martínez2015-01-15
* Fix off-by-one error in `string:split` implementation.Diego Martínez2015-01-04
* Faster string.split implementation.Diego Martinez2014-12-28
* Revert "Adjust the values of dirs1 and dirs2 so that rotate_and_place orients...Craig Robbins2014-12-12
* Fix undeclared globals in functions and shorten lines in misc_helpers.lua.paramat2014-12-11
* Add Lua helper functions vector.apply(v) math.sign(x, tolerance)SmallJoker2014-12-06
* Add minetest.copy_table(table) To get rid off the "table references"SmallJoker2014-11-27
* Adjust the values of dirs1 and dirs2 so that rotate_and_place orients texture...dvere2014-11-25
* Make duplicate warning checks file and line specificShadowNinja2014-11-23
* Fix console spaming by debug function on mod checking for global variable to ...sapier2014-11-23
* Add strict moduleShadowNinja2014-11-19
* Tweak core.serializeShadowNinja2014-11-19
* Fix dump() indentation with non-tab indentsShadowNinja2014-11-08
* Add last_login field to auth.txtRyan Newell2014-11-08
* Make dump's output prettierShadowNinja2014-09-21
* Remove vector assertionsShadowNinja2014-07-19
* Add srollbar formspec elementsapier2014-07-16
* Rework dumping functionsShadowNinja2014-05-24
* Fix a bunch of small bugs due to mainmenu cleanupsapier2014-05-24
* Add formspec toolkit and refactor mainmenu to use itsapier2014-05-16
* Use "core" namespace internallyShadowNinja2014-05-08
* Organize builtin into subdirectoriesShadowNinja2014-05-07
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-27 18:07:49 +0000
a, p) (AST_SMALLER_EQ_AS((a)->minedge, (p)) && \ AST_SMALLER_EQ_AS((p), (a)->maxedge)) #define AST_CONTAINS_AREA(amine, amaxe, b) \ (AST_SMALLER_EQ_AS((amine), (b)->minedge) \ && AST_SMALLER_EQ_AS((b)->maxedge, (amaxe))) #define AST_AREAS_OVERLAP(amine, amaxe, b) \ (AST_OVERLAPS_IN_DIMENSION((amine), (amaxe), (b), X) && \ AST_OVERLAPS_IN_DIMENSION((amine), (amaxe), (b), Y) && \ AST_OVERLAPS_IN_DIMENSION((amine), (amaxe), (b), Z)) AreaStore *AreaStore::getOptimalImplementation() { #if USE_SPATIAL return new SpatialAreaStore(); #else return new VectorAreaStore(); #endif } const Area *AreaStore::getArea(u32 id) const { AreaMap::const_iterator it = areas_map.find(id); if (it == areas_map.end()) return NULL; return &it->second; } void AreaStore::serialize(std::ostream &os) const { writeU8(os, 0); // Serialisation version // TODO: Compression? writeU16(os, areas_map.size()); for (AreaMap::const_iterator it = areas_map.begin(); it != areas_map.end(); ++it) { const Area &a = it->second; writeV3S16(os, a.minedge); writeV3S16(os, a.maxedge); writeU16(os, a.data.size()); os.write(a.data.data(), a.data.size()); } } void AreaStore::deserialize(std::istream &is) { u8 ver = readU8(is); if (ver != 0) throw SerializationError("Unknown AreaStore " "serialization version!"); u16 num_areas = readU16(is); for (u32 i = 0; i < num_areas; ++i) { Area a; a.minedge = readV3S16(is); a.maxedge = readV3S16(is); u16 data_len = readU16(is); char *data = new char[data_len]; is.read(data, data_len); a.data = std::string(data, data_len); insertArea(&a); delete [] data; } } void AreaStore::invalidateCache() { if (m_cache_enabled) { m_res_cache.invalidate(); } } void AreaStore::setCacheParams(bool enabled, u8 block_radius, size_t limit) { m_cache_enabled = enabled; m_cacheblock_radius = MYMAX(block_radius, 16); m_res_cache.setLimit(MYMAX(limit, 20)); invalidateCache(); } void AreaStore::cacheMiss(void *data, const v3s16 &mpos, std::vector<Area *> *dest) { AreaStore *as = (AreaStore *)data; u8 r = as->m_cacheblock_radius; // get the points at the edges of the mapblock v3s16 minedge(mpos.X * r, mpos.Y * r, mpos.Z * r); v3s16 maxedge( minedge.X + r - 1, minedge.Y + r - 1, minedge.Z + r - 1); as->getAreasInArea(dest, minedge, maxedge, true); /* infostream << "Cache miss with " << dest->size() << " areas, between (" << minedge.X << ", " << minedge.Y << ", " << minedge.Z << ") and (" << maxedge.X << ", " << maxedge.Y << ", " << maxedge.Z << ")" << std::endl; // */ } void AreaStore::getAreasForPos(std::vector<Area *> *result, v3s16 pos) { if (m_cache_enabled) { v3s16 mblock = getContainerPos(pos, m_cacheblock_radius); const std::vector<Area *> *pre_list = m_res_cache.lookupCache(mblock); size_t s_p_l = pre_list->size(); for (size_t i = 0; i < s_p_l; i++) { Area *b = (*pre_list)[i]; if (AST_CONTAINS_PT(b, pos)) { result->push_back(b); } } } else { return getAreasForPosImpl(result, pos); } } //// // VectorAreaStore //// bool VectorAreaStore::insertArea(Area *a) { if (a->id == U32_MAX) a->id = getNextId(); std::pair<AreaMap::iterator, bool> res = areas_map.insert(std::make_pair(a->id, *a)); if (!res.second) // ID is not unique return false; m_areas.push_back(&res.first->second); invalidateCache(); return true; } bool VectorAreaStore::removeArea(u32 id) { AreaMap::iterator it = areas_map.find(id); if (it == areas_map.end()) return false; Area *a = &it->second; for (std::vector<Area *>::iterator v_it = m_areas.begin(); v_it != m_areas.end(); ++v_it) { if (*v_it == a) { m_areas.erase(v_it); break; } } areas_map.erase(it); invalidateCache(); return true; } void VectorAreaStore::getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) { for (size_t i = 0; i < m_areas.size(); ++i) { Area *b = m_areas[i]; if (AST_CONTAINS_PT(b, pos)) { result->push_back(b); } } } void VectorAreaStore::getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap) { for (size_t i = 0; i < m_areas.size(); ++i) { Area *b = m_areas[i]; if (accept_overlap ? AST_AREAS_OVERLAP(minedge, maxedge, b) : AST_CONTAINS_AREA(minedge, maxedge, b)) { result->push_back(b); } } } #if USE_SPATIAL static inline SpatialIndex::Region get_spatial_region(const v3s16 minedge, const v3s16 maxedge) { const double p_low[] = {(double)minedge.X, (double)minedge.Y, (double)minedge.Z}; const double p_high[] = {(double)maxedge.X, (double)maxedge.Y, (double)maxedge.Z}; return SpatialIndex::Region(p_low, p_high, 3); } static inline SpatialIndex::Point get_spatial_point(const v3s16 pos) { const double p[] = {(double)pos.X, (double)pos.Y, (double)pos.Z}; return SpatialIndex::Point(p, 3); } bool SpatialAreaStore::insertArea(Area *a) { if (a->id == U32_MAX) a->id = getNextId(); if (!areas_map.insert(std::make_pair(a->id, *a)).second) // ID is not unique return false; m_tree->insertData(0, NULL, get_spatial_region(a->minedge, a->maxedge), a->id); invalidateCache(); return true; } bool SpatialAreaStore::removeArea(u32 id) { std::map<u32, Area>::iterator itr = areas_map.find(id); if (itr != areas_map.end()) { Area *a = &itr->second; bool result = m_tree->deleteData(get_spatial_region(a->minedge, a->maxedge), id); areas_map.erase(itr); invalidateCache(); return result; } else { return false; } } void SpatialAreaStore::getAreasForPosImpl(std::vector<Area *> *result, v3s16 pos) { VectorResultVisitor visitor(result, this); m_tree->pointLocationQuery(get_spatial_point(pos), visitor); } void SpatialAreaStore::getAreasInArea(std::vector<Area *> *result, v3s16 minedge, v3s16 maxedge, bool accept_overlap) { VectorResultVisitor visitor(result, this); if (accept_overlap) { m_tree->intersectsWithQuery(get_spatial_region(minedge, maxedge), visitor); } else { m_tree->containsWhatQuery(get_spatial_region(minedge, maxedge), visitor); } } SpatialAreaStore::~SpatialAreaStore() { delete m_tree; } SpatialAreaStore::SpatialAreaStore() { m_storagemanager = SpatialIndex::StorageManager::createNewMemoryStorageManager(); SpatialIndex::id_type id; m_tree = SpatialIndex::RTree::createNewRTree( *m_storagemanager, .7, // Fill factor 100, // Index capacity 100, // Leaf capacity 3, // dimension :) SpatialIndex::RTree::RV_RSTAR, id); } #endif
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-27 18:07:47 +0000