aboutsummaryrefslogtreecommitdiff
path: root/src/mapgen/mapgen_flat.h
blob: 4b46aff27343b90acefad8807ed2349001fcc980 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*
Minetest
Copyright (C) 2015-2020 paramat
Copyright (C) 2015-2016 kwolekr, Ryan Kwolek <kwolekr@minetest.net>

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.
*/

#pragma once

#include "mapgen.h"

/////// Mapgen Flat flags
#define MGFLAT_LAKES 0x01
#define MGFLAT_HILLS 0x02
#define MGFLAT_CAVERNS 0x04

class BiomeManager;

extern FlagDesc flagdesc_mapgen_flat[];

struct MapgenFlatParams : public MapgenParams
{
	s16 ground_level = 8;
	float lake_threshold = -0.45f;
	float lake_steepness = 48.0f;
	float hill_threshold = 0.45f;
	float hill_steepness = 64.0f;

	float cave_width = 0.09f;
	u16 small_cave_num_min = 0;
	u16 small_cave_num_max = 0;
	u16 large_cave_num_min = 0;
	u16 large_cave_num_max = 2;
	s16 large_cave_depth = -33;
	float large_cave_flooded = 0.5f;
	s16 cavern_limit = -256;
	s16 cavern_taper = 256;
	float cavern_threshold = 0.7f;
	s16 dungeon_ymin = -31000;
	s16 dungeon_ymax = 31000;

	NoiseParams np_terrain;
	NoiseParams np_filler_depth;
	NoiseParams np_cavern;
	NoiseParams np_cave1;
	NoiseParams np_cave2;
	NoiseParams np_dungeons;

	MapgenFlatParams();
	~MapgenFlatParams() = default;

	void readParams(const Settings *settings);
	void writeParams(Settings *settings) const;
	void setDefaultSettings(Settings *settings);
};

class MapgenFlat : public MapgenBasic
{
public:
	MapgenFlat(MapgenFlatParams *params, EmergeParams *emerge);
	~MapgenFlat();

	virtual MapgenType getType() const { return MAPGEN_FLAT; }

	virtual void makeChunk(BlockMakeData *data);
	int getSpawnLevelAtPoint(v2s16 p);
	s16 generateTerrain();

private:
	s16 ground_level;
	float lake_threshold;
	float lake_steepness;
	float hill_threshold;
	float hill_steepness;

	Noise *noise_terrain;
};
n class="hl num">0] == '.') continue; std::string modpath = modspath + DIR_DELIM + modname; TRACESTREAM(<<indentation<<"collectMods: "<<modname<<" at \""<<modpath<<"\""<<std::endl); // Handle modpacks (defined by containing modpack.txt) { std::ifstream is((modpath+DIR_DELIM+"modpack.txt").c_str(), std::ios_base::binary); if(is.good()){ // Is a modpack is.close(); // We don't actually need the file // Recurse into it collectMods(modpath, mods_satisfied, mods_unsorted, mod_names, indentation); continue; } } // Detect mod name conflicts { std::map<std::string, std::string>::const_iterator i; i = mod_names.find(modname); if(i != mod_names.end()){ std::string s; infostream<<indentation<<"WARNING: Mod name conflict detected: " <<std::endl <<"Already loaded: "<<i->second<<std::endl <<"Will not load: "<<modpath<<std::endl; continue; } } std::set<std::string> depends; std::ifstream is((modpath+DIR_DELIM+"depends.txt").c_str(), std::ios_base::binary); while(is.good()){ std::string dep; std::getline(is, dep); dep = trim(dep); if(dep != "") depends.insert(dep); } ModSpec spec(modname, modpath, depends); mods_unsorted.push_back(spec); if(depends.empty()) mods_satisfied.push(spec); mod_names[modname] = modpath; } } // Get a dependency-sorted list of ModSpecs core::list<ModSpec> getMods(core::list<std::string> &modspaths) throw(ModError) { std::queue<ModSpec> mods_satisfied; core::list<ModSpec> mods_unsorted; core::list<ModSpec> mods_sorted; // name, path: For detecting name conflicts std::map<std::string, std::string> mod_names; for(core::list<std::string>::Iterator i = modspaths.begin(); i != modspaths.end(); i++){ std::string modspath = *i; collectMods(modspath, mods_satisfied, mods_unsorted, mod_names, ""); } // Sort by depencencies while(!mods_satisfied.empty()){ ModSpec mod = mods_satisfied.front(); mods_satisfied.pop(); mods_sorted.push_back(mod); for(core::list<ModSpec>::Iterator i = mods_unsorted.begin(); i != mods_unsorted.end(); i++){ ModSpec &mod2 = *i; if(mod2.unsatisfied_depends.empty()) continue; mod2.unsatisfied_depends.erase(mod.name); if(!mod2.unsatisfied_depends.empty()) continue; mods_satisfied.push(mod2); } } std::ostringstream errs(std::ios::binary); // Check unsatisfied dependencies for(core::list<ModSpec>::Iterator i = mods_unsorted.begin(); i != mods_unsorted.end(); i++){ ModSpec &mod = *i; if(mod.unsatisfied_depends.empty()) continue; errs<<"mod \""<<mod.name <<"\" has unsatisfied dependencies:"; for(std::set<std::string>::iterator i = mod.unsatisfied_depends.begin(); i != mod.unsatisfied_depends.end(); i++){ errs<<" \""<<(*i)<<"\""; } errs<<"."<<std::endl; mods_sorted.push_back(mod); } // If an error occurred, throw an exception if(errs.str().size() != 0){ throw ModError(errs.str()); }