server/random_maps/random_map.h

/*
 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
 * 
 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
 * Copyright (©) 1992 Frank Tore Johansen
 * 
 * Deliantra is free software: you can redistribute it and/or modify it under
 * the terms of the Affero GNU General Public License as published by the
 * Free Software Foundation, either version 3 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 General Public License for more details.
 * 
 * You should have received a copy of the Affero GNU General Public License
 * and the GNU General Public License along with this program. If not, see
 * <http://www.gnu.org/licenses/>.
 * 
 * The authors can be reached via e-mail to <support@deliantra.net>
 */

#ifndef RANDOM_MAP_H
#define RANDOM_MAP_H

#include "util.h"

struct random_map_params : zero_initialised
{
  char wall_name[512];
  char monsterstyle[512];
  char layoutstyle[512];
  char doorstyle[512];
  shstr origin_map;
  shstr final_map;
  shstr this_map;
  char exit_on_final_map[512];
 
  int xsize, ysize;
  int expand2x;
  int layoutoptions1;
  int layoutoptions2;
  int layoutoptions3;
  int symmetry;
  int difficulty;
  int difficulty_given;
  float difficulty_increase;

  int dungeon_level;
  int dungeon_depth;

  int orientation;
  int origin_x;
  int origin_y;
  uint32_t random_seed;
  uint64_t total_map_hp;
  int map_layout_style;
  int symmetry_used;

  struct region *region;

  HV *hv;
  void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })

  shstr_tmp as_shstr () const;

  // fetch something from the options hash
  SV               *get_sv  (const char *option) const;
  const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const;
  IV                get_iv  (const char *option, IV                fallback =  0) const;
  UV                get_uv  (const char *option, UV                fallback =  0) const;
  NV                get_nv  (const char *option, NV                fallback =  0) const;

  void set (const char *option, SV               *value) const;
  void set (const char *option, const_utf8_string value) const;
  void set (const char *option, IV                value) const;
  void set (const char *option, UV                value) const;
  void set (const char *option, NV                value) const;

  void set (const char *option, int value) const { set (option, (IV)value); }

  // "private", adjusted sizes
  int Xsize;
  int Ysize;

  ~random_map_params ();
};

enum {
  LAYOUT_NONE,
  LAYOUT_ONION,
  LAYOUT_MAZE,
  LAYOUT_SPIRAL,
  LAYOUT_ROGUELIKE,
  LAYOUT_SNAKE,
  LAYOUT_SQUARE_SPIRAL,
  LAYOUT_CAVE,
  NROFLAYOUTS,
};

/*
 * Move these defines out of room_gen_onion.c to here, as
 * other files (like square_spiral) also uses them.

options:
0       Pick random options below
1       "centered"
2       linear doors (default is nonlinear)
4       bottom "centered"
8  bottom-right centered
16      irregularly/randomly spaced layers (default: regular)
32      outer wall off:  i.e., no outer wall.

*/

enum {
  RMOPT_RANDOM     =   0,
  RMOPT_CENTERED   =   1,
  RMOPT_LINEAR     =   2,
  RMOPT_BOTTOM_C   =   4,
  RMOPT_BOTTOM_R   =   8,
  RMOPT_IRR_SPACE  =  16,
  RMOPT_WALL_OFF   =  32,
  RMOPT_WALLS_ONLY =  64,
  RMOPT_NO_DOORS   = 256, /* Place walls insead of doors.  Produces broken map. */  
};

/* symmetry definitions--used in this file AND in treasure.c:
the numerical values matter so don't change them. */
enum {
  SYMMETRY_RANDOM,
  SYMMETRY_NONE,
  SYMMETRY_X,
  SYMMETRY_Y,
  SYMMETRY_XY,
};

// 12 has been experimentally :( determined ot be a lot more stable
// than 11 or 10, leading to the assumption that something inherently
// needs a minimum size of at least 12
#define MIN_RANDOM_MAP_SIZE 12

// we often use signed chars for coordinates (and U8 for distances)
#define MAX_RANDOM_MAP_SIZE 120

// reference
//
// \0  floor only
// #   wall
// D   door
// <   up
// >   down
// C   "center" (of onion layout)
// .   ?? (rogue)
//

// use this in new code
struct Layout 
{
  char **col;
  int w, h;

  Layout (int w, int h);
  ~Layout ();

  operator char **() const
  {
    return col;
  }

  void swap (Layout &layout)
  {
    ::swap (layout.col, col);
    ::swap (layout.w  , w  );
    ::swap (layout.h  , h  );
  }

  // for debugging, print layout to stdout
  void print () const;

  // simple inpainting
  void fill (char fill);
  void clear () { fill (0); }
  void border (char fill = '#');
  void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive

  void fill_rand (int perc);

  // makes sure all areas are connected. dirty=true carves rounder but also
  // more walls, dirty=false carves narrow corridors.
  void isolation_remover (bool dirty = 0);

  // generates a cave, subtype 0 is a rough cave, randomly open or closed
  void gen_cave (int subtype);

  // helper functions to modify the layout
  void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
  void doorify ();
  void roomify (); // make some rooms in it, works best on onions
  void expand2x ();
  void symmetrize (int symmetry);
  void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees

  void generate (random_map_params *RP);
};

// utility functions, to use rmg_rndm instead of rndm.
static inline int
rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
{
  swap (rmg_rndm, rndm);
  int i = find_free_spot (ob, m, x, y, start, stop);
  swap (rmg_rndm, rndm);
  return i;
}

// a simple point helper struct
struct point
{
  short x;
  short y;

  point ()
  {
  }

  point (int x, int y)
  : x(x), y(y)
  {
  }
};

// something like a vector or stack, but without
// out of bounds checking
template<typename T>
struct fixed_stack
{
  T *data;
  int size;
  int max;

  fixed_stack ()
  : size (0), data (0)
  {
  }

  fixed_stack (int max)
  : size (0), max (max)
  {
    data = salloc<T> (max);
  }

  void reset (int new_max)
  {
    sfree (data, max);
    size = 0;
    max = new_max;
    data = salloc<T> (max);
  }

  void free ()
  {
    sfree (data, max);
    data = 0;
  }

  ~fixed_stack ()
  {
    sfree (data, max);
  }

  T &operator[](int idx)
  {
    return data [idx];
  }

  void push (T v)
  {
    data [size++] = v;
  }

  T &pop ()
  {
    return data [--size];
  }

  T remove (int idx)
  {
    T v = data [idx];

    data [idx] = data [--size];

    return v;
  }
};

#endif

Revision:	1.33
Committed:	Fri Jul 2 03:40:14 2010 UTC (13 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.32:	+9 -2 lines
Log Message:	refactoring (untested)
#	User	Rev	Content
1	root	1.1	/*
2	root	1.16	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	root	1.14	*
4	root	1.23	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	root	1.22	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6			* Copyright (©) 1992 Frank Tore Johansen
7	root	1.14	*
8	root	1.21	* Deliantra is free software: you can redistribute it and/or modify it under
9			* the terms of the Affero GNU General Public License as published by the
10			* Free Software Foundation, either version 3 of the License, or (at your
11			* option) any later version.
12	root	1.14	*
13	root	1.15	* This program is distributed in the hope that it will be useful,
14			* but WITHOUT ANY WARRANTY; without even the implied warranty of
15			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16			* GNU General Public License for more details.
17	root	1.14	*
18	root	1.21	* You should have received a copy of the Affero GNU General Public License
19			* and the GNU General Public License along with this program. If not, see
20			* <http://www.gnu.org/licenses/>.
21	root	1.14	*
22	root	1.16	* The authors can be reached via e-mail to <support@deliantra.net>
23	root	1.1	*/
24
25			#ifndef RANDOM_MAP_H
26			#define RANDOM_MAP_H
27
28	root	1.17	#include "util.h"
29
30	root	1.25	struct random_map_params : zero_initialised
31	root	1.6	{
32	root	1.1	char wall_name[512];
33			char monsterstyle[512];
34			char layoutstyle[512];
35			char doorstyle[512];
36	root	1.7	shstr origin_map;
37			shstr final_map;
38			shstr this_map;
39	root	1.1	char exit_on_final_map[512];
40	root	1.26
41	root	1.11	int xsize, ysize;
42	root	1.1	int expand2x;
43			int layoutoptions1;
44			int layoutoptions2;
45			int layoutoptions3;
46			int symmetry;
47			int difficulty;
48			int difficulty_given;
49			float difficulty_increase;
50	root	1.8
51	root	1.1	int dungeon_level;
52			int dungeon_depth;
53	root	1.8
54	root	1.1	int orientation;
55	root	1.28	int origin_x;
56	root	1.1	int origin_y;
57	root	1.12	uint32_t random_seed;
58	root	1.6	uint64_t total_map_hp;
59	root	1.1	int map_layout_style;
60			int symmetry_used;
61	root	1.6
62	elmex	1.2	struct region *region;
63	root	1.11
64	root	1.26	HV *hv;
65	root	1.28	void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
66
67			shstr_tmp as_shstr () const;
68	root	1.26
69			// fetch something from the options hash
70	root	1.28	SV get_sv (const char option) const;
71			const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const;
72			IV get_iv (const char *option, IV fallback = 0) const;
73			UV get_uv (const char *option, UV fallback = 0) const;
74			NV get_nv (const char *option, NV fallback = 0) const;
75
76			void set (const char option, SV value) const;
77			void set (const char *option, const_utf8_string value) const;
78			void set (const char *option, IV value) const;
79			void set (const char *option, UV value) const;
80			void set (const char *option, NV value) const;
81	root	1.26
82	root	1.28	void set (const char *option, int value) const { set (option, (IV)value); }
83	root	1.26
84	root	1.11	// "private", adjusted sizes
85			int Xsize;
86			int Ysize;
87	root	1.26
88			~random_map_params ();
89	root	1.6	};
90	root	1.1
91	root	1.6	enum {
92			LAYOUT_NONE,
93			LAYOUT_ONION,
94			LAYOUT_MAZE,
95			LAYOUT_SPIRAL,
96			LAYOUT_ROGUELIKE,
97			LAYOUT_SNAKE,
98			LAYOUT_SQUARE_SPIRAL,
99	root	1.30	LAYOUT_CAVE,
100	root	1.6	NROFLAYOUTS,
101			};
102	root	1.1
103			/*
104			* Move these defines out of room_gen_onion.c to here, as
105			* other files (like square_spiral) also uses them.
106
107			options:
108			0 Pick random options below
109			1 "centered"
110			2 linear doors (default is nonlinear)
111			4 bottom "centered"
112			8 bottom-right centered
113			16 irregularly/randomly spaced layers (default: regular)
114			32 outer wall off: i.e., no outer wall.
115
116			*/
117
118	root	1.6	enum {
119			RMOPT_RANDOM = 0,
120			RMOPT_CENTERED = 1,
121			RMOPT_LINEAR = 2,
122			RMOPT_BOTTOM_C = 4,
123			RMOPT_BOTTOM_R = 8,
124			RMOPT_IRR_SPACE = 16,
125			RMOPT_WALL_OFF = 32,
126			RMOPT_WALLS_ONLY = 64,
127			RMOPT_NO_DOORS = 256, /* Place walls insead of doors. Produces broken map. */
128			};
129	root	1.1
130			/* symmetry definitions--used in this file AND in treasure.c:
131			the numerical values matter so don't change them. */
132	root	1.6	enum {
133			SYMMETRY_RANDOM,
134			SYMMETRY_NONE,
135			SYMMETRY_X,
136			SYMMETRY_Y,
137			SYMMETRY_XY,
138			};
139	root	1.1
140	root	1.13	// 12 has been experimentally :( determined ot be a lot more stable
141			// than 11 or 10, leading to the assumption that something inherently
142			// needs a minimum size of at least 12
143			#define MIN_RANDOM_MAP_SIZE 12
144	root	1.1
145	root	1.31	// we often use signed chars for coordinates (and U8 for distances)
146			#define MAX_RANDOM_MAP_SIZE 120
147
148	root	1.20	// reference
149			//
150			// \0 floor only
151			// # wall
152			// D door
153			// < up
154			// > down
155			// C "center" (of onion layout)
156			// . ?? (rogue)
157			//
158
159	root	1.30	// use this in new code
160	root	1.32	struct Layout
161	root	1.17	{
162			char **col;
163	root	1.18	int w, h;
164	root	1.17
165	root	1.32	Layout (int w, int h);
166			~Layout ();
167	root	1.17
168	root	1.33	operator char **() const
169	root	1.17	{
170			return col;
171			}
172	root	1.18
173	root	1.32	void swap (Layout &layout)
174			{
175			::swap (layout.col, col);
176			::swap (layout.w , w );
177			::swap (layout.h , h );
178			}
179
180	root	1.30	// for debugging, print layout to stdout
181	root	1.33	void print () const;
182	root	1.30
183			// simple inpainting
184	root	1.29	void fill (char fill);
185			void clear () { fill (0); }
186	root	1.18	void border (char fill = '#');
187	root	1.29	void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
188
189	root	1.30	void fill_rand (int perc);
190
191	root	1.29	// makes sure all areas are connected. dirty=true carves rounder but also
192	root	1.30	// more walls, dirty=false carves narrow corridors.
193	root	1.29	void isolation_remover (bool dirty = 0);
194	root	1.30
195			// generates a cave, subtype 0 is a rough cave, randomly open or closed
196			void gen_cave (int subtype);
197	root	1.33
198			// helper functions to modify the layout
199	root	1.30	void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
200	root	1.33	void doorify ();
201			void roomify (); // make some rooms in it, works best on onions
202			void expand2x ();
203			void symmetrize (int symmetry);
204			void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
205	root	1.30
206	root	1.32	void generate (random_map_params *RP);
207	root	1.17	};
208
209	root	1.25	// utility functions, to use rmg_rndm instead of rndm.
210			static inline int
211			rmg_find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
212			{
213			swap (rmg_rndm, rndm);
214			int i = find_free_spot (ob, m, x, y, start, stop);
215			swap (rmg_rndm, rndm);
216			return i;
217			}
218
219	root	1.30	// a simple point helper struct
220	root	1.29	struct point
221			{
222			short x;
223			short y;
224
225			point ()
226			{
227			}
228
229			point (int x, int y)
230			: x(x), y(y)
231			{
232			}
233			};
234
235	root	1.30	// something like a vector or stack, but without
236			// out of bounds checking
237	root	1.29	template<typename T>
238			struct fixed_stack
239			{
240			T *data;
241			int size;
242			int max;
243
244			fixed_stack ()
245			: size (0), data (0)
246			{
247			}
248
249			fixed_stack (int max)
250			: size (0), max (max)
251			{
252			data = salloc<T> (max);
253			}
254
255			void reset (int new_max)
256			{
257			sfree (data, max);
258			size = 0;
259			max = new_max;
260			data = salloc<T> (max);
261			}
262
263			void free ()
264			{
265			sfree (data, max);
266			data = 0;
267			}
268
269			~fixed_stack ()
270			{
271			sfree (data, max);
272			}
273
274			T &operator[](int idx)
275			{
276			return data [idx];
277			}
278
279			void push (T v)
280			{
281			data [size++] = v;
282			}
283
284			T &pop ()
285			{
286			return data [--size];
287			}
288
289			T remove (int idx)
290			{
291			T v = data [idx];
292
293			data [idx] = data [--size];
294
295			return v;
296			}
297			};
298
299	root	1.6	#endif
300	root	1.1