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 |
char monsterstyle[512]; |
34 |
char layoutstyle[512]; |
35 |
char doorstyle[512]; |
36 |
shstr origin_map; |
37 |
shstr final_map; |
38 |
shstr this_map; |
39 |
char exit_on_final_map[512]; |
40 |
|
41 |
int xsize, ysize; |
42 |
int expand2x; |
43 |
int layoutoptions1; |
44 |
int layoutoptions2; |
45 |
int layoutoptions3; |
46 |
int symmetry; |
47 |
int difficulty; |
48 |
int difficulty_given; |
49 |
float difficulty_increase; |
50 |
|
51 |
int dungeon_level; |
52 |
int dungeon_depth; |
53 |
|
54 |
int orientation; |
55 |
int origin_x; |
56 |
int origin_y; |
57 |
uint32_t random_seed; |
58 |
uint64_t total_map_hp; |
59 |
int map_layout_style; |
60 |
int symmetry_used; |
61 |
|
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 (); |
89 |
}; |
90 |
|
91 |
enum { |
92 |
LAYOUT_NONE, |
93 |
LAYOUT_ONION, |
94 |
LAYOUT_MAZE, |
95 |
LAYOUT_SPIRAL, |
96 |
LAYOUT_ROGUELIKE, |
97 |
LAYOUT_SNAKE, |
98 |
LAYOUT_SQUARE_SPIRAL, |
99 |
LAYOUT_CAVE, |
100 |
NROFLAYOUTS, |
101 |
}; |
102 |
|
103 |
/* |
104 |
* Move these defines out of room_gen_onion.c to here, as |
105 |
* other files (like square_spiral) also uses them. |
106 |
|
107 |
options: |
108 |
0 Pick random options below |
109 |
1 "centered" |
110 |
2 linear doors (default is nonlinear) |
111 |
4 bottom "centered" |
112 |
8 bottom-right centered |
113 |
16 irregularly/randomly spaced layers (default: regular) |
114 |
32 outer wall off: i.e., no outer wall. |
115 |
|
116 |
*/ |
117 |
|
118 |
enum { |
119 |
RMOPT_RANDOM = 0, |
120 |
RMOPT_CENTERED = 1, |
121 |
RMOPT_LINEAR = 2, |
122 |
RMOPT_BOTTOM_C = 4, |
123 |
RMOPT_BOTTOM_R = 8, |
124 |
RMOPT_IRR_SPACE = 16, |
125 |
RMOPT_WALL_OFF = 32, |
126 |
RMOPT_WALLS_ONLY = 64, |
127 |
RMOPT_NO_DOORS = 256, /* Place walls insead of doors. Produces broken map. */ |
128 |
}; |
129 |
|
130 |
/* symmetry definitions--used in this file AND in treasure.c: |
131 |
the numerical values matter so don't change them. */ |
132 |
enum { |
133 |
SYMMETRY_RANDOM, |
134 |
SYMMETRY_NONE, |
135 |
SYMMETRY_X, |
136 |
SYMMETRY_Y, |
137 |
SYMMETRY_XY, |
138 |
}; |
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 |
143 |
#define MIN_RANDOM_MAP_SIZE 12 |
144 |
|
145 |
// we often use signed chars for coordinates (and U8 for distances) |
146 |
#define MAX_RANDOM_MAP_SIZE 120 |
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 |
160 |
INTERFACE_CLASS(layout) |
161 |
struct layout |
162 |
{ |
163 |
char **col; |
164 |
int w, h; |
165 |
|
166 |
layout (int w, int h); |
167 |
~layout (); |
168 |
|
169 |
operator char **() const |
170 |
{ |
171 |
return col; |
172 |
} |
173 |
|
174 |
void swap (layout &maze) |
175 |
{ |
176 |
::swap (maze.col, col); |
177 |
::swap (maze.w , w ); |
178 |
::swap (maze.h , h ); |
179 |
} |
180 |
|
181 |
// for debugging, print maze to stdout |
182 |
MTH void print () const; |
183 |
|
184 |
// simple inpainting |
185 |
MTH void fill (char fill); |
186 |
MTH void clear () { fill (0); } |
187 |
MTH void border (char fill = '#'); |
188 |
MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
189 |
|
190 |
MTH void fill_rand (int perc); |
191 |
|
192 |
// makes sure all areas are connected. dirty=true carves rounder but also |
193 |
// more walls, dirty=false carves narrow corridors. |
194 |
MTH void isolation_remover (bool dirty = 0); |
195 |
|
196 |
// generates a cave, subtype 0 is a rough cave, randomly open or closed |
197 |
MTH void gen_cave (int subtype); |
198 |
|
199 |
// helper functions to modify the maze |
200 |
MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1); |
201 |
MTH void doorify (); |
202 |
MTH void roomify (); // make some rooms in it, works best on onions |
203 |
MTH void expand2x (); |
204 |
MTH void symmetrize (int symmetry); |
205 |
MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees |
206 |
|
207 |
void generate (random_map_params *RP); |
208 |
}; |
209 |
|
210 |
// utility functions, to use rmg_rndm instead of rndm. |
211 |
static inline int |
212 |
rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
213 |
{ |
214 |
swap (rmg_rndm, rndm); |
215 |
int i = find_free_spot (ob, m, x, y, start, stop); |
216 |
swap (rmg_rndm, rndm); |
217 |
return i; |
218 |
} |
219 |
|
220 |
// a simple point helper struct |
221 |
struct point |
222 |
{ |
223 |
short x; |
224 |
short y; |
225 |
|
226 |
point () |
227 |
{ |
228 |
} |
229 |
|
230 |
point (int x, int y) |
231 |
: x(x), y(y) |
232 |
{ |
233 |
} |
234 |
}; |
235 |
|
236 |
// something like a vector or stack, but without |
237 |
// out of bounds checking |
238 |
template<typename T> |
239 |
struct fixed_stack |
240 |
{ |
241 |
T *data; |
242 |
int size; |
243 |
int max; |
244 |
|
245 |
fixed_stack () |
246 |
: size (0), data (0) |
247 |
{ |
248 |
} |
249 |
|
250 |
fixed_stack (int max) |
251 |
: size (0), max (max) |
252 |
{ |
253 |
data = salloc<T> (max); |
254 |
} |
255 |
|
256 |
void reset (int new_max) |
257 |
{ |
258 |
sfree (data, max); |
259 |
size = 0; |
260 |
max = new_max; |
261 |
data = salloc<T> (max); |
262 |
} |
263 |
|
264 |
void free () |
265 |
{ |
266 |
sfree (data, max); |
267 |
data = 0; |
268 |
} |
269 |
|
270 |
~fixed_stack () |
271 |
{ |
272 |
sfree (data, max); |
273 |
} |
274 |
|
275 |
T &operator[](int idx) |
276 |
{ |
277 |
return data [idx]; |
278 |
} |
279 |
|
280 |
void push (T v) |
281 |
{ |
282 |
data [size++] = v; |
283 |
} |
284 |
|
285 |
T &pop () |
286 |
{ |
287 |
return data [--size]; |
288 |
} |
289 |
|
290 |
T remove (int idx) |
291 |
{ |
292 |
T v = data [idx]; |
293 |
|
294 |
data [idx] = data [--size]; |
295 |
|
296 |
return v; |
297 |
} |
298 |
}; |
299 |
|
300 |
#endif |
301 |
|