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.19 by root, Tue Apr 15 03:00:24 2008 UTC vs.
Revision 1.39 by root, Sat Jul 3 01:49:18 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]; 33
34 char monsterstyle[512];
35 char treasurestyle[512];
36 char layoutstyle[512];
37 char doorstyle[512];
38 char decorstyle[512];
39 shstr origin_map;
40 shstr final_map;
41 char exitstyle[512];
42 shstr this_map;
43 char exit_on_final_map[512];
44 char *custom;
45
46 int xsize, ysize; 34 int xsize, 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;
… …
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 uint32_t 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 void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv })
55
56 shstr_tmp as_shstr () const;
57
58 // fetch something from the options hash
59 SV *get_sv (const char *option) const;
60 const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const;
61 IV get_iv (const char *option, IV fallback = 0) const;
62 UV get_uv (const char *option, UV fallback = 0) const;
63 NV get_nv (const char *option, NV fallback = 0) const;
64
65 void set (const char *option, SV *value) const;
66 void set (const char *option, const_utf8_string value) const;
67 void set (const char *option, IV value) const;
68 void set (const char *option, UV value) const;
69 void set (const char *option, NV value) const;
70
71 void set (const char *option, int value) const { set (option, (IV)value); }
70 72
71 // "private", adjusted sizes 73 // "private", adjusted sizes
72 int Xsize; 74 int Xsize;
73 int Ysize; 75 int Ysize;
76
77 random_map_params ();
78 random_map_params (HV *hv);
79 ~random_map_params ();
74}; 80};
75 81
76enum { 82enum {
77 LAYOUT_NONE, 83 LAYOUT_NONE,
78 LAYOUT_ONION, 84 LAYOUT_ONION,
79 LAYOUT_MAZE, 85 LAYOUT_MAZE,
80 LAYOUT_SPIRAL, 86 LAYOUT_SPIRAL,
81 LAYOUT_ROGUELIKE, 87 LAYOUT_ROGUELIKE,
82 LAYOUT_SNAKE, 88 LAYOUT_SNAKE,
83 LAYOUT_SQUARE_SPIRAL, 89 LAYOUT_SQUARE_SPIRAL,
90 LAYOUT_CAVE,
84 NROFLAYOUTS, 91 NROFLAYOUTS,
85}; 92};
86 93
87/* 94/*
88 * Move these defines out of room_gen_onion.c to here, as 95 * Move these defines out of room_gen_onion.c to here, as
… …
124// 12 has been experimentally :( determined ot be a lot more stable 131// 12 has been experimentally :( determined ot be a lot more stable
125// than 11 or 10, leading to the assumption that something inherently 132// than 11 or 10, leading to the assumption that something inherently
126// needs a minimum size of at least 12 133// needs a minimum size of at least 12
127#define MIN_RANDOM_MAP_SIZE 12 134#define MIN_RANDOM_MAP_SIZE 12
128 135
129struct LayoutData : zero_initialised 136// we often use signed chars for coordinates (and U8 for distances)
137#define MAX_RANDOM_MAP_SIZE 120
138
139// reference
140//
141// \0 floor only
142// # wall
143// D door
144// < up
145// > down
146// C "center" (of onion maze)
147// . ?? (rogue)
148//
149
150// use this in new code
151INTERFACE_CLASS(layout)
152struct layout
130{ 153{
131 char **col; 154 typedef char cell;
155
156 cell **data;
132 int w, h; 157 int w, h;
133 158
134 LayoutData (int w, int h); 159 layout (int w, int h);
160 layout (layout &copy);
135 ~LayoutData (); 161 ~layout ();
136 162
137 operator char **() 163 operator cell **() const
138 { 164 {
139 return col; 165 return data;
140 } 166 }
141 167
142 void clear (char fill = 0); 168 void swap (layout &maze)
169 {
170 ::swap (maze.data, data);
171 ::swap (maze.w , w );
172 ::swap (maze.h , h );
173 }
174
175 MTH void swap (layout *maze) { swap (*maze); }
176
177 // for debugging, print maze to stdout
178 MTH void print () const;
179
180 // simple inpainting
181 MTH void fill (char fill);
182 MTH void clear () { fill (0); }
143 void border (char fill = '#'); 183 MTH void border (char fill = '#');
144}; 184 MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
185 MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive
145 186
146struct Layout 187 MTH void fill_rand (int perc);
147{
148 LayoutData *ptr;
149 188
150 Layout () 189 // makes sure all areas are connected
151 { 190 MTH void isolation_remover ();
152 }
153 191
154 Layout (int xsize, int ysize) 192 // generates a cave, subtype 0 is a rough cave, randomly open or closed
155 : ptr (new LayoutData (xsize, ysize)) 193 MTH void gen_cave (int subtype);
156 {
157 }
158 194
195 // helper functions to modify the maze
196 MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1);
197 MTH void doorify ();
198 MTH void roomify (); // make some rooms in it, works best on onions
199 MTH void expand2x ();
200 MTH void symmetrize (int symmetry);
201 MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees
202
159 Layout (random_map_params *RP) 203 void generate (random_map_params *RP);
160 : ptr (new LayoutData (RP->Xsize, RP->Ysize)) 204private:
205 void alloc (int w, int h);
206};
207
208// utility functions, to use rmg_rndm instead of rndm.
209static inline int
210rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
211{
212 swap (rmg_rndm, rndm);
213 int i = find_free_spot (ob, m, x, y, start, stop);
214 swap (rmg_rndm, rndm);
215 return i;
216}
217
218// a simple point helper struct
219struct point
220{
221 short x;
222 short y;
223
224 point ()
161 { 225 {
226 }
227
228 point (int x, int y)
229 : x(x), y(y)
230 {
231 }
232};
233
234// something like a vector or stack, but without
235// out of bounds checking
236template<typename T>
237struct fixed_stack
238{
239 T *data;
240 int size;
241 int max;
242
243 fixed_stack ()
244 : size (0), data (0)
245 {
246 }
247
248 fixed_stack (int max)
249 : size (0), max (max)
250 {
251 data = salloc<T> (max);
252 }
253
254 void reset (int new_max)
255 {
256 sfree (data, max);
257 size = 0;
258 max = new_max;
259 data = salloc<T> (max);
162 } 260 }
163 261
164 void free () 262 void free ()
165 { 263 {
166 delete ptr; 264 sfree (data, max);
265 data = 0;
167 } 266 }
168 267
169 LayoutData *operator ->() const 268 ~fixed_stack ()
170 { 269 {
270 sfree (data, max);
271 }
272
273 T &operator[](int idx)
274 {
275 return data [idx];
276 }
277
278 void push (T v)
279 {
280 data [size++] = v;
281 }
282
283 T &pop ()
284 {
285 return data [--size];
286 }
287
288 T remove (int idx)
289 {
290 T v = data [idx];
291
292 data [idx] = data [--size];
293
171 return ptr; 294 return v;
172 }
173
174 operator char **() const
175 {
176 return *ptr;
177 }
178
179 void swap (const Layout &layout) const
180 {
181 ::swap (layout.ptr->col, ptr->col);
182 ::swap (layout.ptr->w , ptr->w );
183 ::swap (layout.ptr->h , ptr->h );
184 } 295 }
185}; 296};
186 297
187#endif 298#endif
188 299

Diff Legend

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