ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/random_map.h
(Generate patch)

Comparing deliantra/server/random_maps/random_map.h (file contents):
Revision 1.10 by root, Thu Jan 11 00:41:08 2007 UTC vs.
Revision 1.41 by root, Sat Jul 3 03:09:27 2010 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at crossfire@schmorp.de 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#ifndef RANDOM_MAP_H 25#ifndef RANDOM_MAP_H
26#define RANDOM_MAP_H 26#define RANDOM_MAP_H
27 27
28struct random_map_params 28#include "util.h"
29
30struct random_map_params : zero_initialised
29{ 31{
30 char wallstyle[512];
31 char wall_name[512]; 32 char wall_name[512];
32 char floorstyle[512]; 33
33 char monsterstyle[512]; 34 int xsize, ysize;
34 char treasurestyle[512];
35 char layoutstyle[512];
36 char doorstyle[512];
37 char decorstyle[512];
38 shstr origin_map;
39 shstr final_map;
40 char exitstyle[512];
41 shstr this_map;
42 char exit_on_final_map[512];
43 char *custom;
44
45 int Xsize;
46 int Ysize;
47 int expand2x; 35 int expand2x;
48 int layoutoptions1; 36 int layoutoptions1;
49 int layoutoptions2; 37 int layoutoptions2;
50 int layoutoptions3; 38 int layoutoptions3;
51 int symmetry; 39 int symmetry;
… …
54 float difficulty_increase; 42 float difficulty_increase;
55 43
56 int dungeon_level; 44 int dungeon_level;
57 int dungeon_depth; 45 int dungeon_depth;
58 46
59 int decoroptions;
60 int orientation; 47 int orientation;
61 int origin_y;
62 int origin_x;
63 int random_seed; 48 uint32_t random_seed;
64 uint64_t total_map_hp; 49 uint64_t total_map_hp;
65 int map_layout_style; 50 int map_layout_style;
66 int treasureoptions;
67 int symmetry_used; 51 int symmetry_used;
68 52
69 struct region *region; 53 HV *hv;
54
55 shstr_tmp as_shstr () const;
56
57 // fetch something from the options hash
58 SV *get_sv (const char *option) const;
59 const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const;
60 IV get_iv (const char *option, IV fallback = 0) const;
61 UV get_uv (const char *option, UV fallback = 0) const;
62 NV get_nv (const char *option, NV fallback = 0) const;
63
64 void set (const char *option, SV *value) const;
65 void set (const char *option, const_utf8_string value) const;
66 void set (const char *option, IV value) const;
67 void set (const char *option, UV value) const;
68 void set (const char *option, NV value) const;
69
70 void set (const char *option, int value) const { set (option, (IV)value); }
71
72 // "private", adjusted sizes
73 int Xsize;
74 int Ysize;
75
76 random_map_params ();
77 random_map_params (random_map_params *RP);
78 random_map_params (HV *hv);
79 ~random_map_params ();
70}; 80};
71 81
72enum { 82enum {
73 LAYOUT_NONE, 83 LAYOUT_NONE,
74 LAYOUT_ONION, 84 LAYOUT_ONION,
75 LAYOUT_MAZE, 85 LAYOUT_MAZE,
76 LAYOUT_SPIRAL, 86 LAYOUT_SPIRAL,
77 LAYOUT_ROGUELIKE, 87 LAYOUT_ROGUELIKE,
78 LAYOUT_SNAKE, 88 LAYOUT_SNAKE,
79 LAYOUT_SQUARE_SPIRAL, 89 LAYOUT_SQUARE_SPIRAL,
90 LAYOUT_CAVE,
91 LAYOUT_MULTIPLE,
80 NROFLAYOUTS, 92 NROFLAYOUTS,
81}; 93};
82 94
83/* 95/*
84 * Move these defines out of room_gen_onion.c to here, as 96 * Move these defines out of room_gen_onion.c to here, as
… …
115 SYMMETRY_X, 127 SYMMETRY_X,
116 SYMMETRY_Y, 128 SYMMETRY_Y,
117 SYMMETRY_XY, 129 SYMMETRY_XY,
118}; 130};
119 131
132// 12 has been experimentally :( determined ot be a lot more stable
133// than 11 or 10, leading to the assumption that something inherently
134// needs a minimum size of at least 12
120#define MIN_RANDOM_MAP_SIZE 10 135#define MIN_RANDOM_MAP_SIZE 12
121 136
122/* a macro to get a strongly centered random distribution, 137// we often use signed chars for coordinates (and U8 for distances)
123 from 0 to x, centered at x/2 */ 138#define MAX_RANDOM_MAP_SIZE 120
124#define BC_RANDOM(x) ((int) ((RANDOM() % (x)+RANDOM()%(x)+RANDOM()%(x))/3.)) 139
140// reference
141//
142// \0 floor only
143// # wall
144// D door
145// < up
146// > down
147// C "center" (of onion maze)
148// . ?? (rogue)
149//
150
151// use this in new code
152INTERFACE_CLASS(layout)
153struct layout
154{
155 typedef char cell;
156
157 cell **data;
158 int w, h;
159
160 layout (int w, int h);
161 layout (layout &copy);
162
163 // reference rect in other layout - will not keep the data alive,
164 // so never swap with it's orig, or free the orig when in use.
165 layout (layout &orig, int x1, int y1, int x2, int y2);
166
167 ~layout ();
168
169 operator cell **() const
170 {
171 return data;
172 }
173
174 void swap (layout &maze)
175 {
176 ::swap (maze.data, data);
177 ::swap (maze.w , w );
178 ::swap (maze.h , h );
179 ::swap (maze.size, size);
180 }
181
182 MTH void swap (layout *maze) { swap (*maze); }
183
184 // for debugging, print maze to stdout
185 MTH void print () const;
186
187 // simple inpainting
188 MTH void fill (char fill);
189 MTH void clear () { fill (0); }
190 MTH void border (char fill = '#');
191 MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
192 MTH void fill_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
197 MTH void isolation_remover ();
198
199 // generates a cave, subtype 0 is a rough cave, randomly open or closed
200 MTH void gen_cave (int subtype);
201
202 // helper functions to modify the maze
203 MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
204 MTH void doorify ();
205 MTH void roomify (); // make some rooms in it, works best on onions
206 MTH void expand2x ();
207 MTH void symmetrize (int symmetry);
208 MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
209
210 void generate (random_map_params *RP);
211private:
212 int size;
213 void alloc (int w, int h);
214};
215
216// utility functions, to use rmg_rndm instead of rndm.
217static inline int
218rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
219{
220 swap (rmg_rndm, rndm);
221 int i = find_free_spot (ob, m, x, y, start, stop);
222 swap (rmg_rndm, rndm);
223 return i;
224}
225
226// a simple point helper struct
227struct point
228{
229 short x;
230 short y;
231
232 point ()
233 {
234 }
235
236 point (int x, int y)
237 : x(x), y(y)
238 {
239 }
240};
241
242// something like a vector or stack, but without
243// out of bounds checking
244template<typename T>
245struct fixed_stack
246{
247 T *data;
248 int size;
249 int max;
250
251 fixed_stack ()
252 : size (0), data (0)
253 {
254 }
255
256 fixed_stack (int max)
257 : size (0), max (max)
258 {
259 data = salloc<T> (max);
260 }
261
262 void reset (int new_max)
263 {
264 sfree (data, max);
265 size = 0;
266 max = new_max;
267 data = salloc<T> (max);
268 }
269
270 void free ()
271 {
272 sfree (data, max);
273 data = 0;
274 }
275
276 ~fixed_stack ()
277 {
278 sfree (data, max);
279 }
280
281 T &operator[](int idx)
282 {
283 return data [idx];
284 }
285
286 void push (T v)
287 {
288 data [size++] = v;
289 }
290
291 T &pop ()
292 {
293 return data [--size];
294 }
295
296 T remove (int idx)
297 {
298 T v = data [idx];
299
300 data [idx] = data [--size];
301
302 return v;
303 }
304};
125 305
126#endif 306#endif
127 307

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines