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.7 by root, Sun Dec 31 20:46:17 2006 UTC vs.
Revision 1.35 by root, Fri Jul 2 15:43:37 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 (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
5 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
6 * 7 *
7 * 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
8 * 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
9 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 * (at your option) any later version. 11 * option) any later version.
11 * 12 *
12 * 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,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details. 16 * GNU General Public License for more details.
16 * 17 *
17 * 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
18 * 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
19 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * 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>
22 */ 23 */
23 24
24#ifndef RANDOM_MAP_H 25#ifndef RANDOM_MAP_H
25#define RANDOM_MAP_H 26#define RANDOM_MAP_H
26 27
27struct random_map_params 28#include "util.h"
29
30struct random_map_params : zero_initialised
28{ 31{
29 char wallstyle[512];
30 char wall_name[512]; 32 char wall_name[512];
31 char floorstyle[512];
32 char monsterstyle[512]; 33 char monsterstyle[512];
33 char treasurestyle[512];
34 char layoutstyle[512]; 34 char layoutstyle[512];
35 char doorstyle[512]; 35 char doorstyle[512];
36 char decorstyle[512];
37 shstr origin_map; 36 shstr origin_map;
38 shstr final_map; 37 shstr final_map;
39 char exitstyle[512];
40 shstr this_map; 38 shstr this_map;
41 char exit_on_final_map[512]; 39 char exit_on_final_map[512];
42 40
43 int Xsize; 41 int xsize, ysize;
44 int Ysize;
45 int expand2x; 42 int expand2x;
46 int layoutoptions1; 43 int layoutoptions1;
47 int layoutoptions2; 44 int layoutoptions2;
48 int layoutoptions3; 45 int layoutoptions3;
49 int symmetry; 46 int symmetry;
50 int difficulty; 47 int difficulty;
51 int difficulty_given; 48 int difficulty_given;
52 float difficulty_increase; 49 float difficulty_increase;
50
53 int dungeon_level; 51 int dungeon_level;
54 int dungeon_depth; 52 int dungeon_depth;
55 int decoroptions; 53
56 int orientation; 54 int orientation;
55 int origin_x;
57 int origin_y; 56 int origin_y;
58 int origin_x;
59 int random_seed; 57 uint32_t random_seed;
60 uint64_t total_map_hp; 58 uint64_t total_map_hp;
61 int map_layout_style; 59 int map_layout_style;
62 int treasureoptions;
63 int symmetry_used; 60 int symmetry_used;
64 61
65 struct region *region; 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 ();
66}; 89};
67 90
68enum { 91enum {
69 LAYOUT_NONE, 92 LAYOUT_NONE,
70 LAYOUT_ONION, 93 LAYOUT_ONION,
71 LAYOUT_MAZE, 94 LAYOUT_MAZE,
72 LAYOUT_SPIRAL, 95 LAYOUT_SPIRAL,
73 LAYOUT_ROGUELIKE, 96 LAYOUT_ROGUELIKE,
74 LAYOUT_SNAKE, 97 LAYOUT_SNAKE,
75 LAYOUT_SQUARE_SPIRAL, 98 LAYOUT_SQUARE_SPIRAL,
99 LAYOUT_CAVE,
76 NROFLAYOUTS, 100 NROFLAYOUTS,
77}; 101};
78 102
79/* 103/*
80 * Move these defines out of room_gen_onion.c to here, as 104 * Move these defines out of room_gen_onion.c to here, as
… …
111 SYMMETRY_X, 135 SYMMETRY_X,
112 SYMMETRY_Y, 136 SYMMETRY_Y,
113 SYMMETRY_XY, 137 SYMMETRY_XY,
114}; 138};
115 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
116#define MIN_RANDOM_MAP_SIZE 10 143#define MIN_RANDOM_MAP_SIZE 12
117 144
118/* a macro to get a strongly centered random distribution, 145// we often use signed chars for coordinates (and U8 for distances)
119 from 0 to x, centered at x/2 */ 146#define MAX_RANDOM_MAP_SIZE 120
120#define BC_RANDOM(x) ((int) ((RANDOM() % (x)+RANDOM()%(x)+RANDOM()%(x))/3.)) 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
160INTERFACE_CLASS(layout)
161struct 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.
215static inline int
216rmg_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
225struct 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
242template<typename T>
243struct 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};
121 303
122#endif 304#endif
123 305

Diff Legend

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