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.18 by root, Mon Apr 14 22:41:17 2008 UTC vs.
Revision 1.30 by root, Wed Jun 30 23:03:40 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 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
27#include "util.h" 28#include "util.h"
28 29
29struct random_map_params 30struct random_map_params : zero_initialised
30{ 31{
31 char wallstyle[512];
32 char wall_name[512]; 32 char wall_name[512];
33 char floorstyle[512];
34 char monsterstyle[512]; 33 char monsterstyle[512];
35 char treasurestyle[512];
36 char layoutstyle[512]; 34 char layoutstyle[512];
37 char doorstyle[512]; 35 char doorstyle[512];
38 char decorstyle[512];
39 shstr origin_map; 36 shstr origin_map;
40 shstr final_map; 37 shstr final_map;
41 char exitstyle[512];
42 shstr this_map; 38 shstr this_map;
43 char exit_on_final_map[512]; 39 char exit_on_final_map[512];
44 char *custom; 40
45
46 int xsize, ysize; 41 int xsize, ysize;
47 int expand2x; 42 int expand2x;
48 int layoutoptions1; 43 int layoutoptions1;
49 int layoutoptions2; 44 int layoutoptions2;
50 int layoutoptions3; 45 int layoutoptions3;
… …
54 float difficulty_increase; 49 float difficulty_increase;
55 50
56 int dungeon_level; 51 int dungeon_level;
57 int dungeon_depth; 52 int dungeon_depth;
58 53
59 int decoroptions;
60 int orientation; 54 int orientation;
55 int origin_x;
61 int origin_y; 56 int origin_y;
62 int origin_x;
63 uint32_t random_seed; 57 uint32_t random_seed;
64 uint64_t total_map_hp; 58 uint64_t total_map_hp;
65 int map_layout_style; 59 int map_layout_style;
66 int treasureoptions;
67 int symmetry_used; 60 int symmetry_used;
68 61
69 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); }
70 83
71 // "private", adjusted sizes 84 // "private", adjusted sizes
72 int Xsize; 85 int Xsize;
73 int Ysize; 86 int Ysize;
87
88 ~random_map_params ();
74}; 89};
75 90
76enum { 91enum {
77 LAYOUT_NONE, 92 LAYOUT_NONE,
78 LAYOUT_ONION, 93 LAYOUT_ONION,
79 LAYOUT_MAZE, 94 LAYOUT_MAZE,
80 LAYOUT_SPIRAL, 95 LAYOUT_SPIRAL,
81 LAYOUT_ROGUELIKE, 96 LAYOUT_ROGUELIKE,
82 LAYOUT_SNAKE, 97 LAYOUT_SNAKE,
83 LAYOUT_SQUARE_SPIRAL, 98 LAYOUT_SQUARE_SPIRAL,
99 LAYOUT_CAVE,
84 NROFLAYOUTS, 100 NROFLAYOUTS,
85}; 101};
86 102
87/* 103/*
88 * 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
… …
124// 12 has been experimentally :( determined ot be a lot more stable 140// 12 has been experimentally :( determined ot be a lot more stable
125// than 11 or 10, leading to the assumption that something inherently 141// than 11 or 10, leading to the assumption that something inherently
126// needs a minimum size of at least 12 142// needs a minimum size of at least 12
127#define MIN_RANDOM_MAP_SIZE 12 143#define MIN_RANDOM_MAP_SIZE 12
128 144
129struct MazeData : zero_initialised 145// reference
146//
147// \0 floor only
148// # wall
149// D door
150// < up
151// > down
152// C "center" (of onion layout)
153// . ?? (rogue)
154//
155
156// use this in new code
157struct LayoutData
130{ 158{
131 char **col; 159 char **col;
132 int w, h; 160 int w, h;
133 161
134 MazeData (int w, int h); 162 LayoutData (int w, int h);
135 ~MazeData (); 163 ~LayoutData ();
136 164
137 operator char **() 165 operator char **()
138 { 166 {
139 return col; 167 return col;
140 } 168 }
141 169
170 // for debugging, print layout to stdout
171 void print ();
172
173 // simple inpainting
174 void fill (char fill);
142 void clear (char fill = 0); 175 void clear () { fill (0); }
143 void border (char fill = '#'); 176 void border (char fill = '#');
144}; 177 void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
145 178
146struct Maze 179 void fill_rand (int perc);
180
181 // makes sure all areas are connected. dirty=true carves rounder but also
182 // more walls, dirty=false carves narrow corridors.
183 void isolation_remover (bool dirty = 0);
184
185 // generates a cave, subtype 0 is a rough cave, randomly open or closed
186 void gen_cave (int subtype);
187 void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
188
189 void swap (LayoutData &layout)
190 {
191 ::swap (layout.col, col);
192 ::swap (layout.w , w );
193 ::swap (layout.h , h );
194 }
195};
196
197// basically a layoutdata point - do not use in new code
198struct Layout
147{ 199{
148 MazeData *ptr; 200 LayoutData *ptr;
149 201
150 Maze () 202 Layout ()
151 { 203 {
152 } 204 }
153 205
154 Maze (int xsize, int ysize) 206 Layout (int xsize, int ysize)
155 : ptr (new MazeData (xsize, ysize)) 207 : ptr (new LayoutData (xsize, ysize))
156 { 208 {
157 } 209 }
158 210
159 Maze (random_map_params *RP) 211 Layout (random_map_params *RP)
160 : ptr (new MazeData (RP->Xsize, RP->Ysize)) 212 : ptr (new LayoutData (RP->Xsize, RP->Ysize))
161 { 213 {
162 } 214 }
163 215
164 void free () 216 void free ()
165 { 217 {
166 delete ptr; 218 delete ptr;
167 } 219 }
168 220
169 MazeData *operator ->() const 221 LayoutData *operator ->() const
170 { 222 {
171 return ptr; 223 return ptr;
172 } 224 }
173 225
174 operator char **() const 226 operator char **() const
175 { 227 {
176 return *ptr; 228 return *ptr;
177 } 229 }
178 230
179 void swap (Maze &maze) 231 void swap (Layout &layout)
180 { 232 {
181 MazeData *p = maze.ptr; 233 ::swap (layout.ptr, ptr);
182 maze.ptr = ptr; 234 }
183 ptr = p; 235};
236
237// utility functions, to use rmg_rndm instead of rndm.
238static inline int
239rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
240{
241 swap (rmg_rndm, rndm);
242 int i = find_free_spot (ob, m, x, y, start, stop);
243 swap (rmg_rndm, rndm);
244 return i;
245}
246
247// a simple point helper struct
248struct point
249{
250 short x;
251 short y;
252
253 point ()
254 {
255 }
256
257 point (int x, int y)
258 : x(x), y(y)
259 {
260 }
261};
262
263// something like a vector or stack, but without
264// out of bounds checking
265template<typename T>
266struct fixed_stack
267{
268 T *data;
269 int size;
270 int max;
271
272 fixed_stack ()
273 : size (0), data (0)
274 {
275 }
276
277 fixed_stack (int max)
278 : size (0), max (max)
279 {
280 data = salloc<T> (max);
281 }
282
283 void reset (int new_max)
284 {
285 sfree (data, max);
286 size = 0;
287 max = new_max;
288 data = salloc<T> (max);
289 }
290
291 void free ()
292 {
293 sfree (data, max);
294 data = 0;
295 }
296
297 ~fixed_stack ()
298 {
299 sfree (data, max);
300 }
301
302 T &operator[](int idx)
303 {
304 return data [idx];
305 }
306
307 void push (T v)
308 {
309 data [size++] = v;
310 }
311
312 T &pop ()
313 {
314 return data [--size];
315 }
316
317 T remove (int idx)
318 {
319 T v = data [idx];
320
321 data [idx] = data [--size];
322
323 return v;
184 } 324 }
185}; 325};
186 326
187#endif 327#endif
188 328

Diff Legend

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