1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 | * Crossfire TRT 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 <crossfire@schmorp.de> |
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 | struct random_map_params |
28 | #include "util.h" |
|
|
29 | |
|
|
30 | struct random_map_params : zero_initialised |
28 | { |
31 | { |
29 | char wallstyle[512]; |
|
|
30 | char wall_name[512]; |
32 | char wall_name[512]; |
31 | char floorstyle[512]; |
|
|
32 | char monsterstyle[512]; |
33 | char monsterstyle[512]; |
33 | char treasurestyle[512]; |
|
|
34 | char layoutstyle[512]; |
34 | char layoutstyle[512]; |
35 | char doorstyle[512]; |
35 | char doorstyle[512]; |
36 | char decorstyle[512]; |
|
|
37 | shstr origin_map; |
36 | shstr origin_map; |
38 | shstr final_map; |
37 | shstr final_map; |
39 | char exitstyle[512]; |
|
|
40 | shstr this_map; |
38 | shstr this_map; |
41 | char exit_on_final_map[512]; |
39 | char exit_on_final_map[512]; |
42 | char *custom; |
40 | |
43 | |
|
|
44 | int xsize, ysize; |
41 | int xsize, ysize; |
45 | int expand2x; |
42 | int expand2x; |
46 | int layoutoptions1; |
43 | int layoutoptions1; |
47 | int layoutoptions2; |
44 | int layoutoptions2; |
48 | int layoutoptions3; |
45 | int layoutoptions3; |
… | |
… | |
52 | float difficulty_increase; |
49 | float difficulty_increase; |
53 | |
50 | |
54 | int dungeon_level; |
51 | int dungeon_level; |
55 | int dungeon_depth; |
52 | int dungeon_depth; |
56 | |
53 | |
57 | int decoroptions; |
|
|
58 | int orientation; |
54 | int orientation; |
|
|
55 | int origin_x; |
59 | int origin_y; |
56 | int origin_y; |
60 | int origin_x; |
|
|
61 | uint32_t random_seed; |
57 | uint32_t random_seed; |
62 | uint64_t total_map_hp; |
58 | uint64_t total_map_hp; |
63 | int map_layout_style; |
59 | int map_layout_style; |
64 | int treasureoptions; |
|
|
65 | int symmetry_used; |
60 | int symmetry_used; |
66 | |
61 | |
67 | struct region *region; |
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); } |
68 | |
83 | |
69 | // "private", adjusted sizes |
84 | // "private", adjusted sizes |
70 | int Xsize; |
85 | int Xsize; |
71 | int Ysize; |
86 | int Ysize; |
|
|
87 | |
|
|
88 | ~random_map_params (); |
72 | }; |
89 | }; |
73 | |
90 | |
74 | enum { |
91 | enum { |
75 | LAYOUT_NONE, |
92 | LAYOUT_NONE, |
76 | LAYOUT_ONION, |
93 | LAYOUT_ONION, |
77 | LAYOUT_MAZE, |
94 | LAYOUT_MAZE, |
78 | LAYOUT_SPIRAL, |
95 | LAYOUT_SPIRAL, |
79 | LAYOUT_ROGUELIKE, |
96 | LAYOUT_ROGUELIKE, |
80 | LAYOUT_SNAKE, |
97 | LAYOUT_SNAKE, |
81 | LAYOUT_SQUARE_SPIRAL, |
98 | LAYOUT_SQUARE_SPIRAL, |
|
|
99 | LAYOUT_CAVE, |
82 | NROFLAYOUTS, |
100 | NROFLAYOUTS, |
83 | }; |
101 | }; |
84 | |
102 | |
85 | /* |
103 | /* |
86 | * Move these defines out of room_gen_onion.c to here, as |
104 | * Move these defines out of room_gen_onion.c to here, as |
… | |
… | |
122 | // 12 has been experimentally :( determined ot be a lot more stable |
140 | // 12 has been experimentally :( determined ot be a lot more stable |
123 | // than 11 or 10, leading to the assumption that something inherently |
141 | // than 11 or 10, leading to the assumption that something inherently |
124 | // needs a minimum size of at least 12 |
142 | // needs a minimum size of at least 12 |
125 | #define MIN_RANDOM_MAP_SIZE 12 |
143 | #define MIN_RANDOM_MAP_SIZE 12 |
126 | |
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 layout) |
|
|
156 | // . ?? (rogue) |
|
|
157 | // |
|
|
158 | |
|
|
159 | // use this in new code |
|
|
160 | struct Layout |
|
|
161 | { |
|
|
162 | char **col; |
|
|
163 | int w, h; |
|
|
164 | |
|
|
165 | Layout (int w, int h); |
|
|
166 | ~Layout (); |
|
|
167 | |
|
|
168 | operator char **() |
|
|
169 | { |
|
|
170 | return col; |
|
|
171 | } |
|
|
172 | |
|
|
173 | void swap (Layout &layout) |
|
|
174 | { |
|
|
175 | ::swap (layout.col, col); |
|
|
176 | ::swap (layout.w , w ); |
|
|
177 | ::swap (layout.h , h ); |
|
|
178 | } |
|
|
179 | |
|
|
180 | // for debugging, print layout to stdout |
|
|
181 | void print (); |
|
|
182 | |
|
|
183 | // simple inpainting |
|
|
184 | void fill (char fill); |
|
|
185 | void clear () { fill (0); } |
|
|
186 | void border (char fill = '#'); |
|
|
187 | void rect (int x1, int y1, int x2, int y2, char fill); // x2, y2 exclusive |
|
|
188 | |
|
|
189 | void fill_rand (int perc); |
|
|
190 | |
|
|
191 | // makes sure all areas are connected. dirty=true carves rounder but also |
|
|
192 | // more walls, dirty=false carves narrow corridors. |
|
|
193 | void isolation_remover (bool dirty = 0); |
|
|
194 | |
|
|
195 | // generates a cave, subtype 0 is a rough cave, randomly open or closed |
|
|
196 | void gen_cave (int subtype); |
|
|
197 | void erode_1_2 (int c1, int c2 = -1, int repeat = 1); |
|
|
198 | |
|
|
199 | void generate (random_map_params *RP); |
|
|
200 | }; |
|
|
201 | |
|
|
202 | // utility functions, to use rmg_rndm instead of rndm. |
|
|
203 | static inline int |
|
|
204 | rmg_find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
|
|
205 | { |
|
|
206 | swap (rmg_rndm, rndm); |
|
|
207 | int i = find_free_spot (ob, m, x, y, start, stop); |
|
|
208 | swap (rmg_rndm, rndm); |
|
|
209 | return i; |
|
|
210 | } |
|
|
211 | |
|
|
212 | // a simple point helper struct |
|
|
213 | struct point |
|
|
214 | { |
|
|
215 | short x; |
|
|
216 | short y; |
|
|
217 | |
|
|
218 | point () |
|
|
219 | { |
|
|
220 | } |
|
|
221 | |
|
|
222 | point (int x, int y) |
|
|
223 | : x(x), y(y) |
|
|
224 | { |
|
|
225 | } |
|
|
226 | }; |
|
|
227 | |
|
|
228 | // something like a vector or stack, but without |
|
|
229 | // out of bounds checking |
|
|
230 | template<typename T> |
|
|
231 | struct fixed_stack |
|
|
232 | { |
|
|
233 | T *data; |
|
|
234 | int size; |
|
|
235 | int max; |
|
|
236 | |
|
|
237 | fixed_stack () |
|
|
238 | : size (0), data (0) |
|
|
239 | { |
|
|
240 | } |
|
|
241 | |
|
|
242 | fixed_stack (int max) |
|
|
243 | : size (0), max (max) |
|
|
244 | { |
|
|
245 | data = salloc<T> (max); |
|
|
246 | } |
|
|
247 | |
|
|
248 | void reset (int new_max) |
|
|
249 | { |
|
|
250 | sfree (data, max); |
|
|
251 | size = 0; |
|
|
252 | max = new_max; |
|
|
253 | data = salloc<T> (max); |
|
|
254 | } |
|
|
255 | |
|
|
256 | void free () |
|
|
257 | { |
|
|
258 | sfree (data, max); |
|
|
259 | data = 0; |
|
|
260 | } |
|
|
261 | |
|
|
262 | ~fixed_stack () |
|
|
263 | { |
|
|
264 | sfree (data, max); |
|
|
265 | } |
|
|
266 | |
|
|
267 | T &operator[](int idx) |
|
|
268 | { |
|
|
269 | return data [idx]; |
|
|
270 | } |
|
|
271 | |
|
|
272 | void push (T v) |
|
|
273 | { |
|
|
274 | data [size++] = v; |
|
|
275 | } |
|
|
276 | |
|
|
277 | T &pop () |
|
|
278 | { |
|
|
279 | return data [--size]; |
|
|
280 | } |
|
|
281 | |
|
|
282 | T remove (int idx) |
|
|
283 | { |
|
|
284 | T v = data [idx]; |
|
|
285 | |
|
|
286 | data [idx] = data [--size]; |
|
|
287 | |
|
|
288 | return v; |
|
|
289 | } |
|
|
290 | }; |
|
|
291 | |
127 | #endif |
292 | #endif |
128 | |
293 | |