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 | |
29 | struct random_map_params |
30 | struct 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; |
51 | int symmetry; |
|
|
52 | int difficulty; |
39 | int difficulty; |
53 | int difficulty_given; |
40 | int difficulty_given; |
54 | float difficulty_increase; |
41 | float difficulty_increase; |
55 | |
42 | |
56 | int dungeon_level; |
43 | int dungeon_level; |
57 | int dungeon_depth; |
44 | int dungeon_depth; |
58 | |
45 | |
59 | int decoroptions; |
|
|
60 | int orientation; |
|
|
61 | int origin_y; |
|
|
62 | int origin_x; |
|
|
63 | uint32_t random_seed; |
46 | uint32_t random_seed; |
64 | uint64_t total_map_hp; |
47 | uint64_t total_map_hp; |
65 | int map_layout_style; |
|
|
66 | int treasureoptions; |
|
|
67 | int symmetry_used; |
|
|
68 | |
48 | |
69 | struct region *region; |
49 | HV *hv; |
|
|
50 | |
|
|
51 | shstr_tmp as_shstr () const; |
|
|
52 | |
|
|
53 | // fetch something from the options hash |
|
|
54 | SV *get_sv (const char *option) const; |
|
|
55 | const_utf8_string get_str (const char *option, const_utf8_string fallback = "") const; |
|
|
56 | IV get_iv (const char *option, IV fallback = 0) const; |
|
|
57 | UV get_uv (const char *option, UV fallback = 0) const; |
|
|
58 | NV get_nv (const char *option, NV fallback = 0) const; |
|
|
59 | |
|
|
60 | void set (const char *option, SV *value) const; |
|
|
61 | void set (const char *option, const_utf8_string value) const; |
|
|
62 | void set (const char *option, IV value) const; |
|
|
63 | void set (const char *option, UV value) const; |
|
|
64 | void set (const char *option, NV value) const; |
|
|
65 | |
|
|
66 | void set (const char *option, int value) const { set (option, (IV)value); } |
70 | |
67 | |
71 | // "private", adjusted sizes |
68 | // "private", adjusted sizes |
72 | int Xsize; |
69 | int Xsize; |
73 | int Ysize; |
70 | int Ysize; |
|
|
71 | |
|
|
72 | int map_layout_style; |
|
|
73 | int symmetry_used; |
|
|
74 | |
|
|
75 | random_map_params (); |
|
|
76 | random_map_params (random_map_params *RP); |
|
|
77 | random_map_params (HV *hv); |
|
|
78 | ~random_map_params (); |
74 | }; |
79 | }; |
75 | |
80 | |
76 | enum { |
81 | enum { |
77 | LAYOUT_NONE, |
82 | LAYOUT_NONE, |
78 | LAYOUT_ONION, |
83 | LAYOUT_ONION, |
79 | LAYOUT_MAZE, |
84 | LAYOUT_MAZE, |
80 | LAYOUT_SPIRAL, |
85 | LAYOUT_SPIRAL, |
81 | LAYOUT_ROGUELIKE, |
86 | LAYOUT_ROGUELIKE, |
82 | LAYOUT_SNAKE, |
87 | LAYOUT_SNAKE, |
83 | LAYOUT_SQUARE_SPIRAL, |
88 | LAYOUT_SQUARE_SPIRAL, |
|
|
89 | LAYOUT_CAVE, |
|
|
90 | LAYOUT_CASTLE, |
|
|
91 | LAYOUT_MULTIPLE, |
84 | NROFLAYOUTS, |
92 | NROFLAYOUTS, |
85 | }; |
93 | }; |
86 | |
94 | |
87 | /* |
95 | /* |
88 | * Move these defines out of room_gen_onion.c to here, as |
96 | * Move these defines out of room_gen_onion.c to here, as |
… | |
… | |
124 | // 12 has been experimentally :( determined ot be a lot more stable |
132 | // 12 has been experimentally :( determined ot be a lot more stable |
125 | // than 11 or 10, leading to the assumption that something inherently |
133 | // than 11 or 10, leading to the assumption that something inherently |
126 | // needs a minimum size of at least 12 |
134 | // needs a minimum size of at least 12 |
127 | #define MIN_RANDOM_MAP_SIZE 12 |
135 | #define MIN_RANDOM_MAP_SIZE 12 |
128 | |
136 | |
129 | struct MazeData : zero_initialised |
137 | // we often use signed chars for coordinates (and U8 for distances) |
|
|
138 | #define MAX_RANDOM_MAP_SIZE 120 |
|
|
139 | |
|
|
140 | // a simple point helper struct |
|
|
141 | struct point |
130 | { |
142 | { |
131 | char **col; |
143 | int x; |
|
|
144 | int y; |
|
|
145 | |
|
|
146 | point () |
|
|
147 | { |
|
|
148 | } |
|
|
149 | |
|
|
150 | point (int x, int y) |
|
|
151 | : x(x), y(y) |
|
|
152 | { |
|
|
153 | } |
|
|
154 | }; |
|
|
155 | |
|
|
156 | // |
|
|
157 | // reference |
|
|
158 | // |
|
|
159 | // \0 floor only |
|
|
160 | // # wall |
|
|
161 | // D door |
|
|
162 | // < entrance (traditionally up) |
|
|
163 | // > exit (traditionally down) |
|
|
164 | // C "center" (of onion maze) |
|
|
165 | // . ?? (rogue) |
|
|
166 | // |
|
|
167 | |
|
|
168 | // use this in new code |
|
|
169 | INTERFACE_CLASS(layout) |
|
|
170 | struct layout |
|
|
171 | { |
|
|
172 | typedef char cell; |
|
|
173 | |
|
|
174 | cell **data; |
132 | int w, h; |
175 | int w, h; |
133 | |
176 | |
134 | MazeData (int w, int h); |
177 | layout (int w, int h); |
135 | ~MazeData (); |
178 | layout (layout ©); |
136 | |
179 | |
137 | operator char **() |
180 | // reference rect in other layout - will not keep the data alive, |
|
|
181 | // so never swap with it's orig, or free the orig when in use. |
|
|
182 | layout (layout &orig, int x1, int y1, int x2, int y2); |
|
|
183 | |
|
|
184 | ~layout (); |
|
|
185 | |
|
|
186 | operator cell **() const |
138 | { |
187 | { |
139 | return col; |
188 | return data; |
140 | } |
189 | } |
141 | |
190 | |
142 | void clear (char fill = 0); |
191 | void swap (layout &maze) |
|
|
192 | { |
|
|
193 | ::swap (maze.data, data); |
|
|
194 | ::swap (maze.w , w ); |
|
|
195 | ::swap (maze.h , h ); |
|
|
196 | ::swap (maze.size, size); |
|
|
197 | } |
|
|
198 | |
|
|
199 | MTH void swap (layout *maze) { swap (*maze); } |
|
|
200 | |
|
|
201 | // for debugging, print maze to stdout |
|
|
202 | MTH void print () const; |
|
|
203 | |
|
|
204 | // simple inpainting |
|
|
205 | MTH void fill (char fill); |
|
|
206 | MTH void clear () { fill (0); } |
143 | void border (char fill = '#'); |
207 | MTH void border (char fill = '#'); |
144 | }; |
208 | MTH void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
|
|
209 | MTH void fill_rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
145 | |
210 | |
146 | struct Maze |
211 | MTH void fill_rand (int perc); |
147 | { |
212 | MTH void replace (char from, char to); |
148 | MazeData *ptr; |
|
|
149 | |
213 | |
150 | Maze () |
214 | point find (char target, int mode = 0); // mode 0=random, 1=upleft, 2=upright, 3=downright, 4=downleft |
151 | { |
|
|
152 | } |
|
|
153 | |
215 | |
154 | Maze (int xsize, int ysize) |
216 | // makes sure all areas are connected |
155 | : ptr (new MazeData (xsize, ysize)) |
217 | // perturb = 0 - very horz/vert tunnels |
156 | { |
218 | // perturb = 1 - straight but round |
157 | } |
219 | // perturb = 2 - snaky tunnels |
|
|
220 | MTH void isolation_remover (int perturb = 2); |
158 | |
221 | |
|
|
222 | // generates a cave, subtype 0 is a rough cave, randomly open or closed |
|
|
223 | MTH void gen_cave (int subtype); |
|
|
224 | MTH void gen_castle (); // generates straightish structures |
|
|
225 | |
|
|
226 | // helper functions to modify the maze |
|
|
227 | MTH void erode_1_2 (int c1, int c2 = -1, int repeat = 1); |
|
|
228 | MTH void doorify (); |
|
|
229 | MTH void roomify (); // make some rooms in it, works best on onions |
|
|
230 | MTH void expand2x (); |
|
|
231 | MTH void symmetrize (int symmetry); |
|
|
232 | MTH void rotate (int rotation); // rotate by 1=90, 2=180, 3=270 degrees |
|
|
233 | |
159 | Maze (random_map_params *RP) |
234 | void generate (random_map_params *RP); |
160 | : ptr (new MazeData (RP->Xsize, RP->Ysize)) |
235 | private: |
|
|
236 | int size; |
|
|
237 | void alloc (int w, int h); |
|
|
238 | }; |
|
|
239 | |
|
|
240 | // utility functions, to use rmg_rndm instead of rndm. |
|
|
241 | static inline int |
|
|
242 | rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
|
|
243 | { |
|
|
244 | swap (rmg_rndm, rndm); |
|
|
245 | int i = find_free_spot (ob, m, x, y, start, stop); |
|
|
246 | swap (rmg_rndm, rndm); |
|
|
247 | return i; |
|
|
248 | } |
|
|
249 | |
|
|
250 | // something like a vector or stack, but without |
|
|
251 | // out of bounds checking |
|
|
252 | template<typename T> |
|
|
253 | struct fixed_stack |
|
|
254 | { |
|
|
255 | T *data; |
|
|
256 | int size; |
|
|
257 | int max; |
|
|
258 | |
|
|
259 | fixed_stack () |
|
|
260 | : size (0), data (0) |
161 | { |
261 | { |
|
|
262 | } |
|
|
263 | |
|
|
264 | fixed_stack (int max) |
|
|
265 | : size (0), max (max) |
|
|
266 | { |
|
|
267 | data = salloc<T> (max); |
|
|
268 | } |
|
|
269 | |
|
|
270 | void reset (int new_max) |
|
|
271 | { |
|
|
272 | sfree (data, max); |
|
|
273 | size = 0; |
|
|
274 | max = new_max; |
|
|
275 | data = salloc<T> (max); |
162 | } |
276 | } |
163 | |
277 | |
164 | void free () |
278 | void free () |
165 | { |
279 | { |
166 | delete ptr; |
280 | sfree (data, max); |
|
|
281 | data = 0; |
167 | } |
282 | } |
168 | |
283 | |
169 | MazeData *operator ->() const |
284 | ~fixed_stack () |
170 | { |
285 | { |
|
|
286 | sfree (data, max); |
|
|
287 | } |
|
|
288 | |
|
|
289 | T &operator[](int idx) |
|
|
290 | { |
|
|
291 | return data [idx]; |
|
|
292 | } |
|
|
293 | |
|
|
294 | void push (T v) |
|
|
295 | { |
|
|
296 | data [size++] = v; |
|
|
297 | } |
|
|
298 | |
|
|
299 | T &pop () |
|
|
300 | { |
|
|
301 | return data [--size]; |
|
|
302 | } |
|
|
303 | |
|
|
304 | T remove (int idx) |
|
|
305 | { |
|
|
306 | T v = data [idx]; |
|
|
307 | |
|
|
308 | data [idx] = data [--size]; |
|
|
309 | |
171 | return ptr; |
310 | return v; |
172 | } |
|
|
173 | |
|
|
174 | operator char **() const |
|
|
175 | { |
|
|
176 | return *ptr; |
|
|
177 | } |
|
|
178 | |
|
|
179 | void swap (Maze &maze) |
|
|
180 | { |
|
|
181 | MazeData *p = maze.ptr; |
|
|
182 | maze.ptr = ptr; |
|
|
183 | ptr = p; |
|
|
184 | } |
311 | } |
185 | }; |
312 | }; |
186 | |
313 | |
187 | #endif |
314 | #endif |
188 | |
315 | |