mirror of
https://github.com/minetest/minetest.git
synced 2024-09-19 20:08:33 +02:00
4adbd69a37
To avoid spawn search failing in new specialised mapgens Increase spawn search range to 4000 nodes Add getSpawnLevelAtPoint() functions to EmergeManager, class Mapgen and all mapgens Remove getGroundLevelAtPoint() functions from all mapgens except mgv6 (possibly to be re-added later in the correct form to return actual ground level) Make mgvalleys flag names consistent with other mapgens Remove now unused 'vertical spawn range' setting
106 lines
2.9 KiB
C++
106 lines
2.9 KiB
C++
/*
|
|
Minetest
|
|
Copyright (C) 2010-2015 celeron55, Perttu Ahola <celeron55@gmail.com>
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
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
|
|
(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
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
|
|
#include "mapgen_singlenode.h"
|
|
#include "voxel.h"
|
|
#include "mapblock.h"
|
|
#include "mapnode.h"
|
|
#include "map.h"
|
|
#include "nodedef.h"
|
|
#include "voxelalgorithms.h"
|
|
#include "emerge.h"
|
|
|
|
|
|
MapgenSinglenode::MapgenSinglenode(int mapgenid,
|
|
MapgenParams *params, EmergeManager *emerge)
|
|
: Mapgen(mapgenid, params, emerge)
|
|
{
|
|
flags = params->flags;
|
|
|
|
INodeDefManager *ndef = emerge->ndef;
|
|
|
|
c_node = ndef->getId("mapgen_singlenode");
|
|
if (c_node == CONTENT_IGNORE)
|
|
c_node = CONTENT_AIR;
|
|
|
|
MapNode n_node(c_node);
|
|
set_light = (ndef->get(n_node).sunlight_propagates) ? LIGHT_SUN : 0x00;
|
|
}
|
|
|
|
|
|
MapgenSinglenode::~MapgenSinglenode()
|
|
{
|
|
}
|
|
|
|
|
|
//////////////////////// Map generator
|
|
|
|
void MapgenSinglenode::makeChunk(BlockMakeData *data)
|
|
{
|
|
// Pre-conditions
|
|
assert(data->vmanip);
|
|
assert(data->nodedef);
|
|
assert(data->blockpos_requested.X >= data->blockpos_min.X &&
|
|
data->blockpos_requested.Y >= data->blockpos_min.Y &&
|
|
data->blockpos_requested.Z >= data->blockpos_min.Z);
|
|
assert(data->blockpos_requested.X <= data->blockpos_max.X &&
|
|
data->blockpos_requested.Y <= data->blockpos_max.Y &&
|
|
data->blockpos_requested.Z <= data->blockpos_max.Z);
|
|
|
|
this->generating = true;
|
|
this->vm = data->vmanip;
|
|
this->ndef = data->nodedef;
|
|
|
|
v3s16 blockpos_min = data->blockpos_min;
|
|
v3s16 blockpos_max = data->blockpos_max;
|
|
|
|
// Area of central chunk
|
|
v3s16 node_min = blockpos_min * MAP_BLOCKSIZE;
|
|
v3s16 node_max = (blockpos_max + v3s16(1, 1, 1)) * MAP_BLOCKSIZE - v3s16(1, 1, 1);
|
|
|
|
blockseed = getBlockSeed2(node_min, data->seed);
|
|
|
|
MapNode n_node(c_node);
|
|
|
|
for (s16 z = node_min.Z; z <= node_max.Z; z++)
|
|
for (s16 y = node_min.Y; y <= node_max.Y; y++) {
|
|
u32 i = vm->m_area.index(node_min.X, y, z);
|
|
for (s16 x = node_min.X; x <= node_max.X; x++) {
|
|
if (vm->m_data[i].getContent() == CONTENT_IGNORE)
|
|
vm->m_data[i] = n_node;
|
|
i++;
|
|
}
|
|
}
|
|
|
|
// Add top and bottom side of water to transforming_liquid queue
|
|
updateLiquid(&data->transforming_liquid, node_min, node_max);
|
|
|
|
// Set lighting
|
|
if ((flags & MG_LIGHT) && set_light == LIGHT_SUN)
|
|
setLighting(LIGHT_SUN, node_min, node_max);
|
|
|
|
this->generating = false;
|
|
}
|
|
|
|
|
|
int MapgenSinglenode::getSpawnLevelAtPoint(v2s16 p)
|
|
{
|
|
return 0;
|
|
}
|