1 |
root |
1.1 |
/* |
2 |
root |
1.16 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
root |
1.14 |
* |
4 |
root |
1.23 |
* Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
root |
1.22 |
* Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 |
|
|
* Copyright (©) 1992 Frank Tore Johansen |
7 |
root |
1.14 |
* |
8 |
root |
1.21 |
* 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 |
root |
1.14 |
* |
13 |
root |
1.15 |
* 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 |
root |
1.14 |
* |
18 |
root |
1.21 |
* 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 |
root |
1.14 |
* |
22 |
root |
1.16 |
* The authors can be reached via e-mail to <support@deliantra.net> |
23 |
root |
1.1 |
*/ |
24 |
|
|
|
25 |
|
|
#ifndef RANDOM_MAP_H |
26 |
|
|
#define RANDOM_MAP_H |
27 |
|
|
|
28 |
root |
1.17 |
#include "util.h" |
29 |
|
|
|
30 |
root |
1.25 |
struct random_map_params : zero_initialised |
31 |
root |
1.6 |
{ |
32 |
root |
1.1 |
char wall_name[512]; |
33 |
root |
1.26 |
|
34 |
root |
1.11 |
int xsize, ysize; |
35 |
root |
1.1 |
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 |
root |
1.8 |
|
44 |
root |
1.1 |
int dungeon_level; |
45 |
|
|
int dungeon_depth; |
46 |
root |
1.8 |
|
47 |
root |
1.1 |
int orientation; |
48 |
root |
1.12 |
uint32_t random_seed; |
49 |
root |
1.6 |
uint64_t total_map_hp; |
50 |
root |
1.1 |
int map_layout_style; |
51 |
|
|
int symmetry_used; |
52 |
root |
1.6 |
|
53 |
root |
1.26 |
HV *hv; |
54 |
root |
1.28 |
void hv_clone (); // replaces the hv by a clone'd copy (%new_hv = { %hv }) |
55 |
|
|
|
56 |
|
|
shstr_tmp as_shstr () const; |
57 |
root |
1.26 |
|
58 |
|
|
// fetch something from the options hash |
59 |
root |
1.28 |
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 |
root |
1.26 |
|
71 |
root |
1.28 |
void set (const char *option, int value) const { set (option, (IV)value); } |
72 |
root |
1.26 |
|
73 |
root |
1.11 |
// "private", adjusted sizes |
74 |
|
|
int Xsize; |
75 |
|
|
int Ysize; |
76 |
root |
1.26 |
|
77 |
root |
1.39 |
random_map_params (); |
78 |
|
|
random_map_params (HV *hv); |
79 |
root |
1.26 |
~random_map_params (); |
80 |
root |
1.6 |
}; |
81 |
root |
1.1 |
|
82 |
root |
1.6 |
enum { |
83 |
|
|
LAYOUT_NONE, |
84 |
|
|
LAYOUT_ONION, |
85 |
|
|
LAYOUT_MAZE, |
86 |
|
|
LAYOUT_SPIRAL, |
87 |
|
|
LAYOUT_ROGUELIKE, |
88 |
|
|
LAYOUT_SNAKE, |
89 |
|
|
LAYOUT_SQUARE_SPIRAL, |
90 |
root |
1.30 |
LAYOUT_CAVE, |
91 |
root |
1.6 |
NROFLAYOUTS, |
92 |
|
|
}; |
93 |
root |
1.1 |
|
94 |
|
|
/* |
95 |
|
|
* Move these defines out of room_gen_onion.c to here, as |
96 |
|
|
* other files (like square_spiral) also uses them. |
97 |
|
|
|
98 |
|
|
options: |
99 |
|
|
0 Pick random options below |
100 |
|
|
1 "centered" |
101 |
|
|
2 linear doors (default is nonlinear) |
102 |
|
|
4 bottom "centered" |
103 |
|
|
8 bottom-right centered |
104 |
|
|
16 irregularly/randomly spaced layers (default: regular) |
105 |
|
|
32 outer wall off: i.e., no outer wall. |
106 |
|
|
|
107 |
|
|
*/ |
108 |
|
|
|
109 |
root |
1.6 |
enum { |
110 |
|
|
RMOPT_RANDOM = 0, |
111 |
|
|
RMOPT_CENTERED = 1, |
112 |
|
|
RMOPT_LINEAR = 2, |
113 |
|
|
RMOPT_BOTTOM_C = 4, |
114 |
|
|
RMOPT_BOTTOM_R = 8, |
115 |
|
|
RMOPT_IRR_SPACE = 16, |
116 |
|
|
RMOPT_WALL_OFF = 32, |
117 |
|
|
RMOPT_WALLS_ONLY = 64, |
118 |
|
|
RMOPT_NO_DOORS = 256, /* Place walls insead of doors. Produces broken map. */ |
119 |
|
|
}; |
120 |
root |
1.1 |
|
121 |
|
|
/* symmetry definitions--used in this file AND in treasure.c: |
122 |
|
|
the numerical values matter so don't change them. */ |
123 |
root |
1.6 |
enum { |
124 |
|
|
SYMMETRY_RANDOM, |
125 |
|
|
SYMMETRY_NONE, |
126 |
|
|
SYMMETRY_X, |
127 |
|
|
SYMMETRY_Y, |
128 |
|
|
SYMMETRY_XY, |
129 |
|
|
}; |
130 |
root |
1.1 |
|
131 |
root |
1.13 |
// 12 has been experimentally :( determined ot be a lot more stable |
132 |
|
|
// than 11 or 10, leading to the assumption that something inherently |
133 |
|
|
// needs a minimum size of at least 12 |
134 |
|
|
#define MIN_RANDOM_MAP_SIZE 12 |
135 |
root |
1.1 |
|
136 |
root |
1.31 |
// we often use signed chars for coordinates (and U8 for distances) |
137 |
|
|
#define MAX_RANDOM_MAP_SIZE 120 |
138 |
|
|
|
139 |
root |
1.20 |
// reference |
140 |
|
|
// |
141 |
|
|
// \0 floor only |
142 |
|
|
// # wall |
143 |
|
|
// D door |
144 |
|
|
// < up |
145 |
|
|
// > down |
146 |
root |
1.34 |
// C "center" (of onion maze) |
147 |
root |
1.20 |
// . ?? (rogue) |
148 |
|
|
// |
149 |
|
|
|
150 |
root |
1.30 |
// use this in new code |
151 |
root |
1.34 |
INTERFACE_CLASS(layout) |
152 |
|
|
struct layout |
153 |
root |
1.17 |
{ |
154 |
root |
1.35 |
typedef char cell; |
155 |
|
|
|
156 |
|
|
cell **data; |
157 |
root |
1.18 |
int w, h; |
158 |
root |
1.17 |
|
159 |
root |
1.34 |
layout (int w, int h); |
160 |
root |
1.36 |
layout (layout ©); |
161 |
root |
1.34 |
~layout (); |
162 |
root |
1.17 |
|
163 |
root |
1.35 |
operator cell **() const |
164 |
root |
1.17 |
{ |
165 |
root |
1.35 |
return data; |
166 |
root |
1.17 |
} |
167 |
root |
1.18 |
|
168 |
root |
1.34 |
void swap (layout &maze) |
169 |
root |
1.32 |
{ |
170 |
root |
1.35 |
::swap (maze.data, data); |
171 |
|
|
::swap (maze.w , w ); |
172 |
|
|
::swap (maze.h , h ); |
173 |
root |
1.32 |
} |
174 |
|
|
|
175 |
root |
1.35 |
MTH void swap (layout *maze) { swap (*maze); } |
176 |
|
|
|
177 |
root |
1.34 |
// for debugging, print maze to stdout |
178 |
|
|
MTH void print () const; |
179 |
root |
1.30 |
|
180 |
|
|
// simple inpainting |
181 |
root |
1.34 |
MTH void fill (char fill); |
182 |
|
|
MTH void clear () { fill (0); } |
183 |
|
|
MTH void border (char fill = '#'); |
184 |
|
|
MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
185 |
root |
1.37 |
MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
186 |
root |
1.29 |
|
187 |
root |
1.34 |
MTH void fill_rand (int perc); |
188 |
root |
1.30 |
|
189 |
root |
1.37 |
// makes sure all areas are connected |
190 |
|
|
MTH void isolation_remover (); |
191 |
root |
1.30 |
|
192 |
|
|
// generates a cave, subtype 0 is a rough cave, randomly open or closed |
193 |
root |
1.34 |
MTH void gen_cave (int subtype); |
194 |
root |
1.33 |
|
195 |
root |
1.34 |
// 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 |
root |
1.30 |
|
203 |
root |
1.32 |
void generate (random_map_params *RP); |
204 |
root |
1.36 |
private: |
205 |
|
|
void alloc (int w, int h); |
206 |
root |
1.17 |
}; |
207 |
|
|
|
208 |
root |
1.25 |
// utility functions, to use rmg_rndm instead of rndm. |
209 |
|
|
static inline int |
210 |
|
|
rmg_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 |
root |
1.30 |
// a simple point helper struct |
219 |
root |
1.29 |
struct point |
220 |
|
|
{ |
221 |
|
|
short x; |
222 |
|
|
short y; |
223 |
|
|
|
224 |
|
|
point () |
225 |
|
|
{ |
226 |
|
|
} |
227 |
|
|
|
228 |
|
|
point (int x, int y) |
229 |
|
|
: x(x), y(y) |
230 |
|
|
{ |
231 |
|
|
} |
232 |
|
|
}; |
233 |
|
|
|
234 |
root |
1.30 |
// something like a vector or stack, but without |
235 |
|
|
// out of bounds checking |
236 |
root |
1.29 |
template<typename T> |
237 |
|
|
struct 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); |
260 |
|
|
} |
261 |
|
|
|
262 |
|
|
void free () |
263 |
|
|
{ |
264 |
|
|
sfree (data, max); |
265 |
|
|
data = 0; |
266 |
|
|
} |
267 |
|
|
|
268 |
|
|
~fixed_stack () |
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 |
|
|
|
294 |
|
|
return v; |
295 |
|
|
} |
296 |
|
|
}; |
297 |
|
|
|
298 |
root |
1.6 |
#endif |
299 |
root |
1.1 |
|