games/minimal/mods/default/textures/default_ladder.png

/*
Minetest
Copyright (C) 2010-2018 kwolekr, Ryan Kwolek <kwolekr@minetest.net>
Copyright (C) 2015-2018 paramat

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

#define VMANIP_FLAG_CAVE VOXELFLAG_CHECKED1

class GenerateNotifier;

/*
	CavesNoiseIntersection is a cave digging algorithm that carves smooth,
	web-like, continuous tunnels at points where the density of the intersection
	between two separate 3d noises is above a certain value.  This value,
	cave_width, can be modified to set the effective width of these tunnels.

	This algorithm is relatively heavyweight, taking ~80ms to generate an
	80x80x80 chunk of map on a modern processor.  Use sparingly!

	TODO(hmmmm): Remove dependency on biomes
	TODO(hmmmm): Find alternative to overgeneration as solution for sunlight issue
*/
class CavesNoiseIntersection
{
public:
	CavesNoiseIntersection(const NodeDefManager *nodedef,
		BiomeManager *biomemgr, v3s16 chunksize, NoiseParams *np_cave1,
		NoiseParams *np_cave2, s32 seed, float cave_width);
	~CavesNoiseIntersection();

	void generateCaves(MMVManip *vm, v3s16 nmin, v3s16 nmax, u8 *biomemap);

private:
	const NodeDefManager *m_ndef;
	BiomeManager *m_bmgr;

	// configurable parameters
	v3s16 m_csize;
	float m_cave_width;

	// intermediate state variables
	u16 m_ystride;
	u16 m_zstride_1d;

	Noise *noise_cave1;
	Noise *noise_cave2;
};

/*
	CavernsNoise is a cave digging algorithm
*/
class CavernsNoise
{
public:
	CavernsNoise(const NodeDefManager *nodedef, v3s16 chunksize,
		NoiseParams *np_cavern, s32 seed, float cavern_limit,
		float cavern_taper, float cavern_threshold);
	~CavernsNoise();

	bool generateCaverns(MMVManip *vm, v3s16 nmin, v3s16 nmax);

private:
	const NodeDefManager *m_ndef;

	// configurable parameters
	v3s16 m_csize;
	float m_cavern_limit;
	float m_cavern_taper;
	float m_cavern_threshold;

	// intermediate state variables
	u16 m_ystride;
	u16 m_zstride_1d;

	Noise *noise_cavern;

	content_t c_water_source;
	content_t c_lava_source;
};

/*
	CavesRandomWalk is an implementation of a cave-digging algorithm that
	operates on the principle of a "random walk" to approximate the stochiastic
	activity of cavern development.

	In summary, this algorithm works by carving a randomly sized tunnel in a
	random direction a random amount of times, randomly varying in width.
	All randomness here is uniformly distributed; alternative distributions have
	not yet been implemented.

	This algorithm is very fast, executing in less than 1ms on average for an
	80x80x80 chunk of map on a modern processor.
*/
class CavesRandomWalk
{
public:
	MMVManip *vm;
	const NodeDefManager *ndef;
	GenerateNotifier *gennotify;
	s16 *heightmap;

	// configurable parameters
	s32 seed;
	int water_level;
	int lava_depth;
	NoiseParams *np_caveliquids;

	// intermediate state variables
	u16 ystride;

	s16 min_tunnel_diameter;
	s16 max_tunnel_diameter;
	u16 tunnel_routepoints;
	int part_max_length_rs;

	bool large_cave;
	bool large_cave_is_flat;
	bool flooded;

	s16 max_stone_y;
	v3s16 node_min;
	v3s16 node_max;

	v3f orp;  // starting point, relative to caved space
	v3s16 of; // absolute coordinates of caved space
	v3s16 ar; // allowed route area
	s16 rs;   // tunnel radius size
	v3f main_direction;

	s16 route_y_min;
	s16 route_y_max;

	PseudoRandom *ps;

	content_t c_water_source;
	content_t c_lava_source;

	// ndef is a mandatory parameter.
	// If gennotify is NULL, generation events are not logged.
	CavesRandomWalk(const NodeDefManager *ndef, GenerateNotifier *gennotify =
		NULL, s32 seed = 0, int water_level = 1, content_t water_source =
		CONTENT_IGNORE, content_t lava_source = CONTENT_IGNORE,
		int lava_depth = -256);

	// vm and ps are mandatory parameters.
	// If heightmap is NULL, the surface level at all points is assumed to
	// be water_level.
	void makeCave(MMVManip *vm, v3s16 nmin, v3s16 nmax, PseudoRandom *ps,
			bool is_large_cave, int max_stone_height, s16 *heightmap);

private:
	void makeTunnel(bool dirswitch);
	void carveRoute(v3f vec, float f, bool randomize_xz);

	inline bool isPosAboveSurface(v3s16 p);
};

/*
	CavesV6 is the original version of caves used with Mapgen V6.

	Though it uses the same fundamental algorithm as CavesRandomWalk, it is made
	separate to preserve the exact sequence of PseudoRandom calls - any change
	to this ordering results in the output being radically different.
	Because caves in Mapgen V6 are responsible for a large portion of the basic
	terrain shape, modifying this will break our contract of reverse
	compatibility for a 'stable' mapgen such as V6.

	tl;dr,
ofs	hex dump	ascii
0000	89 50 4e 47 0d 0a 1a 0a 00 00 00 0d 49 48 44 52 00 00 00 10 00 00 00 10 08 03 00 00 00 28 2d 0f	.PNG........IHDR.............(-.
0020	53 00 00 00 b4 50 4c 54 45 00 00 00 64 47 1b 64 48 1a 69 4a 1c 6a 4c 1c 6b 4c 1c 6d 4d 1c 6e 4e	S....PLTE...dG.dH.iJ.jL.kL.mM.nN
0040	1d 6f 4f 1d 6f 4f 1e 70 50 1e 71 50 1e 71 51 1e 72 50 1e 72 51 1e 73 52 1f 74 53 1e 74 53 1f 75	.oO.oO.pP.qP.qQ.rP.rQ.sR.tS.tS.u
0060	53 1f 76 54 1f 77 55 1f 78 55 1f 79 56 1e 79 56 1f 79 56 20 7a 57 20 7b 57 20 80 5c 22 81 5b 22	S.vT.wU.xU.yV.yV.yV.zW.{W..\".["
0080	86 63 2b 89 65 2c 8b 67 2d 90 6a 2f 91 6b 2f 93 6d 30 95 6d 30 95 6e 30 96 6f 30 96 6f 31 98 71	.c+.e,.g-.j/.k/.m0.m0.n0.o0.o1.q
00a0	32 99 72 32 9a 6e 28 9a 73 32 9b 73 33 9c 74 32 9c 74 33 9d 74 33 9f 75 33 a1 76 34 a2 77 35 a4	2.r2.n(.s2.s3.t2.t3.t3.u3.v4.w5.
00c0	78 35 a4 79 36 a7 7b 37 a8 7d 37 a9 7c 37 ab 7e 38 af 81 39 b0 83 39 b3 84 3a b6 87 3b d2 d1 e8	x5.y6.{7.}7.\|7.~8..9..9..:..;...
00e0	09 00 00 00 01 74 52 4e 53 00 40 e6 d8 66 00 00 00 6a 49 44 41 54 18 57 63 60 60 d0 14 63 80 02	.....tRNS.@..f...jIDAT.Wc``..c..
0100	31 4d 30 43 53 4c 51 d7 c8 d0 54 57 5d 16 2e 20 ce 24 24 c2 c7 c9 23 0d 17 c0 d0 82 21 a0 a1 62	1M0CSLQ...TW]....$$...#.....!..b
0120	69 a5 6d 66 20 07 d7 22 c0 cc 2f 28 ca cd ca 4e 82 19 6a fa 4a 5a d6 aa 3a 0a 70 2d 1c fc 2c 6c	i.mf..."../(...N..j.JZ..:.p-..,l
0140	32 c2 bc 5c 24 98 61 61 ac 27 6f 6e a2 a8 0c d7 c2 2b c9 2d 25 c1 ce c9 88 d5 0c 00 23 63 0f 11	2..\$.aa.'on.....+.-%.......#c..
0160	fe 9b 7f 95 00 00 00 00 49 45 4e 44 ae 42 60 82	........IEND.B`.