1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
* Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (©) 1992 Frank Tore Johansen |
7 |
* |
8 |
* Deliantra is free software: you can redistribute it and/or modify it under |
9 |
* the terms of the Affero GNU General Public License as published by the |
10 |
* Free Software Foundation, either version 3 of the License, or (at your |
11 |
* option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
18 |
* You should have received a copy of the Affero GNU General Public License |
19 |
* and the GNU General Public License along with this program. If not, see |
20 |
* <http://www.gnu.org/licenses/>. |
21 |
* |
22 |
* The authors can be reached via e-mail to <support@deliantra.net> |
23 |
*/ |
24 |
|
25 |
#ifndef RANDOM_MAP_H |
26 |
#define RANDOM_MAP_H |
27 |
|
28 |
#include "util.h" |
29 |
|
30 |
struct random_map_params : zero_initialised |
31 |
{ |
32 |
char wall_name[512]; |
33 |
|
34 |
int xsize, ysize; |
35 |
int expand2x; |
36 |
int layoutoptions1; |
37 |
int layoutoptions2; |
38 |
int layoutoptions3; |
39 |
int symmetry; |
40 |
int difficulty; |
41 |
int difficulty_given; |
42 |
float difficulty_increase; |
43 |
|
44 |
int dungeon_level; |
45 |
int dungeon_depth; |
46 |
|
47 |
int orientation; |
48 |
uint32_t random_seed; |
49 |
uint64_t total_map_hp; |
50 |
int map_layout_style; |
51 |
int symmetry_used; |
52 |
|
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 (); |
80 |
}; |
81 |
|
82 |
enum { |
83 |
LAYOUT_NONE, |
84 |
LAYOUT_ONION, |
85 |
LAYOUT_MAZE, |
86 |
LAYOUT_SPIRAL, |
87 |
LAYOUT_ROGUELIKE, |
88 |
LAYOUT_SNAKE, |
89 |
LAYOUT_SQUARE_SPIRAL, |
90 |
LAYOUT_CAVE, |
91 |
LAYOUT_CASTLE, |
92 |
LAYOUT_MULTIPLE, |
93 |
NROFLAYOUTS, |
94 |
}; |
95 |
|
96 |
/* |
97 |
* Move these defines out of room_gen_onion.c to here, as |
98 |
* other files (like square_spiral) also uses them. |
99 |
|
100 |
options: |
101 |
0 Pick random options below |
102 |
1 "centered" |
103 |
2 linear doors (default is nonlinear) |
104 |
4 bottom "centered" |
105 |
8 bottom-right centered |
106 |
16 irregularly/randomly spaced layers (default: regular) |
107 |
32 outer wall off: i.e., no outer wall. |
108 |
|
109 |
*/ |
110 |
|
111 |
enum { |
112 |
RMOPT_RANDOM = 0, |
113 |
RMOPT_CENTERED = 1, |
114 |
RMOPT_LINEAR = 2, |
115 |
RMOPT_BOTTOM_C = 4, |
116 |
RMOPT_BOTTOM_R = 8, |
117 |
RMOPT_IRR_SPACE = 16, |
118 |
RMOPT_WALL_OFF = 32, |
119 |
RMOPT_WALLS_ONLY = 64, |
120 |
RMOPT_NO_DOORS = 256, /* Place walls insead of doors. Produces broken map. */ |
121 |
}; |
122 |
|
123 |
/* symmetry definitions--used in this file AND in treasure.c: |
124 |
the numerical values matter so don't change them. */ |
125 |
enum { |
126 |
SYMMETRY_RANDOM, |
127 |
SYMMETRY_NONE, |
128 |
SYMMETRY_X, |
129 |
SYMMETRY_Y, |
130 |
SYMMETRY_XY, |
131 |
}; |
132 |
|
133 |
// 12 has been experimentally :( determined ot be a lot more stable |
134 |
// than 11 or 10, leading to the assumption that something inherently |
135 |
// needs a minimum size of at least 12 |
136 |
#define MIN_RANDOM_MAP_SIZE 12 |
137 |
|
138 |
// we often use signed chars for coordinates (and U8 for distances) |
139 |
#define MAX_RANDOM_MAP_SIZE 120 |
140 |
|
141 |
// reference |
142 |
// |
143 |
// \0 floor only |
144 |
// # wall |
145 |
// D door |
146 |
// < up |
147 |
// > down |
148 |
// C "center" (of onion maze) |
149 |
// . ?? (rogue) |
150 |
// |
151 |
|
152 |
// use this in new code |
153 |
INTERFACE_CLASS(layout) |
154 |
struct layout |
155 |
{ |
156 |
typedef char cell; |
157 |
|
158 |
cell **data; |
159 |
int w, h; |
160 |
|
161 |
layout (int w, int h); |
162 |
layout (layout ©); |
163 |
|
164 |
// reference rect in other layout - will not keep the data alive, |
165 |
// so never swap with it's orig, or free the orig when in use. |
166 |
layout (layout &orig, int x1, int y1, int x2, int y2); |
167 |
|
168 |
~layout (); |
169 |
|
170 |
operator cell **() const |
171 |
{ |
172 |
return data; |
173 |
} |
174 |
|
175 |
void swap (layout &maze) |
176 |
{ |
177 |
::swap (maze.data, data); |
178 |
::swap (maze.w , w ); |
179 |
::swap (maze.h , h ); |
180 |
::swap (maze.size, size); |
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 |
MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
194 |
|
195 |
MTH void fill_rand (int perc); |
196 |
|
197 |
// makes sure all areas are connected |
198 |
// perturb = 0 - very horz/vert tunnels |
199 |
// perturb = 1 - straight but round |
200 |
// perturb = 2 - snaky tunnels |
201 |
MTH void isolation_remover (int perturb = 2); |
202 |
|
203 |
// generates a cave, subtype 0 is a rough cave, randomly open or closed |
204 |
MTH void gen_cave (int subtype); |
205 |
MTH void gen_castle (); // generates straightish structures |
206 |
|
207 |
// helper functions to modify the maze |
208 |
MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1); |
209 |
MTH void doorify (); |
210 |
MTH void roomify (); // make some rooms in it, works best on onions |
211 |
MTH void expand2x (); |
212 |
MTH void symmetrize (int symmetry); |
213 |
MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees |
214 |
|
215 |
void generate (random_map_params *RP); |
216 |
private: |
217 |
int size; |
218 |
void alloc (int w, int h); |
219 |
}; |
220 |
|
221 |
// utility functions, to use rmg_rndm instead of rndm. |
222 |
static inline int |
223 |
rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
224 |
{ |
225 |
swap (rmg_rndm, rndm); |
226 |
int i = find_free_spot (ob, m, x, y, start, stop); |
227 |
swap (rmg_rndm, rndm); |
228 |
return i; |
229 |
} |
230 |
|
231 |
// a simple point helper struct |
232 |
struct point |
233 |
{ |
234 |
int x; |
235 |
int y; |
236 |
|
237 |
point () |
238 |
{ |
239 |
} |
240 |
|
241 |
point (int x, int y) |
242 |
: x(x), y(y) |
243 |
{ |
244 |
} |
245 |
}; |
246 |
|
247 |
// something like a vector or stack, but without |
248 |
// out of bounds checking |
249 |
template<typename T> |
250 |
struct fixed_stack |
251 |
{ |
252 |
T *data; |
253 |
int size; |
254 |
int max; |
255 |
|
256 |
fixed_stack () |
257 |
: size (0), data (0) |
258 |
{ |
259 |
} |
260 |
|
261 |
fixed_stack (int max) |
262 |
: size (0), max (max) |
263 |
{ |
264 |
data = salloc<T> (max); |
265 |
} |
266 |
|
267 |
void reset (int new_max) |
268 |
{ |
269 |
sfree (data, max); |
270 |
size = 0; |
271 |
max = new_max; |
272 |
data = salloc<T> (max); |
273 |
} |
274 |
|
275 |
void free () |
276 |
{ |
277 |
sfree (data, max); |
278 |
data = 0; |
279 |
} |
280 |
|
281 |
~fixed_stack () |
282 |
{ |
283 |
sfree (data, max); |
284 |
} |
285 |
|
286 |
T &operator[](int idx) |
287 |
{ |
288 |
return data [idx]; |
289 |
} |
290 |
|
291 |
void push (T v) |
292 |
{ |
293 |
data [size++] = v; |
294 |
} |
295 |
|
296 |
T &pop () |
297 |
{ |
298 |
return data [--size]; |
299 |
} |
300 |
|
301 |
T remove (int idx) |
302 |
{ |
303 |
T v = data [idx]; |
304 |
|
305 |
data [idx] = data [--size]; |
306 |
|
307 |
return v; |
308 |
} |
309 |
}; |
310 |
|
311 |
#endif |
312 |
|