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.16 by root, Thu Nov 8 19:43:25 2007 UTC vs.
Revision 1.29 by root, Wed Jun 30 20:51:02 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 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
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 char *custom; 40
43
44 int xsize, ysize; 41 int xsize, 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;
… …
52 float difficulty_increase; 49 float difficulty_increase;
53 50
54 int dungeon_level; 51 int dungeon_level;
55 int dungeon_depth; 52 int dungeon_depth;
56 53
57 int decoroptions;
58 int orientation; 54 int orientation;
55 int origin_x;
59 int origin_y; 56 int origin_y;
60 int origin_x;
61 uint32_t random_seed; 57 uint32_t random_seed;
62 uint64_t total_map_hp; 58 uint64_t total_map_hp;
63 int map_layout_style; 59 int map_layout_style;
64 int treasureoptions;
65 int symmetry_used; 60 int symmetry_used;
66 61
67 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); }
68 83
69 // "private", adjusted sizes 84 // "private", adjusted sizes
70 int Xsize; 85 int Xsize;
71 int Ysize; 86 int Ysize;
87
88 ~random_map_params ();
72}; 89};
73 90
74enum { 91enum {
75 LAYOUT_NONE, 92 LAYOUT_NONE,
76 LAYOUT_ONION, 93 LAYOUT_ONION,
… …
122// 12 has been experimentally :( determined ot be a lot more stable 139// 12 has been experimentally :( determined ot be a lot more stable
123// than 11 or 10, leading to the assumption that something inherently 140// than 11 or 10, leading to the assumption that something inherently
124// needs a minimum size of at least 12 141// needs a minimum size of at least 12
125#define MIN_RANDOM_MAP_SIZE 12 142#define MIN_RANDOM_MAP_SIZE 12
126 143
144// reference
145//
146// \0 floor only
147// # wall
148// D door
149// < up
150// > down
151// C "center" (of onion layout)
152// . ?? (rogue)
153//
154
155struct LayoutData
156{
157 char **col;
158 int w, h;
159
160 LayoutData (int w, int h);
161 ~LayoutData ();
162
163 operator char **()
164 {
165 return col;
166 }
167
168 void fill (char fill);
169 void clear () { fill (0); }
170 void border (char fill = '#');
171 void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
172
173 // makes sure all areas are connected. dirty=true carves rounder but also
174 // mroe walls, dirty=false carves narrow corridors.
175 void isolation_remover (bool dirty = 0);
176};
177
178struct Layout
179{
180 LayoutData *ptr;
181
182 Layout ()
183 {
184 }
185
186 Layout (int xsize, int ysize)
187 : ptr (new LayoutData (xsize, ysize))
188 {
189 }
190
191 Layout (random_map_params *RP)
192 : ptr (new LayoutData (RP->Xsize, RP->Ysize))
193 {
194 }
195
196 void free ()
197 {
198 delete ptr;
199 }
200
201 LayoutData *operator ->() const
202 {
203 return ptr;
204 }
205
206 operator char **() const
207 {
208 return *ptr;
209 }
210
211 void swap (const Layout &layout) const
212 {
213 ::swap (layout.ptr->col, ptr->col);
214 ::swap (layout.ptr->w , ptr->w );
215 ::swap (layout.ptr->h , ptr->h );
216 }
217
218 // for debugging, print layout to stdout
219 void print ();
220};
221
222// utility functions, to use rmg_rndm instead of rndm.
223static inline int
224rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
225{
226 swap (rmg_rndm, rndm);
227 int i = find_free_spot (ob, m, x, y, start, stop);
228 swap (rmg_rndm, rndm);
229 return i;
230}
231
232struct point
233{
234 short x;
235 short y;
236
237 point ()
238 {
239 }
240
241 point (int x, int y)
242 : x(x), y(y)
243 {
244 }
245};
246
247template<typename T>
248struct fixed_stack
249{
250 T *data;
251 int size;
252 int max;
253
254 fixed_stack ()
255 : size (0), data (0)
256 {
257 }
258
259 fixed_stack (int max)
260 : size (0), max (max)
261 {
262 data = salloc<T> (max);
263 }
264
265 void reset (int new_max)
266 {
267 sfree (data, max);
268 size = 0;
269 max = new_max;
270 data = salloc<T> (max);
271 }
272
273 void free ()
274 {
275 sfree (data, max);
276 data = 0;
277 }
278
279 ~fixed_stack ()
280 {
281 sfree (data, max);
282 }
283
284 T &operator[](int idx)
285 {
286 return data [idx];
287 }
288
289 void push (T v)
290 {
291 data [size++] = v;
292 }
293
294 T &pop ()
295 {
296 return data [--size];
297 }
298
299 T remove (int idx)
300 {
301 T v = data [idx];
302
303 data [idx] = data [--size];
304
305 return v;
306 }
307};
308
127#endif 309#endif
128 310

Diff Legend

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