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 maze)
// .   ?? (rogue)
//

// use this in new code
INTERFACE_CLASS(layout)
struct layout 
{
  typedef char cell;

  cell **data;
  int w, h;

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

  operator cell **() const
  {
    return data;
  }

  void swap (layout &maze)
  {
    ::swap (maze.data, data);
    ::swap (maze.w   , w  );
    ::swap (maze.h   , h  );
  }

  MTH void swap (layout *maze) { swap (*maze); }

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

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

  MTH void fill_rand (int perc);

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

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

  // helper functions to modify the maze
  MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
  MTH void doorify ();
  MTH void roomify (); // make some rooms in it, works best on onions
  MTH void expand2x ();
  MTH void symmetrize (int symmetry);
  MTH 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.35
Committed:	Fri Jul 2 15:43:37 2010 UTC (13 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.34:	+10 -6 lines
Log Message:	more useless perl accessors
#	Content
1	/*
2	* This file is part of Deliantra, the Roguelike Realtime MMORPG.
3	*
4	* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5	* Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6	* Copyright (©) 1992 Frank Tore Johansen
7	*
8	* 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	*
13	* 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	*
18	* 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	*
22	* The authors can be reached via e-mail to <support@deliantra.net>
23	*/
24
25	#ifndef RANDOM_MAP_H
26	#define RANDOM_MAP_H
27
28	#include "util.h"
29
30	struct random_map_params : zero_initialised
31	{
32	char wall_name[512];
33	char monsterstyle[512];
34	char layoutstyle[512];
35	char doorstyle[512];
36	shstr origin_map;
37	shstr final_map;
38	shstr this_map;
39	char exit_on_final_map[512];
40
41	int xsize, ysize;
42	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
51	int dungeon_level;
52	int dungeon_depth;
53
54	int orientation;
55	int origin_x;
56	int origin_y;
57	uint32_t random_seed;
58	uint64_t total_map_hp;
59	int map_layout_style;
60	int symmetry_used;
61
62	struct region *region;
63
64	HV *hv;
65	void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
66
67	shstr_tmp as_shstr () const;
68
69	// fetch something from the options hash
70	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
82	void set (const char *option, int value) const { set (option, (IV)value); }
83
84	// "private", adjusted sizes
85	int Xsize;
86	int Ysize;
87
88	~random_map_params ();
89	};
90
91	enum {
92	LAYOUT_NONE,
93	LAYOUT_ONION,
94	LAYOUT_MAZE,
95	LAYOUT_SPIRAL,
96	LAYOUT_ROGUELIKE,
97	LAYOUT_SNAKE,
98	LAYOUT_SQUARE_SPIRAL,
99	LAYOUT_CAVE,
100	NROFLAYOUTS,
101	};
102
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	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
130	/* symmetry definitions--used in this file AND in treasure.c:
131	the numerical values matter so don't change them. */
132	enum {
133	SYMMETRY_RANDOM,
134	SYMMETRY_NONE,
135	SYMMETRY_X,
136	SYMMETRY_Y,
137	SYMMETRY_XY,
138	};
139
140	// 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
145	// we often use signed chars for coordinates (and U8 for distances)
146	#define MAX_RANDOM_MAP_SIZE 120
147
148	// reference
149	//
150	// \0 floor only
151	// # wall
152	// D door
153	// < up
154	// > down
155	// C "center" (of onion maze)
156	// . ?? (rogue)
157	//
158
159	// use this in new code
160	INTERFACE_CLASS(layout)
161	struct layout
162	{
163	typedef char cell;
164
165	cell **data;
166	int w, h;
167
168	layout (int w, int h);
169	~layout ();
170
171	operator cell **() const
172	{
173	return data;
174	}
175
176	void swap (layout &maze)
177	{
178	::swap (maze.data, data);
179	::swap (maze.w , w );
180	::swap (maze.h , h );
181	}
182
183	MTH void swap (layout maze) { swap (maze); }
184
185	// for debugging, print maze to stdout
186	MTH void print () const;
187
188	// simple inpainting
189	MTH void fill (char fill);
190	MTH void clear () { fill (0); }
191	MTH void border (char fill = '#');
192	MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
193
194	MTH void fill_rand (int perc);
195
196	// makes sure all areas are connected. dirty=true carves rounder but also
197	// more walls, dirty=false carves narrow corridors.
198	MTH void isolation_remover (bool dirty = 0);
199
200	// generates a cave, subtype 0 is a rough cave, randomly open or closed
201	MTH void gen_cave (int subtype);
202
203	// helper functions to modify the maze
204	MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
205	MTH void doorify ();
206	MTH void roomify (); // make some rooms in it, works best on onions
207	MTH void expand2x ();
208	MTH void symmetrize (int symmetry);
209	MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
210
211	void generate (random_map_params *RP);
212	};
213
214	// utility functions, to use rmg_rndm instead of rndm.
215	static inline int
216	rmg_find_free_spot (const object ob, maptile m, int x, int y, int start, int stop)
217	{
218	swap (rmg_rndm, rndm);
219	int i = find_free_spot (ob, m, x, y, start, stop);
220	swap (rmg_rndm, rndm);
221	return i;
222	}
223
224	// a simple point helper struct
225	struct point
226	{
227	short x;
228	short y;
229
230	point ()
231	{
232	}
233
234	point (int x, int y)
235	: x(x), y(y)
236	{
237	}
238	};
239
240	// something like a vector or stack, but without
241	// out of bounds checking
242	template<typename T>
243	struct fixed_stack
244	{
245	T *data;
246	int size;
247	int max;
248
249	fixed_stack ()
250	: size (0), data (0)
251	{
252	}
253
254	fixed_stack (int max)
255	: size (0), max (max)
256	{
257	data = salloc<T> (max);
258	}
259
260	void reset (int new_max)
261	{
262	sfree (data, max);
263	size = 0;
264	max = new_max;
265	data = salloc<T> (max);
266	}
267
268	void free ()
269	{
270	sfree (data, max);
271	data = 0;
272	}
273
274	~fixed_stack ()
275	{
276	sfree (data, max);
277	}
278
279	T &operator[](int idx)
280	{
281	return data [idx];
282	}
283
284	void push (T v)
285	{
286	data [size++] = v;
287	}
288
289	T &pop ()
290	{
291	return data [--size];
292	}
293
294	T remove (int idx)
295	{
296	T v = data [idx];
297
298	data [idx] = data [--size];
299
300	return v;
301	}
302	};
303
304	#endif
305