2010-11-27 00:02:21 +01:00
|
|
|
/*
|
2013-02-24 18:40:43 +01:00
|
|
|
Minetest
|
2013-02-24 19:38:45 +01:00
|
|
|
Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
|
2010-11-29 19:13:04 +01:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
2012-06-05 16:56:56 +02:00
|
|
|
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
|
2010-11-29 19:13:04 +01:00
|
|
|
(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
|
2012-06-05 16:56:56 +02:00
|
|
|
GNU Lesser General Public License for more details.
|
2010-11-29 19:13:04 +01:00
|
|
|
|
2012-06-05 16:56:56 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
2010-11-29 19:13:04 +01:00
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
2010-11-27 00:02:21 +01:00
|
|
|
*/
|
|
|
|
|
2017-08-17 22:19:39 +02:00
|
|
|
#pragma once
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
#include <iostream>
|
2012-12-20 18:19:49 +01:00
|
|
|
#include <set>
|
|
|
|
#include <map>
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2012-06-17 03:00:31 +02:00
|
|
|
#include "irrlichttypes_bloated.h"
|
2022-10-13 15:35:19 +02:00
|
|
|
#include "mapblock.h"
|
2010-11-27 00:02:21 +01:00
|
|
|
#include "mapnode.h"
|
|
|
|
#include "constants.h"
|
2010-12-11 17:11:03 +01:00
|
|
|
#include "voxel.h"
|
2011-11-27 23:45:34 +01:00
|
|
|
#include "modifiedstate.h"
|
2022-10-13 15:35:19 +02:00
|
|
|
#include "util/numeric.h"
|
2012-07-17 15:00:04 +02:00
|
|
|
#include "nodetimer.h"
|
2017-08-18 19:25:07 +02:00
|
|
|
#include "debug.h"
|
2011-09-03 01:07:14 +02:00
|
|
|
|
2011-06-25 23:03:58 +02:00
|
|
|
class MapSector;
|
2011-06-26 01:34:36 +02:00
|
|
|
class NodeMetadata;
|
2011-11-13 23:19:48 +01:00
|
|
|
class IGameDef;
|
2014-06-26 02:28:41 +02:00
|
|
|
class IRollbackManager;
|
2011-06-25 17:35:32 +02:00
|
|
|
|
2011-06-05 20:07:54 +02:00
|
|
|
/*
|
|
|
|
MapEditEvent
|
|
|
|
*/
|
|
|
|
|
2024-03-06 21:04:57 +01:00
|
|
|
enum MapEditEventType {
|
2011-05-31 19:02:55 +02:00
|
|
|
// Node added (changed from air or something else to something)
|
2011-02-23 01:49:57 +01:00
|
|
|
MEET_ADDNODE,
|
2011-05-31 19:02:55 +02:00
|
|
|
// Node removed (changed to air)
|
2011-02-23 01:49:57 +01:00
|
|
|
MEET_REMOVENODE,
|
2013-11-23 15:35:49 +01:00
|
|
|
// Node swapped (changed without metadata change)
|
|
|
|
MEET_SWAPNODE,
|
2018-12-04 20:37:48 +01:00
|
|
|
// Node metadata changed
|
2011-05-31 19:02:55 +02:00
|
|
|
MEET_BLOCK_NODE_METADATA_CHANGED,
|
2011-07-01 20:04:40 +02:00
|
|
|
// Anything else (modified_blocks are set unsent)
|
2011-02-23 01:49:57 +01:00
|
|
|
MEET_OTHER
|
|
|
|
};
|
|
|
|
|
|
|
|
struct MapEditEvent
|
|
|
|
{
|
2017-06-17 19:11:28 +02:00
|
|
|
MapEditEventType type = MEET_OTHER;
|
2011-02-23 01:49:57 +01:00
|
|
|
v3s16 p;
|
2017-06-17 19:11:28 +02:00
|
|
|
MapNode n = CONTENT_AIR;
|
2022-12-24 18:21:59 +01:00
|
|
|
std::vector<v3s16> modified_blocks; // Represents a set
|
2018-12-04 20:37:48 +01:00
|
|
|
bool is_private_change = false;
|
2011-02-23 01:49:57 +01:00
|
|
|
|
2017-08-18 18:18:25 +02:00
|
|
|
MapEditEvent() = default;
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2022-10-08 16:25:22 +02:00
|
|
|
// Sets the event's position and marks the block as modified.
|
|
|
|
void setPositionModified(v3s16 pos)
|
|
|
|
{
|
2022-12-24 18:21:59 +01:00
|
|
|
assert(modified_blocks.empty()); // only meant for initialization (once)
|
2022-10-08 16:25:22 +02:00
|
|
|
p = pos;
|
2022-12-24 18:21:59 +01:00
|
|
|
modified_blocks.push_back(getNodeBlockPos(pos));
|
|
|
|
}
|
|
|
|
|
2024-04-23 19:03:50 +02:00
|
|
|
void setModifiedBlocks(const std::map<v3s16, MapBlock *>& blocks)
|
2022-12-24 18:21:59 +01:00
|
|
|
{
|
|
|
|
assert(modified_blocks.empty()); // only meant for initialization (once)
|
|
|
|
modified_blocks.reserve(blocks.size());
|
|
|
|
for (const auto &block : blocks)
|
|
|
|
modified_blocks.push_back(block.first);
|
2022-10-08 16:25:22 +02:00
|
|
|
}
|
|
|
|
|
2019-09-24 19:05:28 +02:00
|
|
|
VoxelArea getArea() const
|
2012-03-29 00:22:08 +02:00
|
|
|
{
|
|
|
|
switch(type){
|
|
|
|
case MEET_ADDNODE:
|
|
|
|
case MEET_REMOVENODE:
|
2013-11-23 15:35:49 +01:00
|
|
|
case MEET_SWAPNODE:
|
2012-03-29 00:22:08 +02:00
|
|
|
case MEET_BLOCK_NODE_METADATA_CHANGED:
|
2022-10-08 16:25:22 +02:00
|
|
|
return VoxelArea(p);
|
2012-03-29 00:22:08 +02:00
|
|
|
case MEET_OTHER:
|
|
|
|
{
|
|
|
|
VoxelArea a;
|
2017-08-18 18:18:25 +02:00
|
|
|
for (v3s16 p : modified_blocks) {
|
2012-03-29 00:22:08 +02:00
|
|
|
v3s16 np1 = p*MAP_BLOCKSIZE;
|
|
|
|
v3s16 np2 = np1 + v3s16(1,1,1)*MAP_BLOCKSIZE - v3s16(1,1,1);
|
|
|
|
a.addPoint(np1);
|
|
|
|
a.addPoint(np2);
|
|
|
|
}
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return VoxelArea();
|
|
|
|
}
|
2011-02-23 01:49:57 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
class MapEventReceiver
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
// event shall be deleted by caller after the call.
|
2019-09-24 19:05:28 +02:00
|
|
|
virtual void onMapEditEvent(const MapEditEvent &event) = 0;
|
2011-02-23 01:49:57 +01:00
|
|
|
};
|
|
|
|
|
2011-06-26 00:31:43 +02:00
|
|
|
class Map /*: public NodeContainer*/
|
2010-11-27 00:02:21 +01:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2020-10-05 09:07:33 +02:00
|
|
|
Map(IGameDef *gamedef);
|
2010-11-27 00:02:21 +01:00
|
|
|
virtual ~Map();
|
2017-06-10 13:49:15 +02:00
|
|
|
DISABLE_CLASS_COPY(Map);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-02-23 01:49:57 +01:00
|
|
|
void addEventReceiver(MapEventReceiver *event_receiver);
|
|
|
|
void removeEventReceiver(MapEventReceiver *event_receiver);
|
|
|
|
// event shall be deleted by caller after the call.
|
2019-09-24 19:05:28 +02:00
|
|
|
void dispatchEvent(const MapEditEvent &event);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2011-01-30 00:44:54 +01:00
|
|
|
// On failure returns NULL
|
2019-08-13 19:58:27 +02:00
|
|
|
MapSector * getSectorNoGenerateNoLock(v2s16 p2d);
|
2011-06-25 03:25:14 +02:00
|
|
|
// Same as the above (there exists no lock anymore)
|
2010-11-27 00:02:21 +01:00
|
|
|
MapSector * getSectorNoGenerate(v2s16 p2d);
|
2011-01-30 00:44:54 +01:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
/*
|
|
|
|
This is overloaded by ClientMap and ServerMap to allow
|
|
|
|
their differing fetch methods.
|
|
|
|
*/
|
2011-02-01 15:17:55 +01:00
|
|
|
virtual MapSector * emergeSector(v2s16 p){ return NULL; }
|
2011-01-17 01:40:53 +01:00
|
|
|
|
2010-11-27 00:02:21 +01:00
|
|
|
// Returns InvalidPositionException if not found
|
|
|
|
MapBlock * getBlockNoCreate(v3s16 p);
|
2010-12-21 17:08:24 +01:00
|
|
|
// Returns NULL if not found
|
|
|
|
MapBlock * getBlockNoCreateNoEx(v3s16 p);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2011-10-17 00:04:22 +02:00
|
|
|
/* Server overrides */
|
2014-12-29 07:31:37 +01:00
|
|
|
virtual MapBlock * emergeBlock(v3s16 p, bool create_blank=true)
|
2011-10-17 00:04:22 +02:00
|
|
|
{ return getBlockNoCreateNoEx(p); }
|
|
|
|
|
2018-02-10 21:04:16 +01:00
|
|
|
inline const NodeDefManager * getNodeDefManager() { return m_nodedef; }
|
2017-01-04 19:18:40 +01:00
|
|
|
|
2011-06-26 01:34:36 +02:00
|
|
|
bool isValidPosition(v3s16 p);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2010-12-25 15:04:51 +01:00
|
|
|
// throws InvalidPositionException if not found
|
2022-09-26 12:49:08 +02:00
|
|
|
void setNode(v3s16 p, MapNode n);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2011-02-21 15:10:36 +01:00
|
|
|
// Returns a CONTENT_IGNORE node if not found
|
2014-11-14 09:05:34 +01:00
|
|
|
// If is_valid_position is not NULL then this will be set to true if the
|
|
|
|
// position is valid, otherwise false
|
2019-08-10 19:45:44 +02:00
|
|
|
MapNode getNode(v3s16 p, bool *is_valid_position = NULL);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
These handle lighting but not faces.
|
|
|
|
*/
|
2022-04-07 21:58:04 +02:00
|
|
|
virtual void addNodeAndUpdate(v3s16 p, MapNode n,
|
2013-11-23 15:35:49 +01:00
|
|
|
std::map<v3s16, MapBlock*> &modified_blocks,
|
|
|
|
bool remove_metadata = true);
|
2010-11-27 00:02:21 +01:00
|
|
|
void removeNodeAndUpdate(v3s16 p,
|
2012-12-20 18:19:49 +01:00
|
|
|
std::map<v3s16, MapBlock*> &modified_blocks);
|
2011-02-23 01:49:57 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
Wrappers for the latter ones.
|
|
|
|
These emit events.
|
|
|
|
Return true if succeeded, false if not.
|
|
|
|
*/
|
2013-11-23 15:35:49 +01:00
|
|
|
bool addNodeWithEvent(v3s16 p, MapNode n, bool remove_metadata = true);
|
2011-02-23 01:49:57 +01:00
|
|
|
bool removeNodeWithEvent(v3s16 p);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2011-09-03 01:07:14 +02:00
|
|
|
// Call these before and after saving of many blocks
|
2017-08-18 18:18:25 +02:00
|
|
|
virtual void beginSave() {}
|
|
|
|
virtual void endSave() {}
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2015-03-06 11:21:51 +01:00
|
|
|
virtual void save(ModifiedState save_level) { FATAL_ERROR("FIXME"); }
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2022-04-07 21:58:04 +02:00
|
|
|
/*
|
|
|
|
Return true unless the map definitely cannot save blocks.
|
|
|
|
*/
|
|
|
|
virtual bool maySaveBlocks() { return true; }
|
|
|
|
|
2015-01-15 22:20:05 +01:00
|
|
|
// Server implements these.
|
|
|
|
// Client leaves them as no-op.
|
2015-03-06 11:21:51 +01:00
|
|
|
virtual bool saveBlock(MapBlock *block) { return false; }
|
|
|
|
virtual bool deleteBlock(v3s16 blockpos) { return false; }
|
2010-11-27 00:02:21 +01:00
|
|
|
|
|
|
|
/*
|
2011-06-26 23:27:17 +02:00
|
|
|
Updates usage timers and unloads unused blocks and sectors.
|
2022-04-07 21:58:04 +02:00
|
|
|
Saves modified blocks before unloading if possible.
|
2010-11-27 00:02:21 +01:00
|
|
|
*/
|
2022-07-09 22:32:08 +02:00
|
|
|
void timerUpdate(float dtime, float unload_timeout, s32 max_loaded_blocks,
|
2015-02-17 15:04:08 +01:00
|
|
|
std::vector<v3s16> *unloaded_blocks=NULL);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2013-06-02 15:35:29 +02:00
|
|
|
/*
|
|
|
|
Unloads all blocks with a zero refCount().
|
2022-04-07 21:58:04 +02:00
|
|
|
Saves modified blocks before unloading if possible.
|
2013-06-02 15:35:29 +02:00
|
|
|
*/
|
2015-02-17 15:04:08 +01:00
|
|
|
void unloadUnreferencedBlocks(std::vector<v3s16> *unloaded_blocks=NULL);
|
2013-06-02 15:35:29 +02:00
|
|
|
|
2011-06-26 20:53:11 +02:00
|
|
|
// Deletes sectors and their blocks from memory
|
2010-11-27 00:02:21 +01:00
|
|
|
// Takes cache into account
|
2011-06-26 20:53:11 +02:00
|
|
|
// If deleted sector is in sector cache, clears cache
|
2015-03-04 16:58:04 +01:00
|
|
|
void deleteSectors(std::vector<v2s16> &list);
|
2010-11-27 00:02:21 +01:00
|
|
|
|
2011-06-26 23:27:17 +02:00
|
|
|
// For debug printing. Prints "Map: ", "ServerMap: " or "ClientMap: "
|
2010-11-27 00:02:21 +01:00
|
|
|
virtual void PrintInfo(std::ostream &out);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2011-04-03 15:21:06 +02:00
|
|
|
/*
|
|
|
|
Node metadata
|
|
|
|
These are basically coordinate wrappers to MapBlock
|
|
|
|
*/
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2015-05-05 20:30:46 +02:00
|
|
|
std::vector<v3s16> findNodesWithMetadata(v3s16 p1, v3s16 p2);
|
|
|
|
NodeMetadata *getNodeMetadata(v3s16 p);
|
2013-11-20 22:11:57 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets metadata for a node.
|
|
|
|
* This method sets the metadata for a given node.
|
|
|
|
* On success, it returns @c true and the object pointed to
|
|
|
|
* by @p meta is then managed by the system and should
|
|
|
|
* not be deleted by the caller.
|
|
|
|
*
|
|
|
|
* In case of failure, the method returns @c false and the
|
|
|
|
* caller is still responsible for deleting the object!
|
|
|
|
*
|
|
|
|
* @param p node coordinates
|
|
|
|
* @param meta pointer to @c NodeMetadata object
|
|
|
|
* @return @c true on success, false on failure
|
|
|
|
*/
|
|
|
|
bool setNodeMetadata(v3s16 p, NodeMetadata *meta);
|
2011-04-04 02:45:08 +02:00
|
|
|
void removeNodeMetadata(v3s16 p);
|
2012-03-19 01:08:04 +01:00
|
|
|
|
2012-07-17 15:00:04 +02:00
|
|
|
/*
|
|
|
|
Node Timers
|
|
|
|
These are basically coordinate wrappers to MapBlock
|
|
|
|
*/
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2012-07-17 15:00:04 +02:00
|
|
|
NodeTimer getNodeTimer(v3s16 p);
|
2016-03-21 12:58:52 +01:00
|
|
|
void setNodeTimer(const NodeTimer &t);
|
2012-07-17 15:00:04 +02:00
|
|
|
void removeNodeTimer(v3s16 p);
|
|
|
|
|
2011-01-17 13:57:37 +01:00
|
|
|
/*
|
2022-10-13 15:35:19 +02:00
|
|
|
Utilities
|
2011-01-17 13:57:37 +01:00
|
|
|
*/
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2022-10-13 15:35:19 +02:00
|
|
|
// Iterates through all nodes in the area in an unspecified order.
|
|
|
|
// The given callback takes the position as its first argument and the node
|
|
|
|
// as its second. If it returns false, forEachNodeInArea returns early.
|
|
|
|
template<typename F>
|
|
|
|
void forEachNodeInArea(v3s16 minp, v3s16 maxp, F func)
|
|
|
|
{
|
|
|
|
v3s16 bpmin = getNodeBlockPos(minp);
|
|
|
|
v3s16 bpmax = getNodeBlockPos(maxp);
|
|
|
|
for (s16 bz = bpmin.Z; bz <= bpmax.Z; bz++)
|
|
|
|
for (s16 bx = bpmin.X; bx <= bpmax.X; bx++)
|
|
|
|
for (s16 by = bpmin.Y; by <= bpmax.Y; by++) {
|
|
|
|
// y is iterated innermost to make use of the sector cache.
|
|
|
|
v3s16 bp(bx, by, bz);
|
|
|
|
MapBlock *block = getBlockNoCreateNoEx(bp);
|
|
|
|
v3s16 basep = bp * MAP_BLOCKSIZE;
|
|
|
|
s16 minx_block = rangelim(minp.X - basep.X, 0, MAP_BLOCKSIZE - 1);
|
|
|
|
s16 miny_block = rangelim(minp.Y - basep.Y, 0, MAP_BLOCKSIZE - 1);
|
|
|
|
s16 minz_block = rangelim(minp.Z - basep.Z, 0, MAP_BLOCKSIZE - 1);
|
|
|
|
s16 maxx_block = rangelim(maxp.X - basep.X, 0, MAP_BLOCKSIZE - 1);
|
|
|
|
s16 maxy_block = rangelim(maxp.Y - basep.Y, 0, MAP_BLOCKSIZE - 1);
|
|
|
|
s16 maxz_block = rangelim(maxp.Z - basep.Z, 0, MAP_BLOCKSIZE - 1);
|
|
|
|
for (s16 z_block = minz_block; z_block <= maxz_block; z_block++)
|
|
|
|
for (s16 y_block = miny_block; y_block <= maxy_block; y_block++)
|
|
|
|
for (s16 x_block = minx_block; x_block <= maxx_block; x_block++) {
|
|
|
|
v3s16 p = basep + v3s16(x_block, y_block, z_block);
|
|
|
|
MapNode n = block ?
|
|
|
|
block->getNodeNoCheck(x_block, y_block, z_block) :
|
|
|
|
MapNode(CONTENT_IGNORE);
|
|
|
|
if (!func(p, n))
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-01-07 03:43:46 +01:00
|
|
|
bool isBlockOccluded(MapBlock *block, v3s16 cam_pos_nodes)
|
2023-12-29 21:53:27 +01:00
|
|
|
{
|
2024-01-07 03:43:46 +01:00
|
|
|
return isBlockOccluded(block->getPosRelative(), cam_pos_nodes, false);
|
2023-12-29 21:53:27 +01:00
|
|
|
}
|
|
|
|
bool isBlockOccluded(v3s16 pos_relative, v3s16 cam_pos_nodes, bool simple_check = false);
|
|
|
|
|
2011-01-17 13:57:37 +01:00
|
|
|
protected:
|
2011-11-13 23:19:48 +01:00
|
|
|
IGameDef *m_gamedef;
|
2011-01-17 13:57:37 +01:00
|
|
|
|
2012-12-20 18:19:49 +01:00
|
|
|
std::set<MapEventReceiver*> m_event_receivers;
|
2012-07-26 21:06:45 +02:00
|
|
|
|
2022-05-23 22:50:49 +02:00
|
|
|
std::unordered_map<v2s16, MapSector*> m_sectors;
|
2011-01-17 13:57:37 +01:00
|
|
|
|
2013-01-06 20:40:24 +01:00
|
|
|
// Be sure to set this to NULL when the cached sector is deleted
|
2017-06-17 19:11:28 +02:00
|
|
|
MapSector *m_sector_cache = nullptr;
|
2011-01-17 13:57:37 +01:00
|
|
|
v2s16 m_sector_cache_p;
|
|
|
|
|
2017-01-04 19:18:40 +01:00
|
|
|
// This stores the properties of the nodes on the map.
|
2018-02-10 21:04:16 +01:00
|
|
|
const NodeDefManager *m_nodedef;
|
2017-01-04 19:18:40 +01:00
|
|
|
|
2022-05-09 21:20:58 +02:00
|
|
|
// Can be implemented by child class
|
|
|
|
virtual void reportMetrics(u64 save_time_us, u32 saved_blocks, u32 all_blocks) {}
|
|
|
|
|
2024-03-12 14:13:24 +01:00
|
|
|
bool determineAdditionalOcclusionCheck(v3s16 pos_camera,
|
|
|
|
const core::aabbox3d<s16> &block_bounds, v3s16 &to_check);
|
|
|
|
bool isOccluded(v3s16 pos_camera, v3s16 pos_target,
|
2019-08-23 21:52:11 +02:00
|
|
|
float step, float stepfac, float start_offset, float end_offset,
|
|
|
|
u32 needed_count);
|
2010-11-27 00:02:21 +01:00
|
|
|
};
|
|
|
|
|
2013-02-17 07:47:49 +01:00
|
|
|
#define VMANIP_BLOCK_DATA_INEXIST 1
|
|
|
|
#define VMANIP_BLOCK_CONTAINS_CIGNORE 2
|
|
|
|
|
2015-01-05 08:42:27 +01:00
|
|
|
class MMVManip : public VoxelManipulator
|
2010-12-11 17:11:03 +01:00
|
|
|
{
|
|
|
|
public:
|
2015-01-05 08:42:27 +01:00
|
|
|
MMVManip(Map *map);
|
2017-08-19 09:12:54 +02:00
|
|
|
virtual ~MMVManip() = default;
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2010-12-11 17:11:03 +01:00
|
|
|
virtual void clear()
|
|
|
|
{
|
|
|
|
VoxelManipulator::clear();
|
|
|
|
m_loaded_blocks.clear();
|
|
|
|
}
|
|
|
|
|
2013-06-25 17:49:08 +02:00
|
|
|
void initialEmerge(v3s16 blockpos_min, v3s16 blockpos_max,
|
2014-12-28 05:09:36 +01:00
|
|
|
bool load_if_inexistent = true);
|
2013-01-06 20:40:24 +01:00
|
|
|
|
2011-02-01 02:06:02 +01:00
|
|
|
// This is much faster with big chunks of generated data
|
2014-07-07 07:51:04 +02:00
|
|
|
void blitBackAll(std::map<v3s16, MapBlock*> * modified_blocks,
|
2014-12-28 05:09:36 +01:00
|
|
|
bool overwrite_generated = true);
|
2011-01-24 15:36:58 +01:00
|
|
|
|
2022-05-02 20:55:04 +02:00
|
|
|
/*
|
|
|
|
Creates a copy of this VManip including contents, the copy will not be
|
|
|
|
associated with a Map.
|
|
|
|
*/
|
|
|
|
MMVManip *clone() const;
|
|
|
|
|
|
|
|
// Reassociates a copied VManip to a map
|
|
|
|
void reparent(Map *map);
|
|
|
|
|
|
|
|
// Is it impossible to call initialEmerge / blitBackAll?
|
|
|
|
inline bool isOrphan() const { return !m_map; }
|
|
|
|
|
2017-06-17 19:11:28 +02:00
|
|
|
bool m_is_dirty = false;
|
2014-09-01 20:20:31 +02:00
|
|
|
|
2011-01-24 15:36:58 +01:00
|
|
|
protected:
|
2022-05-02 20:55:04 +02:00
|
|
|
MMVManip() {};
|
|
|
|
|
|
|
|
// may be null
|
|
|
|
Map *m_map = nullptr;
|
2014-06-09 14:25:35 +02:00
|
|
|
/*
|
|
|
|
key = blockpos
|
|
|
|
value = flags describing the block
|
|
|
|
*/
|
|
|
|
std::map<v3s16, u8> m_loaded_blocks;
|
2011-01-24 15:36:58 +01:00
|
|
|
};
|